Analyzing consumer-product graphs: Empirical findings and applications in recommender systems

Management Science

Volumn 53, Issue 7, 2007, Pages 1146-1164

  Huang, Zan ^a   Zeng, Daniel D ^b   Chen, Hsinchun ^b  

^a PENNSYLVANIA STATE UNIVERSITY   (United States)

^b UNIVERSITY OF ARIZONA   (United States)

Author keywords

Collaborative filtering; Consumer purchase behavior; Random graph theory; Recommender systems; Topological features

Indexed keywords

COLLABORATIVE FILTERING; CONSUMER-PURCHASE BEHAVIOR; RANDOM GRAPH THEORY; RECOMMENDER SYSTEMS; TOPOLOGICAL FEATURES;

ALGORITHMS; BEHAVIORAL RESEARCH; CUSTOMER SATISFACTION; ELECTRONIC COMMERCE; MATHEMATICAL MODELS; PRODUCT DEVELOPMENT;

GRAPH THEORY;

EID: 38549175723     PISSN: 00251909     EISSN: 15265501     Source Type: Journal    
DOI: 10.1287/mnsc.1060.0619     Document Type: Article

References (60)

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