Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs

Published Online:https://doi.org/10.1287/ijoc.1100.0385

References

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