Statistical ranking and combinatorial Hodge theory

Mathematical Programming

Volumn 127, Issue 1, 2011, Pages 203-244

  Jiang, Xiaoye ^a   Lim, Lek Heng ^b   Yao, Yuan ^c   Ye, Yinyu ^a  

^a Stanford University   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

^c Peking University   (China)

Author keywords

Borda count; Combinatorial Hodge theory; Combinatorial Laplacian; Discrete exterior calculus; Graph Helmholtzian; Hodge Laplacian; HodgeRank; Kemeny optimization; Rank aggregation; Statistical ranking

Indexed keywords

BORDA COUNT; COMBINATORIAL HODGE THEORY; COMBINATORIAL LAPLACIAN; DISCRETE EXTERIOR CALCULUS; GRAPH HELMHOLTZIAN; HODGERANK; KEMENY OPTIMIZATION; LAPLACIANS; RANK AGGREGATION; STATISTICAL RANKING;

CALCULATIONS; LAPLACE TRANSFORMS; OPTIMIZATION; STATISTICS;

GRAPH THEORY;

EID: 79952775325     PISSN: 00255610     EISSN: 14364646     Source Type: Journal    
DOI: 10.1007/s10107-010-0419-x     Document Type: Article

References (45)

1. Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. In: Proceeding ACM Symposium Theory Computing (STOC '605), vol. 37, pp. 684-693 (2005) (Pubitemid 43098641)
2. K.J. Arrow 1950 A difficulty in the concept of social welfare J. Polit. Econ. 58 4 328 346 10.1086/256963
3. Arrow K.J.: General economic equilibrium: purpose, analytic techniques, collective choice. Nobel Memorial Lecture, 12 December 1972. In: Lindbeck, A. (ed.) Nobel Lectures: Economic Sciences 1969-1980, pp. 109-131. World Scientific, Singapore (1992)
4. B.M. Barber R. Lehavy M. McNichols B. Trueman 2001 Can investors profit from the prophets? Security analyst recommendations and stock returns J. Finance 56 2 531 563 10.1111/0022-1082.00336 (Pubitemid 33592072)
5. Bartholdi, L., Schick, T., Smale, N., Smale, S., Baker, A.W.: Hodge theory on metric spaces. preprint. http://www.arxiv.org/abs/0912.0284 (2009)
6. Bell, R.M., Koren, Y.: Scalable collaborative filtering with jointly derived neighborhood interpolation weights. In: Proceedings IEEE International Conference Data Mining (ICDM '607), vol. 7, pp. 43-52. (2007)
7. R. Bradley M. Terry 1952 The rank analysis of incomplete block designs: I. The method of paired comparisons Biometrika 39 324 345 0047.12903 70925
8. S. Brin L. Page 1998 The anatomy of a large-scale hypertextual web search engine Comput. Networks ISDN Syst. 30 1-7 107 117 10.1016/S0169-7552(98)00110-X
9. Choi, S.-C.: Iterative methods for singular linear equations and least-squares problems. Ph.D. thesis, Stanford University, Stanford, CA. http://www.stanford.edu/group/SOL/dissertations/sou-cheng-choi-thesis.pdf (2006)
10. Choi, S.-C., Paige, C.C., Saunders, M.A.: minres -qlp: a Krylov subspace method for indefinite or singular symmetric systems, preprint. http://www.arxiv.org/abs/1003.4042 (2010)
11. Chung, F.: Spectral Graph Theory. In: CBMS Regional Conference Series in Mathematics, vol. 92. AMS, Providence, RI (1997)
12. Cortes, C., Mohri, M., Rastogi, A.: Magnitude-preserving ranking algorithms. In: Proceeding International Conference Machine Learning (ICML '607), vol. 24, pp. 169-176 (2007)
13. David H.A.: The Method of Paired Comparisons, 2nd edn. Griffin's Statistical Monographs and Courses, vol. 41. Oxford University Press, New York, NY (1988)
14. J.-C. de Borda 1781 Mémoire sur les élections au scrutin Histoire de'Académie Royale des Sci. 102 657 665
15. de Condorcet A.-N.: Éssai sur l'application de l'analyse à la probabilité des décisions rendues à la pluralité des voix. Imprimerie Royale, Paris (1785)
16. P. Diaconis 1989 A generalization of spectral analysis with application to ranked data Ann. Statist. 17 3 949 979 0688.62005 10.1214/aos/1176347251 1015133
17. Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings International Conference World Wide Web (WWW '01), vol. 10, pp. 613-622 (2001)
18. Y. Freund R. Iyer R. Shapire Y. Singer 2004 An efficient boosting algorithm for combining preferences J. Mach. Learn. Res. 4 6 933 969 1098.68652 10.1162/1532443041827916 2125342
19. J. Friedman 1998 Computing Betti numbers via combinatorial Laplacians Algorithmica 21 4 331 346 0911.57021 10.1007/PL00009218 1622290 (Pubitemid 128664711)
20. T. Hastie R. Tibshirani 1998 Classification by pairwise coupling Ann. Statis. 26 2 451 471 0932.62071 10.1214/aos/1028144844 1626055
21. Herbrich, R., Graepel, T., Obermayer, K.: Large margin rank boundaries for ordinal regression. In: Advances in Large Margin Classifiers, pp. 115-132. MIT Press, Cambridge, MA (2000)
22. Hochbaum D.: The separation, and separation-deviation methodology for group decision making and aggregate ranking. In: Hasenbein, J.J. (ed.) Tutorials in Operations Research. vol. 7, pp. 116-141. INFORMS, Hanover, MD (2010)
23. D. Hochbaum A. Levin 2006 Methodologies and algorithms for group-rankings decision Manag. Sci. 52 9 1394 1408 10.1287/mnsc.1060.0540
24. Kahle, M.: Topology of random clique complexes. Discrete Math. (to appear, 2008)
25. J.G. Kemeny 1959 Mathematics without numbers Daedalus 88 571 591
26. Kemeny J.G., Snell L.J.: Preference ranking: an axiomatic approach. In: Kemeny, J.G., Snell, L.J. (eds) Mathematical Models in the Social Sciences, pp. 9-23. MIT Press, Cambridge (1973)
27. Kendall M.G., Gibbons J.D.: Rank Correlation Methods. 5th ed. Oxford University Press, Oxford (1990)
28. M.G. Kendall B.B. Smith 1940 On the method of paired comparisons Biometrika 31 3-4 324 345 0023.14803 2761
29. J. Kleinberg 1999 Authoritative sources in a hyperlinked environment J. ACM 46 5 604 632 1065.68660 10.1145/324133.324140 1747649
30. Ma, M.: A matrix approach to asset pricing in foreign exchange market. preprint. http://www.ssrn.com/abstract=921755 (2008)
31. G.A. Miller 1956 The magical number seven, plus or minus two some limits on our capacity for processing information Psychol. Rev. 63 2 81 97 10.1037/h0043158
32. J. Morton L. Pachter A. Shiu B. Sturmfels O. Wienand 2009 Convex rank tests and semigraphoids SIAM J. Discrete Math. 23 3 1117 1134 1198.62038 10.1137/080715822 2538642
33. Mosteller, F.: Remarks on the method of paired comparisons I, II, III. Psychometrika 16(1), pp. 3-9, no. 2, pp. 203-218 (1951)
34. G.E. Noether 1960 Remarks about a paired comparison model Psychometrika 25 357 367 0201.52101 10.1007/BF02289753 135644
35. C.C. Paige M.A. Saunders 1982 lsqr: an algorithm for sparse linear equations and sparse least squares ACM Trans. Math. Software 8 1 43 71 0478.65016 10.1145/355984.355989 661121
36. D.G. Saari V.R. Merlin 2000 A geometric examination of Kemeny's rule Soc. Choice Welf. 17 3 403 438 1069.91538 10.1007/s003550050171 1762588
37. T.L. Saaty 1977 A scaling method for priorities in hierarchical structures J. Math. Psych. 15 3 234 281 0372.62084 10.1016/0022-2496(77)90033-5 682619
38. A.K. Sen 1970 The impossibility of a paretian liberal J. Polit. Econ. 78 1 152 157 10.1086/259614
39. Sen A.K.: The possibility of social choice, Nobel Lecture, 8 Dec 1998. In: Persson, T. (ed.) Nobel Lectures: Economic Sciences 1996-2000, pp. 178-215. World Scientific, Singapore (2003)
40. Tahbaz-Salehi, A., Jadbabaie, A.: Distributed coverage verification in sensor networks without location information. In: Proceeding IEEE Conference Decision Control, vol. 47. (2008), to appear
41. L.L. Thurstone 1927 The method of paired comparisons for social values J. Abnorm. Soc. Psychol. 21 384 400 10.1037/h0065439
42. Xu, Y., Dyer, J.S., Owen, A.B.: Empirical stationary correlations for semi-supervised learning on graphs. preprint (2009)
43. H.P. Young 1988 Condorcet's theory of voting Am. Polit. Sci. Rev. 82 1231 1244 10.2307/1961757
44. H.P. Young A. Levenglick 1978 A consistent extension of Condorcet's election principle SIAM J. Appl. Math. 35 2 285 300 0385.90010 10.1137/0135023 504073
45. J. Zhang 2004 Binary choice, subset choice, random utility, and ranking: a unified perspective using the permutahedron J. Math. Psych. 48 2 107 134 1097.91509 10.1016/j.jmp.2003.12.002 2055886 (Pubitemid 38651602)