z-logo
open-access-imgOpen Access
A collaborative filtering recommendation algorithm based on user clustering with preference types
Author(s) -
Yan Yang,
Hui Yao,
Huafu Chen,
Qianqian Wang
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1848/1/012043
Subject(s) - collaborative filtering , computer science , recommender system , cluster analysis , scalability , preference , similarity (geometry) , data mining , set (abstract data type) , k nearest neighbors algorithm , construct (python library) , field (mathematics) , information retrieval , machine learning , artificial intelligence , database , mathematics , statistics , pure mathematics , image (mathematics) , programming language
The traditional collaborative filtering algorithm is extensively applied in the field of personalized recommendation, but it still faces the challenges of data sparsity and scalability problems which result in low quality and efficiency of recommendation. To address the problems, a hybrid collaborative filtering recommendation algorithm is proposed based on user preference type clustering. First, by analyzing the relationship between users and item categories, we construct the user item category preference matrix. On this basis, user clustering is carried out and users with similar preference types are clustered into the same user groups. Then, to search for the nearest neighbors of target user, similarity of users is calculated in the cluster it belongs to by considering both the user ratings and their preferred item categories. Finally, an improved Slope One algorithm is proposed and applied to the nearest neighbor set to predict item ratings and then generate recommendations. The experiments indicate the proposed hybrid collaborative filtering algorithm can improve recommendation performance in the case of a great many users.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here