Journal
INFORMATION SCIENCES
Volume 513, Issue -, Pages 412-428Publisher
ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2019.10.041
Keywords
Recommender system; Collaborative filtering; Memory-based algorithms; Landmarks; Dimensionality reduction; Non-linear transformations
Categories
Funding
- FAPERJ - Foundation for Research Support of Rio de Janeiro State [E-26/201.670/2017]
Ask authors/readers for more resources
Memory-based Collaborative Filtering (CF) has been a widely used approach for personalised recommendation with considerable success in many applications. An important issue regarding memory-based CF lies in similarity computation: the sparsity of the rating matrix leads to similarity computations based on few co-rated items between users, resulting in high sensitive predictions. Additionally, the sparse similarity computation has high computational cost, due to the dimensionality of the item space. In this paper, we pursue both these issues. We propose a new model to compute similarity by representing users (or items) through their distances to preselected users, named landmarks. Such user modelling allows the introduction of more ratings into similarity computations through transitive relations created by the landmarks. Unlike conventional memory-based CF, the proposal builds a new user space defined by distances to landmarks, avoiding sensitivity in similarity computations. Findings from our experiments show that the proposed modelling achieves better accuracy than the 'sparse' similarity representation in all tested datasets, and has also yielded competitive accuracy results against the compared model-based CF algorithms. Furthermore, the proposed implementation has beaten all compared methods in terms of computational performance, becoming a promising alternative to memory-based CF algorithms for large datasets. (C) 2019 Elsevier Inc. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available