Towards Ordinal Data Science

• URL: http://arxiv.org/abs/2307.09477v2
• Date: Wed, 6 Dec 2023 15:09:17 GMT
• Title: Towards Ordinal Data Science
• Authors: Gerd Stumme, Dominik D\"urrschnabel, Tom Hanika
• Abstract summary: Ordinal Data Science aims to establish Ordinal Data Science as a fundamentally new research agenda. Our aim is to establish Ordinal Data Science as a fundamentally new research agenda.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Order is one of the main instruments to measure the relationship between objects in (empirical) data. However, compared to methods that use numerical properties of objects, the amount of ordinal methods developed is rather small. One reason for this is the limited availability of computational resources in the last century that would have been required for ordinal computations. Another reason -- particularly important for this line of research -- is that order-based methods are often seen as too mathematically rigorous for applying them to real-world data. In this paper, we will therefore discuss different means for measuring and 'calculating' with ordinal structures -- a specific class of directed graphs -- and show how to infer knowledge from them. Our aim is to establish Ordinal Data Science as a fundamentally new research agenda. Besides cross-fertilization with other cornerstone machine learning and knowledge representation methods, a broad range of disciplines will benefit from this endeavor, including, psychology, sociology, economics, web science, knowledge engineering, scientometrics.

Related papers

• Reinforcement Learning for Data-Driven Workflows in Radio Interferometry. I. Principal Demonstration in Calibration [1.167489362272148]
  Radio interferometry is an observational technique used to study astrophysical phenomena. Data gathered by an interferometer requires substantial processing before astronomers can extract the scientific information from it. This paper introduces a simplified description of the principles behind interferometry and the procedures required for data processing.
  arXiv  Detail & Related papers  (2024-10-22T16:07:55Z)
• Ontology Embedding: A Survey of Methods, Applications and Resources [54.3453925775069]
  Ontologies are widely used for representing domain knowledge and meta data. One straightforward solution is to integrate statistical analysis and machine learning. Numerous papers have been published on embedding, but a lack of systematic reviews hinders researchers from gaining a comprehensive understanding of this field.
  arXiv  Detail & Related papers  (2024-06-16T14:49:19Z)
• Regularization-Based Methods for Ordinal Quantification [49.606912965922504]
  We study the ordinal case, i.e., the case in which a total order is defined on the set of n>2 classes. We propose a novel class of regularized OQ algorithms, which outperforms existing algorithms in our experiments.
  arXiv  Detail & Related papers  (2023-10-13T16:04:06Z)
• Position Paper on Dataset Engineering to Accelerate Science [1.952708415083428]
  In this work, we will use the token ittextdataset to designate a structured set of data built to perform a well-defined task. Specifically, in science, each area has unique forms to organize, gather and handle its datasets. We advocate that science and engineering discovery processes are extreme instances of the need for such organization on datasets.
  arXiv  Detail & Related papers  (2023-03-09T19:07:40Z)
• Greedy Discovery of Ordinal Factors [0.0]
  In large datasets, it is hard to discover and analyze structure. An ordinal factor arranges a subset of the tags in a linear order based on their underlying structure. A complete ordinal factorization, which consists of such ordinal factors, precisely represents the original dataset.
  arXiv  Detail & Related papers  (2023-02-19T20:33:24Z)
• Towards a Holistic Understanding of Mathematical Questions with Contrastive Pre-training [65.10741459705739]
  We propose a novel contrastive pre-training approach for mathematical question representations, namely QuesCo. We first design two-level question augmentations, including content-level and structure-level, which generate literally diverse question pairs with similar purposes. Then, to fully exploit hierarchical information of knowledge concepts, we propose a knowledge hierarchy-aware rank strategy.
  arXiv  Detail & Related papers  (2023-01-18T14:23:29Z)
• A Survey of Deep Learning for Mathematical Reasoning [71.88150173381153]
  We review the key tasks, datasets, and methods at the intersection of mathematical reasoning and deep learning over the past decade. Recent advances in large-scale neural language models have opened up new benchmarks and opportunities to use deep learning for mathematical reasoning.
  arXiv  Detail & Related papers  (2022-12-20T18:46:16Z)
• An Extensible Benchmark Suite for Learning to Simulate Physical Systems [60.249111272844374]
  We introduce a set of benchmark problems to take a step towards unified benchmarks and evaluation protocols. We propose four representative physical systems, as well as a collection of both widely used classical time-based and representative data-driven methods.
  arXiv  Detail & Related papers  (2021-08-09T17:39:09Z)
• Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges [50.22269760171131]
  The last decade has witnessed an experimental revolution in data science and machine learning, epitomised by deep learning methods. This text is concerned with exposing pre-defined regularities through unified geometric principles. It provides a common mathematical framework to study the most successful neural network architectures, such as CNNs, RNNs, GNNs, and Transformers.
  arXiv  Detail & Related papers  (2021-04-27T21:09:51Z)
• Exploring Scale-Measures of Data Sets [0.0]
  A profound theory for scaling data is scale-measures, as developed in the field of formal concept analysis. Recent developments indicate that the set of all scale-measures for a given data set constitutes a lattice. We propose a novel scale-measure exploration algorithm that is based on the well-known and proven attribute exploration approach.
  arXiv  Detail & Related papers  (2021-02-04T12:29:15Z)
• Deep learning for time series classification [2.0305676256390934]
  Time series analysis allows us to visualize and understand the evolution of a process over time. Time series classification consists of constructing algorithms dedicated to automatically label time series data. Deep learning has emerged as one of the most effective methods for tackling the supervised classification task.
  arXiv  Detail & Related papers  (2020-10-01T17:38:40Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.