Abstract
In this paper we propose the problem of finding the cyclic sequence which best represents a set of cyclic sequences. Given a set of elements and a precedence cost matrix we look for the cyclic sequence of the elements which is at minimum distance from all the ranks when the permutation metric distance is the Kendall Tau distance. In other words, the problem consists of finding a robust cyclic rank with respect to a set of elements. This problem originates from the Rank Aggregation Problem for combining different linear ranks of elements. Next, we also introduce the problem of finding the cyclic sequence with minimum expected cost with respect to a probability measure based on dissimilarity between cyclic sequences on the Kendall Tau metric. Finally, we establish certain relationships among some classical problems and the new problems that we have proposed.
Similar content being viewed by others
References
Aledo, J.A., Gàmez, J.A., Molina, D.: Tackling the rank aggregation problem with evolutionay algorithms. Appl. Math. Comput. 222, 632–644 (2013)
Ali, A., Meilă, M.: Experiments with Kemeny ranking: what works when? Math. Soc. Sci. 64, 28–40 (2012)
Andoni, A., Fagin, R., Kumar, R., Patrascu, M., Sivakumar, D.: Efficient similarity search and classification via rank aggregation. In: Proceedings of the ACM SIG-MOD International Conference on Management of Data, pp. 1375–1376 (2008)
Betzler, N., Brederec, R., Niedermeier, R.: Theoretical and empirical evaluation of data reduction for exact Kemeny rank aggregation. Auton. Agents Multi Agent Syst. 28(5), 721–748 (2014)
Bolotashvili, G.G., Demidenko, V.M., Pisaruk, N.N.: Fence facets from non-regular graphs for the linear ordering polytope. Optim. Lett. 8, 841–848 (2014)
Charon, I., Hudry, O.: A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR 5, 5–60 (2007)
Claiborne Price, C.: Applications of operations research models to problems in health care. University of Maryland, College Park (2009)
Carrizosa, E., Guerrero, V., Romero-Morales, D.: A multi-objective approach to visualize proportions and similarities between individuals by rectangular maps. http://www.optimization-online.org (2015)
Conitzer, V., Davenport, A., Kalagnanam, J.: Improved bounds for computing Kemeny rankings. In: Proceedings of the 21st National Conference on Artificial intelligence, pp. 620–626 (2006)
Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the Tenth International World Wide Web Conference (WWW’01), pp. 613–622 (2001)
Fagin, R., Kumar, R., Sivakumar, D.: Eficient similarity search and classification via rank aggregation. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 301–312 (2003)
Gattaca, Lv.: An analysis of rank aggregation algorithms. In: Data Structures and Algorithms. arXiv:1402.5259v5 (2014)
Grotschel, M., Junger, M., Reinelt, G.: Facets of the linear ordering polytope. Math. Program. 33, 43–60 (1985)
Grundel, D.A., Jeffcoat, D.E.: Formulation and solution of the target visitation problem. In: Proceedings of the AIAA 1st Intelligent Systems Technical Conferences (2004)
Hildenbrandt, A.: The Target Visitation Problem. PhD thesis. http://www.ub.uni-heidelberg.de/archiv/17993 (2015)
Leung, J., Lee, J.: More facets from fences for linear ordering and acyclic subgraph polytopes. Discrete Appl. Math. 50(2), 185–200 (1994)
Martí, R., Reinelt, G.: The Lineal Ordering Problem. Exact and Heuristic Methods in Combinational Optimization. Springer, New York (2011)
Oswald, M., Reinelt, G., Seitz, H.: Applying mod-\(k\)-cuts for solving linear ordering problems. Top 17(1), 158–170 (2009)
Reinelt, G.: The Linear Ordering Problem. Algorithms and Applications. Heldermann, Germany (1985)
Reinelt, G.: TSPLIB—a traveling salesman problem library. ORSA J. Comput. 3(4), 376–384 (1991)
Schalekamp, F., Zuylen, A.V. : Rank aggregation: together we’re strong. ALENEX 38–51 (2009)
Yasutake, S., Hatano, K., Takimoto, E., Takeda, M.: Online rank aggregation. In: JMLR: Workshop and Conference Proceedings. Asian Conference on Machine Learning, vol. 25, pp. 539–553 (2012)
Acknowledgments
This work was partly supported by the Spanish Ministry of Economy and Competitiveness through Grants MTM2013-46962-C02-01, MTM2015-68097-P (MINECO/FEDER) and by Regional Government of Andalucía Grant FQM5849.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
García-Nové, E.M., Alcaraz, J., Landete, M. et al. Rank aggregation in cyclic sequences. Optim Lett 11, 667–678 (2017). https://doi.org/10.1007/s11590-016-1047-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11590-016-1047-z