Affiliation:
1. Chongqing University of Posts and Telecommunications
Abstract
Traditional collaborative filtering algorithms are facing severe challenges of sparse user rating and real-time recommendation. To solve the problems, the category structure of merchandise is analyzed deeply and a collaborative filtering recommendation algorithm based on item category is proposed. A smooth filling technique is used for rating matrix with user preferences and all users rating on the item to solve the sparse problem. A user has different interests on different category. For every item, the nearest neighbors are searched within the category of the item. Not only is the search space of the users’ neighbors reduced greatly, but also search speed and accuracy are promoted. The experimental results show that the method can efficiently improve the recommendation scalability and accuracy of the recommender system.
Publisher
Trans Tech Publications, Ltd.
Reference7 articles.
1. Arwar B, Karypls G, Konstan J, et al. Item-based collaborative filtering recommendation algorithms[C]. In: 10th Int. World Wide Web Conf., (2001).
2. Breese J, Hecherman D, Kadie C. Empirical analysis of predictive algorithms for collaborative filtering. In: 14th Conf. on Uncertainty in Artificial Intelligence (UAI'98), (1998).
3. Sarwar B, Karypis G, Konstan J, et al. Application of dimensionality reduction in recommender system-A case study. In: ACM Web KDD 2000 Workshop, (2000).
4. Zhang F,Chang H Y.A collaborative filtering algorithm embedded BP network to ameliorate sparsity issue. In: Int. Conf. on Machine Learning and Cybernetics, (2005).
5. Jung K Y. User preference through Bayesian categorization for recommendation. In: Trends in Artificial Intelligence, (2006).