Abstract
Recommender systems are being widely applied in many application settings to suggest products, services, and information items to potential consumers. Collaborative filtering, the most successful recommendation approach, makes recommendations based on past transactions and feedback from consumers sharing similar interests. A major problem limiting the usefulness of collaborative filtering is the sparsity problem, which refers to a situation in which transactional or feedback data is sparse and insufficient to identify similarities in consumer interests. In this article, we propose to deal with this sparsity problem by applying an associative retrieval framework and related spreading activation algorithms to explore transitive associations among consumers through their past transactions and feedback. Such transitive associations are a valuable source of information to help infer consumer interests and can be explored to deal with the sparsity problem. To evaluate the effectiveness of our approach, we have conducted an experimental study using a data set from an online bookstore. We experimented with three spreading activation algorithms including a constrained Leaky Capacitor algorithm, a branch-and-bound serial symbolic search algorithm, and a Hopfield net parallel relaxation search algorithm. These algorithms were compared with several collaborative filtering approaches that do not consider the transitive associations: a simple graph search approach, two variations of the user-based approach, and an item-based approach. Our experimental results indicate that spreading activation-based approaches significantly outperformed the other collaborative filtering methods as measured by recommendation precision, recall, the F-measure, and the rank score. We also observed the over-activation effect of the spreading activation approach, that is, incorporating transitive associations with past transactional data that is not sparse may "dilute" the data used to infer user preferences and lead to degradation in recommendation performance.
- Aggarwal, C. C., Wolf, J. L., Wu, K.-L., and Yu, P. S. 1999. Horting hatches an egg: A new graph-theoretic approach to collaborative filtering. In Proceedings of the 5th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD'99) (San Diego, Calif.). ACM, New York, 201--212. Google Scholar
- Albert, R. and Barabasi, A.-L. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47--97.Google Scholar
- Anderson, J. R. 1983. A spreading activation theory of memory. J. Verb. Learn. Verb. Behav. 22, 261--295.Google Scholar
- Balabanovic, M. and Shoham, Y. 1997. FAB: Content-based, collaborative recommendation. Commun. ACM 40, 3, 66--72. Google Scholar
- Basu, C., Hirsh, H., and Cohen, W. 1998. Recommendation as classification: Using social and content-based information in recommendation. In Proceedings of the 15th National Conference on Artificial Intelligence, 714--720. Google Scholar
- Billsus, D. and Pazzani, M. J. 1998. Learning collaborative information filters. In Proceedings of the 15th International Conference on Machine Learning, 46--54. Google Scholar
- Bollen, J., Vandesompel, H., and Rocha, L. M. 1999. Mining associative relations from website logs and their application to context-dependent retrieval using spreading activation. In Proceedings of the Workshop on Organizing Web Space (WOWS). ACM Digital Libraries 99.Google Scholar
- Breese, J. S., Heckerman, D., and KADIE, C. 1998. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (Madison, Wisc.). Morgan-Kaufmann, Reading, Mass. 43--52. Google Scholar
- Burke, R. 2000. Semantic ratings and heuristic similarity for collaborative filtering. In Proceedings of the 17th National Conference on Artificial Intelligence.Google Scholar
- Chen, H. and Dhar, V. 1991. Cognitive process as a basis for intelligent retrieval systems design. Information Processing and Management 27, 5, 405--432. Google Scholar
- Chen, H., Lynch, K. J., Basu, K., and Ng, D. T. 1993. Generating, integrating, and activating thesauri for concept-based document retrieval. IEEE Exp., Spec. Series Artif. Intell. Text-based Inf. Systems 8, 2, 25--34. Google Scholar
- Chen, H. and Ng, D. T. 1995. An algorithmic approach to concept exploration in a large knowledge network (automatic thesaurus consultation): Symbolic branch-and-bound search vs. Connectionist Hopfield net activation. J. ASIS 46, 5, 348--369. Google Scholar
- Claypool, M., Gokhale, A., Miranda, T., Murnikov, P., Netes, D., and Sartin, M. 1999. Combining content-based and collaborative filters in an online newspaper. In Proceedings of the ACM SIGIR Workshop on Recommender Systems. ACM, New York.Google Scholar
- Cohen, P. R. and Kjeldsen, R. 1987. Information retrieval by constrained spreading activation in semantic networks. Information Processing and Management 23, 4, 255--268. Google Scholar
- Collins, A. M. and Loftus, E. F. 1975. A spreading activation theory of semantic processing. Psych. Rev. 82, 6, 407--428.Google Scholar
- Condliff, M. K., Lewis, D. D., Madigan, D., and Posse, C. 1999. Bayesian mixed-effects models for recommender systems. In Proceedings of the ACM SIGIR Workshop on Recommender Systems. ACM, New York. Google Scholar
- Crestani, F. and Lee, P. L. 2000. Searching the web by constrained spreading activation. Inf. Proc. Manage. 36, 585--605. Google Scholar
- Crouch, C. and Yang, B. 1992. Experiments in automatic statistical thesaurus construction. In Proceedings of the 15th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval, (Copenhagen, Denmark). ACM, New York, 77--88. Google Scholar
- Goldberg, K., Roeder, T., Gupta, D., and Perkins, C. 2001. Eigentaste: A constant time collaborative filtering algorithm. Inf. Ret. 4, 2, 133--151. Google Scholar
- Good, N., Schafer, J., Konstan, J., Borchers, A., Sarwar, B., Herlocker, J., and Riedl, J. 1999. Combining collaborative filtering with personal agents for better recommendations. In Proceedings of the 16th National Conference on Artificial Intelligence, 439--446. Google Scholar
- Gordon, M. 1988. Probabilistic and genetic algorithm for document retrieval. Commun. ACM 31, 10, 1208--1218. Google Scholar
- Hill, W., Stead, L., Rosenstein, M., and Furnas, G. 1995. Recommending and evaluating choices in a virtual community of use. In Proceedings of the ACM CHI'95 Conference on Human Factors in Computing Systems. ACM, New York, 194--201. Google Scholar
- Huang, Z., Chung, W., and Chen, H. 2003. A graph model for e-commerce recommender systems. J. ASIST, in press. Google Scholar
- Huang, Z., Chung, W., Ong, T.-H., and Chen, H. 2002. A graph-based recommender system for digital library. In Proceedings of the 2nd ACM/IEEE-CS Joint Conference on Digital Libraries (Portland, Ore.). ACM, New York, 65--73. Google Scholar
- Jung, G. and Raghavan, V. 1990. Connectionist learning in constructing thesaurus-like knowledge structure. In Proceedings of the AAAI Spring Symposium on Text-based Intelligent Systems.Google Scholar
- Karypis, G. 2001. Evaluation of item-based top-n recommendation algorithms. In Proceedings of the 10th International Conference on Information and Knowledge Management (CIKM) (Atlanta, Ga.). Google Scholar
- Knight, K. 1990. Connectionist ideas and algorithms. Commun. ACM 33, 11, 59--74. Google Scholar
- Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., and Riedl, J. 1997. Group- Lens: Applying collaborative filtering to Usenet news. Commun. ACM 40, 3, 77--87. Google Scholar
- Lin, W., Alvarez, S. A., and Ruiz, C. 2002. Efficient adaptive-support association rule mining for recommender systems. Data Mining Knowl. Disc. 6, 1, 83--105. Google Scholar
- Mirza, B. J. 2001. Jumping connections: A graph-theoretic model for recommender systems. Computer Science Department, Virginia Polytechnic Institute and state university, (http://scholar.lib.vt.edu/theses/available/etd-02282001-175040/unrestricted/etd.pdf).Google Scholar
- Mirza, B. J., Keller, B. J., and Ramakrishnan, N. 2003. Studying recommendation algorithms by graph analysis. J. Intel. Inf. Syst. 20, 2, 131--160. Google Scholar
- Mobasher, B. H., Dai, T. L., Nakagawa, M., Sun, Y., and Wiltshire, J. 2000. Discovery of aggregate usage profiles for web personalization. In Proceedings of the Workshop on Web Mining for E-Commerce---Challenges and Opportunities.Google Scholar
- Nasraoui, O., Frigui, H., Joshi, A., and Krishnapuram, R. 1999. Mining web access logs using relational competitive fuzzy clustering. In Proceedings of the 8th International Fuzzy Systems Association World Congress---IFSA 99.Google Scholar
- Pazzani, M. 1999. A framework for collaborative, content-based and demographic filtering. Artif. Intel. Rev. 13, 5--6, 393--408. Google Scholar
- Pazzani, M. and Billsus, D. 1997. Learning and revising user profiles: The identification of interesting web sites. Mach. Learn. 27, 3, 313--331. Google Scholar
- Pirolli, P., Pitkow, J., and Rao, R. 1996. Silk from a sow's ear: Extracting usable structures from the web. In Proceedings of the ACM CHI 96 Conference on Human Factors in Computing Systems. 118--125. Google Scholar
- Resnick, P., Iacovou, N., Suchak, M., Bergstrom, P., and Riedl, J. 1994. GroupLens: An open architecture for collaborative filtering of NetNews. In Proceedings of the ACM CSCW'94 Conference on Computer-Supported Cooperative Work. ACM, New York, 175--186. Google Scholar
- Salton, G. and Buckley, C. 1988. On the use of spreading activation methods in automatic information. In Proceedings of the 11th ACM SIGIR International Conference on Research and Development in Information Retrieval. ACM, New York, 147--160. Google Scholar
- Sarwar, B., Karypis, G., Konstan, J., and Reidl, J. 2000a. Analysis of recommendation algorithms for e-commerce. In Proceedings of the ACM Conference on Electronic Commerce. ACM, New York, 158--167. Google Scholar
- Sarwar, B., Karypis, G., Konstan, J., and Riedl, J. 2000b. Application of dimensionality reduction in recommender systems: A case study. In Proceedings of the WebKDD Workshop at the ACM SIGKKD. ACM, New York.Google Scholar
- Sarwar, B., Konstan, J., Borchers, A., Herlocker, J., Miller, B., and Riedl, J. 1998. Using filtering agents to improve prediction quality in the GroupLens research collaborative filtering system. In Proceedings of the ACM Conference on Computer Supported Cooperative Work (CSCW). ACM, New York, 345--354. Google Scholar
- Sarwar, B. M., Karypis, G., Konstan, J. A., and Riedl, J. T. 2001. Item-based collaborative filtering recommendation algorithms. In Proceedings of the 10th International World Wide Web Conference. 285--295. Google Scholar
- Schafer, J., Konstan, J., and Riedl, J. 2001. E-commerce recommendation applications. Data Min. Knowl. Disc. 5, 1--2, 115--153. Google Scholar
- Schein, A. I., Popescul, A., Unger, L. H., and Pennock, D. M. 2002. Methods and metrics for cold-start recommendations. In Proceedings of the 25th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2002). (Tampere, Finland), 253--260. Google Scholar
- Shardanand, U. and Maes, P. 1995. Social information filtering: Algorithms for automating "word of mouth". In Proceedings of the ACM CHI'95 Conference on Human Factors in Computing Systems. ACM, New York, 210--217. Google Scholar
- Soboroff, I. and Nicholas, C. 2000. Collaborative filtering and the generalized vector space model. In Proceedings of the 23rd Annual International Conference on Research and Development in Information Retrieval (Athens, Greece). 351--353. Google Scholar
- Terveen, L., Hill, W., Amento, B., Mcdonald, D., and Creter, J. 1997. PHOAKS: A system for sharing recommendations. Commun. ACM 40, 3, 59--62. Google Scholar
- Wong, S. K. M., Ziarko, W., and Wong, P. C. N. 1985. Generalized vector spaces model in information retrieval. In Proceedings of the 8th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval. ACM, New York, 18--25. Google Scholar
Index Terms
- Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering
Recommendations
Collaborative filtering based on an iterative prediction method to alleviate the sparsity problem
iiWAS '09: Proceedings of the 11th International Conference on Information Integration and Web-based Applications & ServicesCollaborative filtering (CF) is one of the most popular recommender system technologies. It tries to identify users that have relevant interests and preferences by calculating similarities among user profiles. The idea behind this method is that, it may ...
Merging trust in collaborative filtering to alleviate data sparsity and cold start
Providing high quality recommendations is important for e-commerce systems to assist users in making effective selection decisions from a plethora of choices. Collaborative filtering is a widely accepted technique to generate recommendations based on ...
A fuzzy Bayesian approach to integrate user and item based collaborating filtering for enhanced recommendations
iiWAS '15: Proceedings of the 17th International Conference on Information Integration and Web-based Applications & ServicesMemory-based collaborative filtering (CF) techniques have been widely implemented for predicting ratings to unseen items by aggregating ratings of similar users or items in recommender systems (RS). Usually, sufficient ratings from similar users or ...
Comments