Advertisement

Journal of Classification

, Volume 36, Issue 2, pp 350–367 | Cite as

Distance and Consensus for Preference Relations Corresponding to Ordered Partitions

  • Boris MirkinEmail author
  • Trevor I. Fenner
Article
  • 61 Downloads

Abstract

Ranking is an important part of several areas of contemporary research, including social sciences, decision theory, data analysis, and information retrieval. The goal of this paper is to align developments in quantitative social sciences and decision theory with the current thought in Computer Science, including a few novel results. Specifically, we consider binary preference relations, the so-called weak orders that are in one-to-one correspondence with rankings. We show that the conventional symmetric difference distance between weak orders, considered as sets of ordered pairs, coincides with the celebrated Kemeny distance between the corresponding rankings, despite the seemingly much simpler structure of the former. Based on this, we review several properties of the geometric space of weak orders involving the ternary relation “between,” and contingency tables for cross-partitions. Next, we reformulate the consensus ranking problem as a variant of finding an optimal linear ordering, given a correspondingly defined consensus matrix. The difference is in a subtracted term, the partition concentration that depends only on the distribution of the objects in the individual parts. We apply our results to the conventional Likert scale to show that the Kemeny consensus rule is rather insensitive to the data under consideration and, therefore, should be supplemented with more sensitive consensus schemes.

Keywords

Ranking Tied ranking Ordered partition Weak order Distance Consensus Muchnik test 

Notes

Acknowledgments

BM acknowledges support by the Basic Research Program at the National Research University Higher School of Economics (NRU HSE) within the framework of a subsidy by the Russian Academic Excellence Project ‘5–100’. His work was conducted in the International Laboratory of Decision Choice and Analysis (DeCAn Lab) of the NRU HSE.

