2022
DOI: 10.48550/arxiv.2203.07364
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

A Supervised Learning Approach to Rankability

Abstract: The rankability of data is a recently proposed problem that considers the ability of a dataset, represented as a graph, to produce a meaningful ranking of the items it contains. To study this concept, a number of rankability measures have recently been proposed, based on comparisons to a complete dominance graph via combinatorial and linear algebraic methods. In this paper, we review these measures and highlight some questions to which they give rise before going on to propose new methods to assess rankability… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2022
2022
2022
2022

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…We invite researchers from these communities to add methods, data, and code to RPLIB. For example, rankability researchers from the U.S. and Europe have created interesting artificial datasets and new methods [5,11].…”
Section: User-contributed Datamentioning
confidence: 99%
“…We invite researchers from these communities to add methods, data, and code to RPLIB. For example, rankability researchers from the U.S. and Europe have created interesting artificial datasets and new methods [5,11].…”
Section: User-contributed Datamentioning
confidence: 99%