Applying landmarks to enhance memory-based collaborative filtering

被引:31
作者
Lima, Gustavo R. [1 ]
Mello, Carlos E. [2 ]
Lyra, Adria [3 ]
Zimbrao, Geraldo [1 ]
机构
[1] Univ Fed Rio de Janeiro, COPPE, PESC, BR-68511 Rio De Janeiro, Brazil
[2] Fed Univ State Rio De Janeiro, PPGI, Av Pasteur 458 Urca, Rio De Janeiro, Brazil
[3] Univ Fed Rural Rio de Janeiro, DCC, Nova Iguacu, RJ, Brazil
关键词
Recommender system; Collaborative filtering; Memory-based algorithms; Landmarks; Dimensionality reduction; Non-linear transformations; RECOMMENDER SYSTEMS; MATRIX FACTORIZATION; IMPROVE; MODEL;
D O I
10.1016/j.ins.2019.10.041
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:412 / 428
页数:17
相关论文
共 49 条
[1]   Using Explainability for Constrained Matrix Factorization [J].
Abdollahi, Behnoush ;
Nasraoui, Olfa .
PROCEEDINGS OF THE ELEVENTH ACM CONFERENCE ON RECOMMENDER SYSTEMS (RECSYS'17), 2017, :79-83
[2]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[3]  
Agarwal D, 2009, KDD-09: 15TH ACM SIGKDD CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, P19
[4]   A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem [J].
Ahn, Hyung Jun .
INFORMATION SCIENCES, 2008, 178 (01) :37-51
[5]  
[Anonymous], ADV NEURAL INFORM PR
[6]  
[Anonymous], 2015, COMPREHENSIVE SURVEY
[7]  
[Anonymous], NEIGHBORHOOD BASED C
[8]  
[Anonymous], KNOWLEDGE BASED RECO
[9]  
Bank R.E., 1993, Advances in Computa- tional Mathematics, V1, P127, DOI DOI 10.1007/BF02070824
[10]  
Bennett James, 2007, The netflix prize