Applying associative retrieval techniques to alleviate the sparsity problem in collaborative filtering

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.

Negative ratings play a positive role in information filtering

“…Further analyses show that in the macroscopic level negative ratings are more valuable for sparser data sets, and in the microscopic level, negative ratings from inactive users onto less popular objects are more valuable. We finally outline the significant relevance of our results to the two long-term challenges in information filtering: the sparsity problem [34] and the cold-start problem [35].…”

A Content-Boosted Collaborative Filtering Algorithm for Personalized Training in Interpretation of Radiological Imaging

“…However, as described above, they suffer from the cold-start problem in one form or another. This is the well-known problem of handling new cases and new trainees [15]. To overcome the drawbacks of CBF and CF, some hybrid approaches were proposed, which incorporate the advantages of both methods, while not inheriting the disadvantages of either [14,[17][18][19].…”

Personalized Paper Recommendation Based on User Historical Behavior

“…When A and B have high relevance to each other, while B and C share same interests. But because A and C have a few common preference, we directly consider A and C don't have any relevance, which ignores potential associations between them [20]paper21. When recommendation papers for A, it will male recommendation results confined to a certain field without C's field blind to A.…”