Analyzing Consumer-Product Graphs: Empirical Findings and Applications in Recommender Systems

References

• Adomavicius G., Tuzhilin A. Using data mining methods to build customer profiles. IEEE Comput. (2001) 34(2):74–82Crossref, Google Scholar
• Albert R., Barabási A.-L. Statistical mechanics of complex networks. Rev. Modern Phys. (2002) 74:47–97Crossref, Google Scholar
• Albert R., Jeong H., Barabási A.-L. Error and attack tolerance of complex networks. Nature (2000) 406:378–382Crossref, Google Scholar
• Allenby G. M., Ginter J. L. Using extremes to design products and segment markets. J. Marketing Res. (1995) 32(4):392–403Crossref, Google Scholar
• Amaral L. A. N., Scala A., Bartheley M., Stanley H. E. Classes of small-world networks. Proc. Natl. Acad. Sci. USA (2000) 97(21):11149–11152Crossref, Google Scholar
• Ansari A., Essegaier S., Kohli R. Internet recommendations systems. J. Marketing Res. (2000) 37(3):363–375Crossref, Google Scholar
• Azar Y., Fiat A., Karlin A. R., McSherry F., Saia J. Spectral analysis of data. Proc. 33rd ACM Sympos. Theory Comput. (2001) (ACM Press, New York) 619–626Crossref, Google Scholar
• Barabási A.-L., Albert R. Emergence of scaling in random networks. Science (1999) 286:509–512Crossref, Google Scholar
• Barabási A.-L., Jeong H., Ravasz R., Neda Z., Vicsek T., Schubert A. Evolution of the social network of scientific collaborations. Physica A (2002) 311:590–614Crossref, Google Scholar
• Baum J. A. C., Shipilov A. V., Rowley T. J. Where do small worlds come from? Indust. Corporate Change (2003) 12:697–725Crossref, Google Scholar
• Bellmann S., Lohse G. L., Johnson E. J. Predictors of online buying behavior. Comm. ACM (1999) 42(12):32–38Crossref, Google Scholar
• Bondy J. A., Murty U. S. R.Graph Theory with Applications (1976) (American Elsevier Publishing, New York) Crossref, Google Scholar
• Bradlow E. T., Fader P. S. Bayesian lifetime model for the “Hot 100” billboard songs. J. Amer. Statist. Assoc. (2001) 96:368–381Crossref, Google Scholar
• Breese J. S., Heckerman D., Kadie C. Empirical analysis of predictive algorithms for collaborative filtering. Proc. Fourteenth Conf. Uncertainty Artificial Intelligence (1998) (Morgan Kaufmann, San Francisco, CA) 43–52Google Scholar
• Cancho F. I., Sole R. V. The small world of human language. Proc. Roy. Soc. London Ser. B—Biol. Sci. (2001) 268:2261–2265Crossref, Google Scholar
• Conyon M. J., Muldoon M. R. The small world network structure of boards of directors. (2004) . Social Science Research Network, http://ssrn.com/abstract=546963Google Scholar
• Cox D. R. Regression models and life-tables (with discussion). J. Roy. Statist. Soc. (1972) B34:187–220Google Scholar
• Davis G. F., Yoo M., Baker W. E. The small world of the corporate elite, 1982–2001. Strategic Organ. (2003) 1:301–326Crossref, Google Scholar
• Dempster A., Laird N., Rubin D. Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Statist. Soc. Ser. B (1977) 39(1):1–38Google Scholar
• Deshpande M., Karypis G. Item-based top-N recommendation algorithms. ACM Trans. Inform. Systems (2004) 22(1):143–177Crossref, Google Scholar
• Dorogovtsev S. N., Mendes J. F. F. Scaling properties of scale-free evolving networks: Continuous approach. Phys. Rev. E (2001) 63(5):056125-1–056125-19Crossref, Google Scholar
• Ehrenberg A. S. C.Repeat-Buying: Facts, Theory and Applications (1988) (Charles Griffin & Company Limited, London, UK) Google Scholar
• Erdős P., Rényi A. On random graphs. Pub. Math. (1959) 6:290–297Google Scholar
• Fader P. S., Hardie B. G. S. Forecasting repeat sales at CDNOW: A case study. Interfaces (2001) 31(3):S94–S107Link, Google Scholar
• Faloutsos C., Faloutsos P., Faloutsos M. On power law relationships of the Internet topology. Proc. ACM SIGCOMM. (1999) (ACM Press, New York) 251–262Crossref, Google Scholar
• Gershoff A. D., West P. M. Using a community of knowledge to build intelligent agents. Marketing Lett. (1998) 9(1):79–91Crossref, Google Scholar
• Gladwell M. The science of the sleeper: How the information age could blow away the blockbuster. The New Yorker (1999) October 4):48–55Google Scholar
• Goldberg K., Roeder T., Gupta D., Perkins C. Eigentaste: A constant time collaborative filtering algorithm. Inform. Retrieval (2001) 4(2):133–151Crossref, Google Scholar
• Guimerà R., Uzzi B., Spiro J., Amaral L. A. N. Team assembly mechanisms determine collaboration network structure and team performance. Science (2005) 308(5722):697–702Crossref, Google Scholar
• Heckerman D., Chickering D. M., Meek C., Rounthwaite R., Kadie C. Dependency networks for inference, collaborative filtering, and data visualization. J. Machine Learn. Res. (2000) 1:49–75Google 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–53Crossref, Google Scholar
• Hill W., Stead L., Rosenstein M., Furnas G. Recommending and evaluating choices in a virtual community of use. Proc. ACM Conf. Human Factors in Comput. Systems CHI’95 (1995) (ACM Press, New York) 194–201Crossref, Google Scholar
• Hofmann T. Latent semantic models for collaborative filtering. ACM Trans. Inform. Systems (2004) 22(1):89–115Crossref, Google Scholar
• Huang Z., Chen H., Zeng D. Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering. ACM Trans. Inform. Systems (TOIS) (2004) 22(1):116–142Crossref, Google Scholar
• Jain D. C., Vilcassim N. J. Investigating household purchase timing decisions: A conditional hazard function approach. Marketing Sci. (1991) 10:1–23Link, Google Scholar
• Jain D. C., Vilcassim N. J., Chintagunta P. K. A random-coefficients logit brand-choice model applied to panel data. J. Bus. Econom. Statist. (1994) 12:317–328Crossref, Google Scholar
• Jeong H., Mason S. P., Barabási A.-L., Oltvai Z. Lethality and centrality in protein networks. Nature (2001) 411:41–42Crossref, Google Scholar
• Kamakura W. A., Russell G. J. A probabilistic choice model for market segmentation and elasticity structure. J. Marketing Res. (1989) 26:379–390Crossref, Google Scholar
• Kamakura W. A., Wedel M., Agrawal J. Concomitant variable latent class models for conjoint analysis. Internat. J. Res. Marketing (1994) 11:451–464Crossref, Google Scholar
• Karypis G., Kumar V. Multilevel k-way partitioning scheme for irregular graphs. J. Parallel Distributed Comput. (1998) 48:96–129Crossref, Google Scholar
• Kogut B., Walker G. The small world of Germany and the durability of national ownership networks. Amer. Sociol. Rev. (2001) 66(3):317–335Crossref, Google Scholar
• Kumar S. R., Raghavan P., Rajagopalan S., Tomkins A. Recommendation systems: A probabilistic analysis. Proc. 39th Annual Sympos. Foundations Comput. Sci. (1998) (IEEE Computer Society Press, Los Alamitos, CA) 664–673Crossref, Google Scholar
• Lin W., Alvarez S. A., Ruiz C. Efficient adaptive-support association rule mining for recommender systems. Data Mining Knowledge Discovery (2002) 6:83–105Crossref, Google Scholar
• McFadden D., Zarembka P. Conditional logit analysis of qualitative choice behavior. Frontiers of Econometrics (1974) (Academic Press, New York) 105–142Google Scholar
• Newman M. E. J. The structure and function of complex networks. SIAM Rev. (2003) 45(2):167–256Crossref, Google 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):026118-1–026118-17Crossref, Google Scholar
• Newman M. E. J., Watts D. J., Strogatz S. H. Random graph models of social networks. Proc. Natl. Acad. Sci. USA (2002) 99:2566–2572Crossref, Google Scholar
• Resnick P., Varian H. Recommender systems. Comm. ACM (1997) 40(3):56–58Crossref, Google 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–186Crossref, Google Scholar
• Robins G., Alexander M. Small worlds among interlocking directors: Network structure and distance in bipartite graphs. Comput. Math. Organ. Theory (2004) 10:69–94Crossref, Google Scholar
• Rossi P. E., McCulloch R. E., Allenby G. M. The value of purchase history data in target marketing. Marketing Sci. (1996) 15(4):321–340Link, Google Scholar
• Sarwar B., Karypis G., Konstan J., Riedl J. Application of dimensionality reduction in recommender systems: A case study. Proc. WebKDD Workshop ACM SIGKKD (2000) (ACM Press, New York) Crossref, Google Scholar
• Schafer J., Konstan J., Riedl J. E-commerce recommendation applications. Data Mining Knowledge Discovery (2001) 5(1–2):115–153Crossref, Google Scholar
• Shardanand U., Maes P. Social information filtering: Algorithms for automating word of mouth. Proc. ACM Conf. Human Factors Comput. Systems (1995) (ACM Press, New York) 210–217Crossref, Google Scholar
• Ungar L. H., Foster D. P. A formal statistical approach to collaborative filtering. Proc. Conf. Automated Learn. Discovery (CONALD’98) (1998) Pittsburgh, PA http://citeseer.ist.psu.edu/ungar98formal.htmlGoogle Scholar
• Uzzi B., Spiro J. Collaboration and creativity: The small world problem. Amer. J. Sociol. (2005) 111(2):447–504Crossref, Google Scholar
• Vrooman E., Riedl J., Konstan J.Word of Mouse: The Marketing Power of Collaborative Filtering (2002) (Warner Business Books, New York) Google Scholar
• Watts D. J.Small Worlds: The Dynamics of Networks Between Order and Randomness (1999) (Princeton University Press, Princeton, NJ) Crossref, Google Scholar
• Watts D. J., Strogatz S. H. Collective dynamics of small-world networks. Nature (1998) 393:440–442Crossref, Google Scholar
• Yang I., Jeong H., Kahng B., Barabási A.-L. Emerging behavior in electronic bidding. Phys. Rev. Lett. E (2003) 68(1):016102-1–016102-5Google Scholar