z-logo
Premium
A fuzzy clustering‐based denoising model for evaluating uncertainty in collaborative filtering recommender systems
Author(s) -
Zhu Jun,
Han Lixin,
Gou Zhinan,
Yuan Xiaofeng
Publication year - 2018
Publication title -
journal of the association for information science and technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.903
H-Index - 145
eISSN - 2330-1643
pISSN - 2330-1635
DOI - 10.1002/asi.24036
Subject(s) - computer science , collaborative filtering , recommender system , cluster analysis , data mining , fuzzy logic , entropy (arrow of time) , resampling , noise (video) , machine learning , noise reduction , artificial intelligence , physics , quantum mechanics , image (mathematics)
Recommender systems are effective in predicting the most suitable products for users, such as movies and books. To facilitate personalized recommendations, the quality of item ratings should be guaranteed. However, a few ratings might not be accurate enough due to the uncertainty of user behavior and are referred to as natural noise. In this article, we present a novel fuzzy clustering‐based method for detecting noisy ratings. The entropy of a subset of the original ratings dataset is used to indicate the data‐driven uncertainty, and evaluation metrics are adopted to represent the prediction‐driven uncertainty. After the repetition of resampling and the execution of a recommendation algorithm, the entropy and evaluation metrics vectors are obtained and are empirically categorized to identify the proportion of the potential noise. Then, the fuzzy C‐means‐based denoising (FCMD) algorithm is performed to verify the natural noise under the assumption that natural noise is primarily the result of the exceptional behavior of users. Finally, a case study is performed using two real‐world datasets. The experimental results show that our proposal outperforms previous proposals and has an advantage in dealing with natural noise.

This content is not available in your region!

Continue researching here.

Having issues? You can contact us here