ACM Home Page
Please provide us with feedback. Feedback
Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering
Full text PdfPdf (173 KB)
Source ACM Transactions on Information Systems (TOIS) archive
Volume 22 ,  Issue 1  (January 2004) table of contents
Pages: 116 - 142  
Year of Publication: 2004
ISSN:1046-8188
Authors
Zan Huang  The University of Arizona, Tucson, AZ
Hsinchun Chen  The University of Arizona, Tucson, AZ
Daniel Zeng  The University of Arizona, Tucson, AZ
Publisher
ACM  New York, NY, USA
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/963770.963775
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
Albert, R. and Barabasi, A.-L. 2002. Statistical mechanics of complex networks. Rev. Mod. Phys. 74, 47--97.
 
3
Anderson, J. R. 1983. A spreading activation theory of memory. J. Verb. Learn. Verb. Behav. 22, 261--295.
4
 
5
 
6
 
7
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.
 
8
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.
 
9
Burke, R. 2000. Semantic ratings and heuristic similarity for collaborative filtering. In Proceedings of the 17th National Conference on Artificial Intelligence.
 
10
 
11
 
12
 
13
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.
 
14
 
15
Collins, A. M. and Loftus, E. F. 1975. A spreading activation theory of semantic processing. Psych. Rev. 82, 6, 407--428.
16
 
17
18
 
19
 
20
21
 
22
 
23
24
 
25
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.
26
27
28
 
29
 
30
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).
 
31
 
32
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.
 
33
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.
 
34
 
35
36
37
38
39
 
40
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.
41
42
 
43
44
 
45
46
47
48

CITED BY  21
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
Zan Huang: colleagues
Hsinchun Chen: colleagues
Daniel Zeng: colleagues

Peer to Peer - Readers of this Article have also read: