Developing a ranking problem library (RPLIB) from a data-oriented perspective

DOI10.1007/S11081-022-09771-YMaRDI QIDQ6050403zbMATH OpenFDO

Authors Paul E. Anderson, Amy N. Langville, Kathryn E. Pedings-Behling, Brandon Tat, Charlie Ward

Publication date 18 September 2023

Published in Optimization and Engineering (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2206.11258

zbMATH Keywords

artificial dataColley rankingsinteger programminglinear ordering problemlinear programmingMassey rankingsrankabilityranking problem library

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04) Linear programming (90C05) Integer programming (90C10)

Abstract: We present an improved library for the ranking problem called RPLIB. RPLIB includes the following data and features. (1) Real and artificial datasets of both pairwise data (i.e., information about the ranking of pairs of items) and feature data (i.e., a vector of features about each item to be ranked). These datasets range in size (e.g., from small $n=10$ item datasets to large datasets with hundred of items), application (e.g., from sports to economic data), and source (e.g. real versus artificially generated to have particular structures). (2) RPLIB contains code for the most common ranking algorithms such as the linear ordering optimization method and the Massey method. (3) RPLIB also has the ability for users to contribute their own data, code, and algorithms. Each RPLIB dataset has an associated .JSON model card of additional information such as the number and set of optimal rankings, the optimal objective value, and corresponding figures.

Recommendations

• A novel ranking framework for linked data from relational databases
• Using mathematical programming to solve large ranking problems
• Learning and decision-making from rank data
• An efficient approach for the rank aggregation problem
• Data-driven rank breaking for efficient rank aggregation
• Label ranking algorithms: a survey
• A numerical tool for multiattribute ranking problems

Cites work

• A Cutting Plane Algorithm for the Linear Ordering Problem
• A minimum violations ranking method
• Fairness and the set of optimal rankings for the linear ordering problem
• On the graph Laplacian and the rankability of data
• The linear ordering problem. Exact and heuristic methods in combinatorial optimization.
• The rankability of data

Cited in

(1)

• A supervised learning approach to rankability

This page was built for publication: Developing a ranking problem library (RPLIB) from a data-oriented perspective

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6050403)