Inferring Users’ Preferences from Crowdsourced Pairwise Comparisons: A Matrix Completion Approach

Proceedings of the 1st AAAI Conference on Human Computation and Crowdsourcing, HCOMP 2013

Volumn , Issue , 2013, Pages 207-215

  Yi, Jinfeng ^a   Jin, Rong ^a   Jain, Shaili ^b   Jain, Anil K ^a  

^a Michigan State University   (United States)

^b MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; BENCHMARKING;

ALGORITHM FOR SOLVING; EMPIRICAL STUDIES; FEATURE REPRESENTATION; LEARN+; MATRIX COMPLETION; MATRIX R; OPTIMIZATION PROBLEMS; PAIR-WISE COMPARISON; RANKING LISTS; USER'S PREFERENCES;

COLLABORATIVE FILTERING;

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

References (30)

1. Avron, H.; Kale, S.; Kasiviswanathan, S. P.; and Sindhwani, V. 2012. Efficient and practical stochastic subgradient descent for nuclear norm regularization. In ICML.
2. Bennett, J., and Lanning, S. 2007. The netflix prize. In KDD Cup and Workshop in conjunction with KDD.
3. Burges, C.; Shaked, T.; Renshaw, E.; Lazier, A.; Deeds, M.; Hamilton, N.; and Hullender, G. 2005. Learning to rank using gradient descent. In ICML, 89–96.
4. Burges, C. J. C.; Ragno, R.; and Le, Q. V. 2006. Learning to rank with nonsmooth cost functions. In NIPS, 193–200.
5. Candès, E. J., and Recht, B. 2009. Exact matrix completion via convex optimization. Foundations of Computational Mathematics 9(6):717–772.
6. Canny, J. F. 2002. Collaborative filtering with privacy via factor analysis. In SIGIR, 238–245.
7. Cao, Y.; Xu, J.; Liu, T.-Y.; Li, H.; Huang, Y.; and Hon, H.W. 2006. Adapting ranking svm to document retrieval. In SIGIR, 186–193.
8. Chen, X.; Bennett, P.; Collins-Thompson, K.; and Horvitz, E. 2013. Pairwise ranking aggregation in a crowdsourced setting. In WSDM.
9. Deshpande, M., and Karypis, G. 2004. Item-based top-n recommendation algorithms. ACM Trans. Inf. Syst. 22(1):143–177.
10. Goldberg, D.; Nichols, D.; Oki, B.; and Terry, D. 1992. Using collaborative filtering to weave an information tapestry. Commun. ACM 35(12):61–70.
11. Goldberg, K. Y.; Roeder, T.; Gupta, D.; and Perkins, C. 2001. Eigentaste: A constant time collaborative filtering algorithm. Inf. Retr. 4(2):133–151.
12. Heckerman, D.; Chickering, D. M.; Meek, C.; Rounthwaite, R.; and Kadie, C. M. 2000. Dependency networks for inference, collaborative filtering, and data visualization. JMLR 1:49–75.
13. Herlocker, J. L.; Konstan, J. A.; and Riedl, J. 2002. An empirical analysis of design choices in neighborhood-based collaborative filtering algorithms. Inf. Retr. 5(4):287–310.
14. Jamieson, K. G., and Nowak, R. D. 2011. Active ranking using pairwise comparisons. In NIPS, 2240–2248.
15. Järvelin, K., and Kekäläinen, J. 2002. Cumulated gain-based evaluation of ir techniques. ACM Trans. Inf. Syst. 20(4):422–446.
16. Li, H. 2011. Learning to Rank for Information Retrieval and Natural Language Processing. Morgan & Claypool Publishers.
17. Liu, N. N.; Zhao, M.; and Yang, Q. 2009. Probabilistic latent preference analysis for collaborative filtering. In CIKM, 759–766.
18. Negahban, S.; Oh, S.; and Shah, D. 2012. Iterative ranking from pair-wise comparisons. In NIPS. 2483–2491.
19. Rendle, S.; Freudenthaler, C.; Gantner, Z.; and Schmidt-Thieme, L. 2009. Bpr: Bayesian personalized ranking from implicit feedback. In UAI, 452–461.
20. Rennie, J. D. M., and Srebro, N. 2005. Fast maximum margin matrix factorization for collaborative prediction. In ICML, 713–719.
21. Salakhutdinov, R., and Mnih, A. 2008. Bayesian probabilistic matrix factorization using markov chain monte carlo. In ICML, 880–887.
22. Sarwar, B. M.; Karypis, G.; Konstan, J. A.; and Riedl, J. T. 2000. Application of dimensionality reduction in recommender systems–a case study. In ACM WebKDD Workshop.
23. Sarwar, B. M.; Karypis, G.; Konstan, J. A.; and Riedl, J. 2001. Item-based collaborative filtering recommendation algorithms. In WWW, 285–295.
24. Schein, A. I.; Popescul, A.; Ungar, L. H.; and Pennock, D. M. 2002. Methods and metrics for cold-start recommendations. In SIGIR, 253–260.
25. Su, X., and Khoshgoftaar, T. M. 2009. A survey of collaborative filtering techniques. Adv. Artificial Intellegence 2009:1–20.
26. Tamuz, O.; Liu, C.; Belongie, S.; Shamir, O.; and Kalai, A. 2011. Adaptively learning the crowd kernel. In ICML, 673–680.
27. Xue, G.; Lin, C.; Yang, Q.; Xi, W.; Zeng, H.; Yu, Y.; and Chen, Z. 2005. Scalable collaborative filtering using cluster-based smoothing. In SIGIR, 114–121.
28. Yi, J.; Jin, R.; Jain, A.; Jain, S.; and Yang, T. 2012a. Semi-crowdsourced clustering: Generalizing crowd labeling by robust distance metric learning. In NIPS, 1781–1789.
29. Yi, J.; Jin, R.; Jain, A. K.; and Jain, S. 2012b. Crowdclustering with sparse pairwise labels: A matrix completion approach. In AAAI Workshop on Human Computation.
30. Zhou, D.; Platt, J. C.; Basu, S.; and Mao, Y. 2012. Learning from the wisdom of crowds by minimax entropy. In NIPS, 2204–2212.