References

  1. Aleskerov, F., & Monjardet, B. (2002). Utility maximization, choice, and preference, Stud. Econ. Theory 16. Berlin: Springer-Verlag.CrossRefGoogle Scholar
  2. Allen, I. E., & Seaman, C. A. (2007). Likert scales and data analyses. Quality Progress, 40(7), 64.Google Scholar
  3. Amor, S. B., & Martel, J. M. (2014). A new distance measure including the weak preference relation: application to the multiple criteria aggregation procedure for mixed evaluations. European Journal of Operational Research, 237(3), 1165–1169.MathSciNetCrossRefGoogle Scholar
  4. Barthélemy, J. P., Leclerc, B., & Monjardet, B. (1986). On the use of ordered sets in problems of comparison and consensus of classifications. Journal of Classification, 3(2), 187–224.MathSciNetCrossRefGoogle Scholar
  5. Baulieu, F. B. (1989). A classification of presence/absence based dissimilarity coefficients. Journal of Classification, 6(1), 233–246.MathSciNetCrossRefGoogle Scholar
  6. Charon, I., & Hudry, O. (2007). A survey on the linear ordering problem for weighted or unweighted tournaments. 4OR. A Quarterly Journal of Operations Research, 5(1), 5–60.MathSciNetzbMATHGoogle Scholar
  7. Cook, W. D. (2006). Distance-based and ad hoc consensus models in ordinal preference ranking. European Journal of Operational Research, 172(2), 369–385.MathSciNetCrossRefGoogle Scholar
  8. Critchlow, D.E. (1980). Springer-Verlag, Berlin. See also: Critchlow, D.E., 2012. Metric methods for analyzing partially ranked data (34). Springer Science & Business Media.Google Scholar
  9. Daniels, H. E. (1944). The relation between measures of correlation in the universe of sample permutations. Biometrika, 33(2), 129–135.MathSciNetCrossRefGoogle Scholar
  10. Diaconis, F., & Graham, R. (1977). Spearman’s footrule as a measure of disarray. Journal of Royal Statistics Society, Series B, 39, 262–268.MathSciNetzbMATHGoogle Scholar
  11. Dwork, C., Kumar, R., Naor, M. and Sivakumar, D. (2001) Rank aggregation revisited, http://static.cs.brown.edu/courses/csci2531/papers/rank2.pdf.
  12. Emond, E. J., & Mason, D. W. (2002). A new rank correlation coefficient with application to the consensus ranking problem. Journal of Multi-Criteria Decision Analysis, 11, 17–28.CrossRefGoogle Scholar
  13. Fagin, R., Kumar, R., Mahdian, M., Sivakumar, D., & Vee, E. (2006). Comparing partial rankings. SIAM Journal of Discrete Mathematics, 20(3), 628–648.MathSciNetCrossRefGoogle Scholar
  14. Grötschel, M., Jünger, M., & Reinelt, G. (1983). Optimal triangulation of large real world input-output matrices. Statistische Hefte, 25(1), 261–295.CrossRefGoogle Scholar
  15. Guénoche, A. (2011). Consensus of partitions: A constructive approach. Advances in Data Analysis and Classification, 5(3), 215–229.MathSciNetCrossRefGoogle Scholar
  16. Heiser, W. J., & D’Ambrosio, A. (2013). Clustering and prediction of rankings within a Kemeny distance framework. In B. Lausen, D. Van der Poel, & A. Ultsch (Eds.), Algorithms from and for Nature and Life, Studies in Classification, Data Analysis, and Knowledge Organization (pp. 19–31). Switzerland: Springer International.Google Scholar
  17. Kemeny, J.G. (1959). Mathematics without numbers, Daedalus, 88, No. 4. Quantity and Quality, pp 577–591.Google Scholar
  18. Kemeny, J., & Snell, L. (1962). Mathematical models in social sciences. New-York: Blaisdell.zbMATHGoogle Scholar
  19. Kendall, M. G. (1938). A new measure of rank correlation. Biometrika, 30, 81–93.CrossRefGoogle Scholar
  20. Lehmann, E. L., & D'Abrera, H. J. (2006). Nonparametrics: statistical methods based on ranks. New York: Springer.zbMATHGoogle Scholar
  21. Likert, R. (1932). A technique for the measurement of attitudes. Archives of Psychology, 22(140), 55.Google Scholar
  22. Meilă, M. (2007). Comparing clusterings—an information based distance. Journal of Multivariate Analysis, 98(5), 873–895.MathSciNetCrossRefGoogle Scholar
  23. Mirkin, B. (1979) Group Choice. Halsted Press, Washington DC (Translated from Russian “Problema Gruppovogo Vybora”, Nauka Physics-Mathematics, Moscow, 1974).Google Scholar
  24. Mirkin, B. (2012). Clustering: A data recovery approach. Boka-Raton: CRC Press/Chapman & Hall.zbMATHGoogle Scholar
  25. Mirkin, B., & Cherny, L. (1972). Some properties of the partition space. In K. Bagrinovsky & E. Berland (Eds.), Mathematical analysis of economic models III (pp. 126–147). Novosibirsk: Institute of Economics of the Siberian Branch of the USSR’s Academy of the Sciences (in Russian).Google Scholar
  26. Monjardet, B. (1978). An axiomatic theory of tournament aggregation. Mathematics of Operations Research, 3(4), 334–351.MathSciNetCrossRefGoogle Scholar
  27. Morlini, I., & Zani, S. (2012). A new class of weighted similarity indices using polytomous variables. Journal of Classification, 29(2), 199–226.MathSciNetCrossRefGoogle Scholar
  28. Nandi, A.K., Fa, R. and Abu-Jamous, B. (2015). Integrative cluster analysis in bioinformatics. John Wiley & Sons.Google Scholar
  29. Snijders, T. A., Dormaar, M., Van Schuur, W. H., Dijkman-Caes, C., & Driessen, G. (1990). Distribution of some similarity coefficients for dyadic binary data in the case of associated attributes. Journal of Classification, 7(1), 5–31.MathSciNetCrossRefGoogle Scholar
  30. Spearman, C. (1904). The proof and measurement of association between two things. The American Journal of Psychology, 15, 72–101.CrossRefGoogle Scholar
  31. Steele, K. & Stefánsson, H. O. (2015). Decision theory, the stanford encyclopedia of philosophy (Winter 2015 Edition). In E. N. Zalta (Ed.), URL = <http://plato.stanford.edu/archives/win2015/entries/decision-theory/>.
  32. Xu, W., Hou, Y., Hung, Y. S., & Zou, Y. (2013). A comparative analysis of Spearman’s rho and Kendall's tau in normal and contaminated normal models. Signal Processing, 93(1), 261–276.CrossRefGoogle Scholar

Copyright information

© The Classification Society 2019

Authors and Affiliations

  1. 1.Department of Data Analysis and Machine IntelligenceNational Research University Higher School of EconomicsMoscow RFRussia
  2. 2.Department of Computer ScienceBirkbeck University of LondonLondonUK

Personalised recommendations