Fetching the paper…
Reading the bibliography…
We propose a number of techniques for obtaining a global ranking from data that may be incomplete and imbalanced -- characteristics almost universal to modern datasets coming from e-commerce and internet applications.
L.L. Thurstone, “The method of paired comparisons for social values,” J. Abnorm. Soc. Psychol
1927
Earlier work this paper cites.
M.G. Kendall and B.B. Smith, “On the method of paired comparisons,” Biometrika
1940
Earlier work this paper cites.
K.J. Arrow, “A difficulty in the concept of social welfare,” J. Polit. Econ
1950
Earlier work this paper cites.
F. Mosteller, “Remarks on the method of paired comparisons: I. The least squares solution assuming equal standard deviations and equal correlations,” Psychometrika
1951
Earlier work this paper cites.
F. Mosteller, “Remarks on the method of paired comparisons: II. The effect of an aberrant standard deviation when equal standard deviations and equal correlations are assumed,” Psychometrika
1951
Earlier work this paper cites.
F. Mosteller, “Remarks on the method of paired comparisons: III. A test of significance for paired comparisons when equal standard deviations and equal correlations are assumed,” Psychometrika
1951
Earlier work this paper cites.
R. Bradley and M. Terry, “The rank analysis of incomplete block designs: I. The method of paired comparisons,” Biometrika
1952
Earlier work this paper cites.
J.G. Kemeny, “Mathematics without numbers,” Daedalus
1959
Earlier work this paper cites.
G.E. Noether, “Remarks about a paired comparison model,” Psychometrika
1960
Earlier work this paper cites.
A.K. Sen, “The impossibility of a Paretian liberal,” J. Polit. Econ
1970
Earlier work this paper cites.
J.G. Kemeny and L.J. Snell, “Preference ranking: an axiomatic approach,” pp. 9–23 in J.G. Kemeny and L.J. Snell (Eds.), Mathematical models in the social sciences
1973
Earlier work this paper cites.
T.L. Saaty, “A scaling method for priorities in hierarchical structures,” J. Math. Psych
1977
Earlier work this paper cites.
H.P. Young and A. Levenglick, “A consistent extension of Condorcet’s election principle,” SIAM J. Appl. Math
1978
Earlier work this paper cites.
C.C. Paige, M.A. Saunders, “ lsqr
1982
Earlier work this paper cites.
S.C. Narula and J.F. Wellington, ”The minimum sum of absolute errors regression: a state of the art survey,” Internat. Statist. Rev
1982
Earlier work this paper cites.
T.L. Saaty, “Inconsistency and rank preservation,” J. Math. Psych
1984
Cited alongside, same era.
H.A. David, The method of paired comparisons
1988
Cited alongside, same era.
H.P. Young, “Condorcet’s theory of voting,” Am. Polit. Sci. Rev
1988
Cited alongside, same era.
P. Diaconis, “A generalization of spectral analysis with application to ranked data,” Ann. Statist
1989
Cited alongside, same era.
M.G. Kendall and J.D. Gibbons, Rank correlation methods
1990
Cited alongside, same era.
K.J. Arrow, “General economic equilibrium: purpose, analytic techniques, collective choice,” Nobel Memorial Lecture, December 12, 1972, pp. 109–131 in: Assar Lindbeck (Ed.), Nobel Lectures: Economic Sciences 1969–1980
1992
C. Dwork, R. Kumar, M. Naor, and D. Sivakumar, “Rank aggregation methods for the web,” Proc. Internat. Conf. World Wide Web
2001
Later among the works it cites.
T.L. Saaty and M.S. Ozdemir, “Why the magic number is seven plus or minus two,” Math. Comput. Modelling
2003
Later among the works it cites.
A.K. Sen, “The possibility of social choice,” Nobel Lecture, December 8, 1998, pp. 178–215 in: Torsten Persson (Ed.), Nobel Lectures: Economic Sciences 1996–2000
2003
Later among the works it cites.
Y. Freund, R. Iyer, R. Shapire, and Y. Singer, “An efficient boosting algorithm for combining preferences,” J. Mach. Learn. Res
2004
Later among the works it cites.
N. Ailon, M. Charikar, and A. Newman, “Aggregating inconsistent information: ranking and clustering,” Proc. ACM Symposium Theory Comput
2005
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
F. Chung, Spectral graph theory
1997
Cited alongside, same era.
Y. Ye, Interior point algorithms: theory and analysis
1997
Cited alongside, same era.
S. Brin and L. Page, “The anatomy of a large-scale hypertextual Web search engine,” Comput. Networks ISDN Systems
1998
Cited alongside, same era.
J. Friedman, “Computing Betti numbers via combinatorial Laplacians,” Algorithmica
1998
Cited alongside, same era.
T. Hastie and R. Tibshirani, “Classification by pairwise coupling,” Ann. Statis
1998
Cited alongside, same era.
J. Kleinberg, “Authoritative sources in a hyperlinked environment,” J. ACM
1999
Cited alongside, same era.
S.-C. Choi, Iterative methods for singular linear equations and least-squares problems
2006
Later among the works it cites.
R.M. Bell and Y. Koren, “Scalable collaborative filtering with jointly derived neighborhood interpolation weights,” Proc. IEEE Internat. Conf. Data Mining
2007
Later among the works it cites.
C. Cortes, M. Mohri, and A. Rastogi, “Magnitude-preserving ranking algorithms,” Proc. Internat. Conf. Mach. Learn
2007
Later among the works it cites.
S.-C. Choi and M.A. Saunders, “ minres
2008
Closest in time.
A. Tahbaz-Salehi and A. Jadbabaie, “Distributed coverage verification in sensor networks without location information,” Proc. IEEE Conf. Decis. Control
2008
Closest in time.
M. Kahle, “Topology of random clique complexes,” Discrete Math
2008
Closest in time.
M. Ma, “A matrix approach to asset pricing in foreign exchange market,” preprint
2008
Closest in time.
N. Smale and S. Smale, “Hodge decomposition and learning theory,” preprint
2008
Closest in time.
Y. Xu, J.S. Dyer, and A.B. Owen, “Empirical stationary correlations for semi-supervised learning on graphs,” preprint
2009
Closest in time.