Why does collaborative filtering work? transaction-based recommendation model validation and selection by analyzing bipartite random graphs

INFORMS Journal on Computing

Volumn 23, Issue 1, 2011, Pages 138-152

  Huang, Zan ^a   Zeng, Daniel Dajun ^b,c  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

^c INSTITUTE OF AUTOMATION   (China)

Author keywords

Bipartite graph; Collaborative filtering; Random graph analysis; Recommendation algorithm

Indexed keywords

EID: 79952391729     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1100.0385     Document Type: Article

References (41)

1. Adomavicius, G., A. Tuzhilin. 2005. Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions. IEEE Trans. Knowledge Data Engrg. 17(6) 734-749. (Pubitemid 40860454)
2. Aggarwal, C. C., J. L. Wolf, K.-L. Wu, P. S. Yu. 1999. Horting hatches an egg: A new graph-theoretic approach to collaborative filtering. Proc. 5th ACM SIGKDD Conf. Knowledge Discovery Data Mining(KDD'99), San Diego, ACM Press, New York, 201-212.
3. Albert, R., A.-L. Barabási. 2002. Statistical mechanics of complex networks. Rev. Modern Phys. 74(1) 47-97.
4. Barabási, A.-L., H. Jeong, R. Ravasz, Z. Néda, A. Schubert, T. Vicsek. 2002. Evolution of the social network of scientific collaborations. Physica A 311(3-4) 590-614. (Pubitemid 34782622)
5. Bennett, J., S. Lanning. 2007. The Netflix Prize. Proc. KDD Cup Workshop 2007, San Jose.
6. Bennett, J., C. Elkan, B. Liu, P. Smyth, D. Tikk. 2007. KDD Cup and Workshop 2007. ACM SIGKDD Explorations Newslett. 9(2) 51-52.
7. Bradley, A. P. 1997. The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition 30(7) 1145-1159. (Pubitemid 127406521)
8. Breese, J. S., D. Heckerman, C. Kadie. 1998. Empirical analysis of predictive algorithms for collaborative filtering. Proc. 14th Conf. Uncertainty Artificial Intelligence, Madison, WI, 43-52.
9. Brusilovsky, P., A. Kobsa, W. Nejdl. 2007. Adaptive Web: Methods and Strategies of Web Personalization. Springer, Berlin.
10. Cancho, R. F. I., R. V. Solé. 2001. The small world of human language. Proc. Biol. Sci. 268(1482) 2261-2265. (Pubitemid 33032903)
11. Casella, G., R. L. Berger. 2002. Statistical Inference. Duxbury Press, Pacific Grove, CA.
12. Davis, G. F., M. Yoo, W. E. Baker. 2003. The small world of the American corporate elite, 1982-2001. Strategic Organ. 1(3) 301-326.
13. Deshpande, M., G. Karypis. 2004. Item-based top-N recommendation algorithms. ACM Trans. Inform. Systems 22(1) 143-177.
14. Erdös, P., A. Rényi. 1959. On random graphs. Publ. Math. 6 290-297.
15. Erdös, P., A. Rényi. 1960. On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci. 5 17-61.
16. Erdös, P., A. Rényi. 1961. On the strength of connectedness of a random graph. Acta Math. Hungarica 12(1-2) 261-267.
17. Felfernig, A., G. Friedrich, L. Schmidt-Thieme. 2007. Guest editors' introduction: Recommender systems. IEEE Intelligent Systems 22(3) 18-21. (Pubitemid 46883391)
18. Herlocker, J. L., J. A. Konstan, L. G. Terveen, J. T. Riedl. 2004. Evaluating collaborative filtering recommender systems. ACM Trans. Inform. Systems 22(1) 5-53.
19. Hill, W., L. Stead, M. Rosenstein, G. Furnas. 1995. Recommending and evaluating choices in a virtual community of use. Proc. ACM Conf. Human Factors Comput. Systems, (CHI'95), ACM Press/Addison-Wesley Publishing, New York, 194-201.
20. Hofmann, T. 1999. Probabilistic latent semantic analysis. Proc. Uncertainty Artificial Intelligence, UAI'99, Morgan Kaufmann, San Francisco, 289-296.
21. Hofmann, T. 2004. Latent semantic models for collaborative filtering. ACM Trans. Inform. Systems 22(1) 89-115.
22. Huang, Z., H. Chen, D. Zeng. 2004. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inform. Systems 22(1) 116-142.
23. Huang, Z., X. Li, H. Chen. 2005. Link prediction approach to collaborative filtering. Proc. 5th ACM/IEEE-CS Joint Conf. Digital Libraries, Denver, ACM Press, New York, 141-142. (Pubitemid 41543540)
24. Huang, Z., D. Zeng, H. Chen. 2007a. A comparative study of recommendation algorithms for e-commerce applications. IEEE Intelligent Systems 22(5) 68-78.
25. Huang, Z., D. Zeng, H. Chen. 2007b. Analyzing consumer-product graphs: Empirical findings and applications in recommender systems. Management Sci. 53(7) 1146-1164. (Pubitemid 351159617)
26. Jin, R., L. Si, C. Zhai. 2006. A study of mixture models for collaborative filtering. Inform. Retrieval 9(3) 357-382. (Pubitemid 43839180)
27. Kalna, G., D. J. Higham. 2007. A clustering coefficient for weighted networks, with application to gene expression data. AI Comm. 20(4) 263-271. (Pubitemid 350096312)
28. Konstan, J. A. 2004. Introduction to recommender systems: Algorithms and evaluation. ACM Trans. Inform. Systems 22(1) 1-4.
29. Milo, R., N. Kashtan, S. Itzkovitz, M. E. J. Newman, U. Alon. 2003. Uniform generation of random graphs with arbitrary degree sequences. Retrieved May 2006, http://aps.arxiv.org/ abs/cond-mat/0312028v2.
30. Mirza, B. J., B. J. Keller, N. Ramakrishnan. 2003. Studying recommendation algorithms by graph analysis. J. Intelligent Inform. Systems 20(2) 131-160.
31. Newman, M. E. J. 2003. The structure and function of complex networks. SIAM Rev. 45(2) 167-256.
32. Newman, M. E. J. 2004. Analysis of weighted networks. Phys. Rev. E 70(5) 056131.
33. Newman, M. E. J., S. H. Strogatz, D. J. Watts. 2001. Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E 64(2, Part 2) 026118.
34. Resnick, P., N. Iacovou, M. Suchak, P. Bergstorm, J. Riedl. 1994. GroupLens: An open architecture for collaborative filtering of netnews. Proc. ACM Conf. Comput.-Supported Cooperative Work, ACM Press, New York, 175-186.
35. Robins, G., M. Alexander. 2004. Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Comput. Math. Organ. Theory 10(1) 69-94. (Pubitemid 38789934)
36. Sarwar, B., G. Karypis, J. Konstan, J. Reidl. 2000a. Analysis of recommendation algorithms for e-commerce. Proc. ACM Conf. Electronic Commerce, ACM Press, New York, 158-167.
37. Sarwar, B., G. Karypis, J. Konstan, J. Riedl. 2000b. Application of dimensionality reduction in recommender system: A case study. Proc. WebKDD Workshop ACM SIGKKD, Boston. http://ai .stanford.edu/~ronnyk/WEBKDD2000/papers/ sarwar.pdf.
38. Schafer, J. B., J. A. Konstan, J. Riedl. 2001. E-commerce recommendation applications. Data Mining Knowledge Discovery 5(1-2) 115-153.
39. Shardanand, U., P. Maes. 1995. Social information filtering: Algorithms for automating word of mouth. Proc. ACM Conf. Human Factors Comput. Systems, Denver, ACM Press, New York, 210-217.
40. Ungar, L. H., D. P. Foster. 1998. A formal statistical approach to collaborative filtering. Proc. Conf. Automated Learn. Discovery (CONALD), Center for Automated Learning and Discovery, Carnegie Mellon University, Pittsburgh.
41. Watts, D. J., S. H. Strogatz. 1998. Collective dynamics of "smallworld" networks. Nature 393(6684) 440-442.