ComputingComputer ScienceData MiningMachine LearningRecommender SystemsCollaborative FilteringMatrix FactorizationRecommendation SystemsConditional Probability ModelsCorrelationData SparsityItem-based Collaborative FilteringItem-to-item SimilarityPersonalized RecommendationSimilarity ComputationSparsity Problem
In order to overcome the limitations of data sparsity and inaccurate similarity in personalized recommendation systems, a new collaborative filtering recommendation algorithm by using items categories similarity and interestingness measure is proposed. In this algorithm, first the items categories similarity matrix is constructed by calculating the item-item category distance, and then analyzes the correlation degree of different items by using interestingness measure, last an improved collaborative filtering algorithm is proposed by combining the information of items categories with item-item interestingness and utilizing improved conditional probability method as the standard item-item similarity measure. Experimental results show this algorithm can effectively alleviate the dataset sparsity problem and achieve better prediction accuracy compared to other well-performing collaborative filtering algorithms.
6
Item-based collaborative filtering recommendation algorithms
Badrul Sarwar, George Karypis, Joseph A. Konstan et al. · 2001 · 9K citations
Eigentaste: A Constant Time Collaborative Filtering Algorithm
Ken Goldberg, Dhruv Gupta, C. Perkins · Information Retrieval · 2001 · 1.4K citations · Full text
Clustering Methods for Collaborative Filtering
Lyle Ungar, Dean P. Foster · 1998 · 630 citations
Evaluation of Item-Based Top- <i>N</i> Recommendation Algorithms
George Karypis · 2001 · 587 citations
Charų C. Aggarwal, Joel L. Wolf, Kun‐Lung Wu et al. · 1999 · 388 citations