By Topic

Integrating Item Category Information in Collaborative Filtering Recommender Algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Zhong Yao ; Sch. of Econ. & Manage., Beihang Univ., Beijing ; Fujun Lai

To produce high quality recommendations and achieve high coverage in the face of data sparsity in recommender systems, we explore category-based adjusted conditional probability similarity (CACPS) collaborative filtering technique in this paper. CACPS technique firstly analyzes the user-item matrix to identify relationships between different items, and then uses these relationships to indirectly compute recommendations for users. For the rating of forecasting used in recommendations, we use a weighted average in measuring the k-nearest neighbor ratings. Finally, we experimentally evaluate our results and compare them to the k-nearest neighbor approach with correlation similarity, cosine similarity and adjusted cosine similarity. Our experiments suggest that CACPS algorithms provide a better performance than the other item-based algorithms, while at the same time providing better quality than the other item-based algorithms.

Published in:

Natural Computation, 2008. ICNC '08. Fourth International Conference on  (Volume:7 )

Date of Conference:

18-20 Oct. 2008