User rankings from comparisons: Learning permutations in high dimensions

2011 49th Annual Allerton Conference on Communication, Control, and Computing, Allerton 2011

Volumn , Issue , 2011, Pages 1143-1150

  Mitliagkas, Ioannis ^a   Gopalan, Aditya ^a   Caramanis, Constantine ^a   Vishwanath, Sriram ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE RECOMMENDER SYSTEMS; COMPUTATIONAL REQUIREMENTS; HIGH DIMENSIONS; LOW-COMPLEXITY; MATRIX COMPLETION; NUMERICAL EXPERIMENTS; PAIR-WISE COMPARISON; PARTIAL INFORMATION; SAMPLE COMPLEXITY; USER RANKINGS;

COMMUNICATION;

ALGORITHMS;

EID: 84856097565     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2011.6120296     Document Type: Conference Paper

References (19)

1. R. H. Keshavan, A. Montanari, and S. Oh, "Matrix completion from a few entries," IEEE Transactions on Information Theory, vol. 56, pp. 2980-2998, 2010.
2. E. J. Candès and B. Recht, "Exact matrix completion via convex optimization," Found. Comput. Math., vol. 9, pp. 717-772, December 2009.
3. B. Recht, "A simpler approach to matrix completion," CoRR, vol. abs/0910.0651, 2009.
4. M. Weimer, A. Karatzoglou, Q. V. Le, and A. Smola, "CoFiRank, Maximum Margin Matrix Factorization for Collaborative Ranking,"in Advances in Neural Information Processing Systems, vol. 20, 2007.
5. B. Zelinka, "Distances between partially ordered sets," Mathematica Bohemica, vol. 118, no. 2, pp. 167-170, 1993.
6. A. Haviar and B. Bystrica, "A metric on a system of ordered sets," Mathematica Bohemica, vol. 121, no. 2, pp. 123-131, 1996.
7. Y. Freund, R. Iyer, R. E. Schapire, and Y. Singer, "An efficient boosting algorithm for combining preferences," J. Mach. Learn. Res., vol. 4, pp. 933-969, December 2003.
8. W. W. Cohen, R. E. Schapire, and Y. Singer, "Learning to order things," J. Artif. Intell. Res. (JAIR), vol. 10, pp. 243-270, 1999.
9. S. Agarwal, "Learning to rank on graphs," Machine Learning, vol. 81, no. 3, pp. 333-357, 2010.
10. S. Rajaram and S. Agarwal, "Generalization bounds for kpartite ranking," in Proceedings of the NIPS-2005 Workshop on Learning to Rank, 2005.
11. D. Helmbold and M. Warmuth, "Learning permutations with exponential weights," in Proceedings of the 20th annual conference on Learning theory. Springer-Verlag, 2007, pp. 469-483.
12. G. Fung, R. Rosales, and B. Krishnapuram, "Learning rankings via convex hull separation," Advances in Neural Information Processing Systems, vol. 18, p. 395, 2006.
13. G. Lebanon and J. Lafferty, "Cranking: Combining rankings using conditional probability models on permutations," in Proceedings of the Nineteenth International Conference on Machine Learning. Morgan Kaufmann Publishers Inc., 2002, pp. 363-370.
14. M. Ajtai, V. Feldman, A. Hassidim, and J. Nelson, "Sorting and selection with imprecise comparisons," Automata, Languages and Programming, pp. 37-48, 2009.
15. U. Feige, P. Raghavan, D. Peleg, and E. Upfal, "Computing with noisy information," SIAM J. Comput., vol. 23, no. 5, pp. 1001-1018, 1994.
16. C. Daskalakis, R. Karp, E. Mossel, S. Riesenfeld, and E. Verbin, "Sorting and selection in posets," in Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 2009, pp. 392-401.
17. S. Jagabathula and D. Shah, "Inferring rankings under constrained sensing," in Advances in Neural Information Processing Systems, 2008, pp. 753-760.
18. I. Mitliagkas, A. Gopalan, C. Caramanis, and S. Vishwanath, "User rankings from comparisons: Learning permutations in high dimensions," long version available at webspace.utexas.edu/im4454/www/.
19. Z. Lin, M. Chen, L. Wu, and Y. Ma, "The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices," Arxiv preprint arXiv:1009.5055, 2010.