Why Does Collaborative Filtering Work? Transaction-Based Recommendation Model Validation and Selection by Analyzing Bipartite Random Graphs
Published Online:15 Apr 2010https://doi.org/10.1287/ijoc.1100.0385
References
- 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–749Crossref, Google Scholar
- 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–212Crossref, Google Scholar
- Statistical mechanics of complex networks. Rev. Modern Phys. (2002) 74(1):47–97Crossref, Google Scholar
- Evolution of the social network of scientific collaborations. Physica A (2002) 311(3–4):590–614Crossref, Google Scholar
- The Netflix Prize. Proc. KDD Cup Workshop 2007 (2007) San JoseGoogle Scholar
- KDD Cup and Workshop 2007. ACM SIGKDD Explorations Newslett. (2007) 9(2):51–52Crossref, Google Scholar
- The use of the area under the ROC curve in the evaluation of machine learning algorithms. Pattern Recognition (1997) 30(7):1145–1159Crossref, Google Scholar
- Empirical analysis of predictive algorithms for collaborative filtering. Proc. 14th Conf. Uncertainty Artificial Intelligence (1998) Madison, WI:43–52Google Scholar
- Adaptive Web: Methods and Strategies of Web Personalization (2007) (Springer, Berlin) Crossref, Google Scholar
- The small world of human language. Proc. Biol. Sci. (2001) 268(1482):2261–2265Crossref, Google Scholar
- Statistical Inference (2002) (Duxbury Press, Pacific Grove, CA) Google Scholar
- The small world of the American corporate elite, 1982–2001. Strategic Organ. (2003) 1(3):301–326Crossref, Google Scholar
- Item-based top-N recommendation algorithms. ACM Trans. Inform. Systems (2004) 22(1):143–177Crossref, Google Scholar
- On random graphs. Publ. Math. (1959) 6:290–297Google Scholar
- On the evolution of random graphs. Publ. Math. Inst. Hungarian Acad. Sci. (1960) 5:17–61Google Scholar
- On the strength of connectedness of a random graph. Acta Math. Hungarica (1961) 12(1–2):261–267Crossref, Google Scholar
- Guest editors' introduction: Recommender systems. IEEE Intelligent Systems (2007) 22(3):18–21Crossref, Google Scholar
- Evaluating collaborative filtering recommender systems. ACM Trans. Inform. Systems (2004) 22(1):5–53Crossref, Google Scholar
- 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–201Crossref, Google Scholar
- Probabilistic latent semantic analysis. Proc. Uncertainty Artificial Intelligence, UAI'99 (1999) (Morgan Kaufmann, San Francisco) 289–296Google Scholar
- Latent semantic models for collaborative filtering. ACM Trans. Inform. Systems (2004) 22(1):89–115Crossref, Google Scholar
- Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inform. Systems (2004) 22(1):116–142Crossref, Google Scholar
- Link prediction approach to collaborative filtering. Proc. 5th ACM/IEEE-CS Joint Conf. Digital Libraries (2005) Denver(ACM Press, New York) 141–142Crossref, Google Scholar
- A comparative study of recommendation algorithms for e-commerce applications. IEEE Intelligent Systems (2007a) 22(5):68–78Crossref, Google Scholar
- Analyzing consumer-product graphs: Empirical findings and applications in recommender systems. Management Sci. (2007b) 53(7):1146–1164Link, Google Scholar
- A study of mixture models for collaborative filtering. Inform. Retrieval (2006) 9(3):357–382Crossref, Google Scholar
- A clustering coefficient for weighted networks, with application to gene expression data. AI Comm. (2007) 20(4):263–271Google Scholar
- Introduction to recommender systems: Algorithms and evaluation. ACM Trans. Inform. Systems (2004) 22(1):1–4Crossref, Google Scholar
- Uniform generation of random graphs with arbitrary degree sequences. (2003) . Retrieved May 2006, http://aps.arxiv.org/abs/cond-mat/0312028v2Google Scholar
- Studying recommendation algorithms by graph analysis. J. Intelligent Inform. Systems (2003) 20(2):131–160Crossref, Google Scholar
- The structure and function of complex networks. SIAM Rev. (2003) 45(2):167–256Crossref, Google Scholar
- Analysis of weighted networks. Phys. Rev. E (2004) 70(5):056131Crossref, Google Scholar
- Random graphs with arbitrary degree distributions and their applications. Phys. Rev. E (2001) 64(2, Part 2):026118Crossref, Google Scholar
- GroupLens: An open architecture for collaborative filtering of netnews. Proc. ACM Conf. Comput.-Supported Cooperative Work (1994) (ACM Press, New York) 175–186Crossref, Google Scholar
- Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Comput. Math. Organ. Theory (2004) 10(1):69–94Crossref, Google Scholar
- Analysis of recommendation algorithms for e-commerce. Proc. ACM Conf. Electronic Commerce (2000a) (ACM Press, New York) 158–167Crossref, Google Scholar
- 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.pdfCrossref, Google Scholar
- E-commerce recommendation applications. Data Mining Knowledge Discovery (2001) 5(1–2):115–153Crossref, Google Scholar
- Social information filtering: Algorithms for automating word of mouth. Proc. ACM Conf. Human Factors Comput. Systems (1995) Denver(ACM Press, New York) 210–217Crossref, Google Scholar
- 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
- Collective dynamics of “small-world” networks. Nature (1998) 393(6684):440–442Crossref, Google Scholar

