AdaM : adaptive-maximum imputation for neighborhood-based collaborative filtering
Contribuinte(s) |
Ozyer, Tansel Carrington, Peter Lim, Ee-Peng |
---|---|
Data(s) |
01/01/2013
|
Resumo |
In the context of collaborative filtering, the well known data sparsity issue makes two like-minded users have little similarity, and consequently renders the k nearest neighbour rule inapplicable. In this paper, we address the data sparsity problem in the neighbourhood-based CF methods by proposing an Adaptive-Maximum imputation method (AdaM). The basic idea is to identify an imputation area that can maximize the imputation benefit for recommendation purposes, while minimizing the imputation error brought in. To achieve the maximum imputation benefit, the imputation area is determined from both the user and the item perspectives; to minimize the imputation error, there is at least one real rating preserved for each item in the identified imputation area. A theoretical analysis is provided to prove that the proposed imputation method outperforms the conventional neighbourhood-based CF methods through more accurate neighbour identification. Experiment results on benchmark datasets show that the proposed method significantly outperforms the other related state-of-the-art imputation-based methods in terms of accuracy. |
Identificador | |
Idioma(s) |
eng |
Publicador |
IEEE |
Relação |
http://dro.deakin.edu.au/eserv/DU:30057134/evid-asonamconfpeerreviewgnrl-2013.pdf http://dro.deakin.edu.au/eserv/DU:30057134/ren-adamadaptivemaximum-2013.pdf |
Direitos |
2013, IEEE/ACM |
Tipo |
Conference Paper |