Enhanced statistical rankings via targeted data collection

30th International Conference on Machine Learning, ICML 2013

Volumn , Issue PART 1, 2013, Pages 489-497

  Osting, Braxton ^a   Brune, Christoph ^a   Osher, Stanley ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; FISHER INFORMATION MATRIX; GRAPH THEORY; LEARNING SYSTEMS;

DATA COLLECTION; FISHER INFORMATION; GRAPH LAPLACIAN; INFORMATIVE NESS; PAIR-WISE COMPARISON; POTENTIAL FUNCTION; PRIMARY CONTRIBUTION; STATISTICAL RANKING;

DATA ACQUISITION;

EID: 84888363005     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. Yahoo! Webscope dataset: ydata-ymovies-user-movie-ratings-content-v1.0. http://webscope.sandbox.-yahoo.com. accessed: 10/5/2011.
2. Ailon, N. An active learning algorithm for ranking from pairwise preferences with an almost optimal query complexity. J. Mach. Learn. Res., 13:137-164, 2012.
3. Biyikoglu, T., Leydold, J., and Stadler, P. F. Laplacian Eigenvectors of Graphs. Springer, 2007.
4. Björner, A., Lovász, L., and Shor, P. W. Chip-firing games on graphs. European J. Combin, 12(4), 1991.
5. Callaghan, T., Mucha, P. J., and Porter, M. A. Random walker ranking for NCAA Division I-A football. 2007.
6. Chung, F. R. K. Spectral Graph Theory. AMS, 1997.
7. Chung, M. and Haber, E. Experimental design for biological systems. Siam J. Control Optim., 50(1):-471-489, 2012.
8. David, H. A. The Method of Paired Comparisons. Charles Griffin & Co., 1963.
9. Elo, A. The Rating of Chessplayers, Past and Present. Arco Pub., 1978.
10. Fiedler, M. Algebraic connectivity of graphs. Czech. Math. J., 23:298-305, 1973.
11. Ghosh, A. and Boyd, S. Upper bounds on algebraic connectivity via convex optimization. Linear Algebra and its Applications, 418:693-707, 2006a. (Pubitemid 44310747)
12. Ghosh, A. and Boyd, S. Growing well-connected graphs. Proc. IEEE Conf. Decision & Control, 2006b.
13. Glickman, M. E. A comprehensive guide to chess ratings. American Chess Journal, 3, 1995.
14. Glickman, M. E. Adaptive paired comparison design. Journal of Statistical Planning and Inference, 127:279-293, 2005.
15. Haber, E., Horesh, L., and Tenorio, L. Numerical methods for experimental design of large-scale linear ill-posed inverse problems. Inverse Problems, 24: 055012, 2008.
16. Hirani, A. N., Kalyanaraman, K., and Watts, S. Least squares ranking on graphs. arXiv:1011.1716v4, 2011.
17. Horn, R.A. and Johnson, C.R. Matrix Analysis. Cambridge University Press, 1990.
18. Jamieson, K. G. and Nowak, R. D. Active ranking using pairwise comparisons. In Neural Information Processing Systems (NIPS), pp. 2240-2248, 2011.
19. Jiang, X., Lim, L.-H., Yao, Y., and Ye, Y. Statistical ranking and combinatorial Hodge theory. Math. Program. Ser. B, 127(1):203-244, 2010.
20. Keener, J. P. The Perron-Frobenius theorem and the ranking of football teams. SIAM Review, 35(1):80-93, 1993.
21. Langville, A. N. and Meyer, C. D. Who's #1?: The Science of Rating and Ranking. Princeton University Press, 2012.
22. Mohar, B. The Laplacian spectrum of graphs. In Graph Theory, Combinatorics, and Applications, volume 2, pp. 871-898. Wiley, 1991.
23. Mosk-Aoyama, D. Maximum algebraic connectivity augmentation is NP-hard. Operations Research Letters, 36(6):677-679, 2008.
24. Olfati-Saber, R., Fax, A., and Murray, R. M. Consensus and cooperation in networked multi-agent systems. Proceedings of the IEEE, 95(1):215-233, 2007.
25. Osting, B., Brune, C., and Osher, S. Optimal data collection for improved rankings expose well-connected graphs, submitted, 2012a.
26. Osting, B., Darbon, J., and Osher, S. Statistical ranking using the 1-north Cmum on graphs, submitted, 2012b.
27. Pukelsheim, F. Optimal Design of Experiments. SIAM, 2006.
28. Quinn, G. P. and Keough, M. J. Experimental design and analysis for biologists. Cambridge University Press, Cambridge, UK, 2002.
29. Seeger, M. and Nickisch, H. Large scale Bayesian inference and experimental design for sparse linear models. SIAM Journal of Imaging Sciences, 4(1):166-199, 2011.
30. Sun, J., Boyd, S., Xiao, L., and Diaconis, P. The fastest mixing Markov process on a graph and a connection to a maximum variance unfolding problem. SIAM Review, 48:2006, 2004.
31. Traud, A. L., Frost, C., Mucha, P. J., and Porter, M. A. Visualization of communities in networks. Chaos, 19:041104, 2009.
32. Wang, H. and Mieghem, P. Van. Algebraic connectivity optimization via link addition. In Bionetics 2008, Hyogo, Japan, 2008.
33. Wu, Mike. wgPlot. http://www.mathworks.com/matlabcentral/fileexchange/ 24035, 2009.
34. Xu, Q., Yao, Y., Jiang, T., Huang, Q., Yan, B., and Lin, W. Random partial paired comparison for subjective video quality assessment via HodgeRank. In ACM Multimedia, 2011.