A collaborative filtering similarity measure based on singularities

被引:123
|
作者
Bobadilla, Jesus [1 ]
Ortega, Fernando [1 ]
Hernando, Antonio [1 ]
机构
[1] Univ Politecn Madrid, FilmAffin Com Res Team, Madrid 28031, Spain
关键词
Collaborative filtering; Recommender systems; Singularity; Similarity measures; Neighborhoods; OF-THE-ART; RECOMMENDER SYSTEMS;
D O I
10.1016/j.ipm.2011.03.007
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Recommender systems play an important role in reducing the negative impact of information overload on those websites where users have the possibility of voting for their preferences on items. The most normal technique for dealing with the recommendation mechanism is to use collaborative filtering, in which it is essential to discover the most similar users to whom you desire to make recommendations. The hypothesis of this paper is that the results obtained by applying traditional similarities measures can be improved by taking contextual information, drawn from the entire body of users, and using it to calculate the singularity which exists, for each item, in the votes cast by each pair of users that you wish to compare. As such, the greater the measure of singularity result between the votes cast by two given users, the greater the impact this will have on the similarity. The results, tested on the Movie lens, Netflix and Film Affinity databases, corroborate the excellent behaviour of the singularity measure proposed. (C) 2011 Elsevier Ltd. All rights reserved.
引用
收藏
页码:204 / 217
页数:14
相关论文
共 50 条
  • [1] Maximal Information Based Similarity Measure for Collaborative Filtering
    Linn, Su Mon
    Lwin, May Thu
    2019 20TH IEEE/ACIS INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING, ARTIFICIAL INTELLIGENCE, NETWORKING AND PARALLEL/DISTRIBUTED COMPUTING (SNPD), 2019, : 190 - 194
  • [2] Collaborative filtering with a graph-based similarity measure
    Do Thi Lien
    Nguyen Duy Phuong
    2014 INTERNATIONAL CONFERENCE ON COMPUTING, MANAGEMENT AND TELECOMMUNICATIONS (COMMANTEL), 2014, : 251 - 256
  • [3] An exponential similarity measure for collaborative filtering
    Moghadam, Parsa Heidary
    Heidari, Vahid
    Moeini, Ali
    Kamandi, Ali
    SN APPLIED SCIENCES, 2019, 1 (10):
  • [4] An exponential similarity measure for collaborative filtering
    Parsa Heidary Moghadam
    Vahid Heidari
    Ali Moeini
    Ali Kamandi
    SN Applied Sciences, 2019, 1
  • [5] A collaborative filtering similarity measure based on potential field
    Leng, Yajun
    Lu, Qing
    Liang, Changyong
    KYBERNETES, 2016, 45 (03) : 434 - 445
  • [6] An Efficient Similarity Measure for Collaborative Filtering
    Mu, Yi
    Xiao, Nianhao
    Tang, Ruichun
    Luo, Liang
    Yin, Xiaohan
    2018 INTERNATIONAL CONFERENCE ON IDENTIFICATION, INFORMATION AND KNOWLEDGE IN THE INTERNET OF THINGS, 2019, 147 : 416 - 421
  • [7] A balanced memory-based collaborative filtering similarity measure
    Bobadilla, Jesus
    Ortega, Fernando
    Hernando, Antonio
    Arroyo, Angel
    INTERNATIONAL JOURNAL OF INTELLIGENT SYSTEMS, 2012, 27 (10) : 939 - 946
  • [8] A New Similarity Measure-Based Collaborative Filtering Approach for Recommender Systems
    Wang, Wei
    Lu, Jie
    Zhang, Guangquan
    FOUNDATIONS OF INTELLIGENT SYSTEMS (ISKE 2013), 2014, 277 : 443 - 452
  • [9] Similarity Aggregation for Collaborative Filtering
    Sarwar, Sheikh Muhammad
    Hasan, Mahamudul
    Billal, Masum
    Ignatov, Dmitry I.
    ANALYSIS OF IMAGES, SOCIAL NETWORKS AND TEXTS, AIST 2015, 2015, 542 : 236 - 242
  • [10] Nonparametric statistics inspired similarity measure for accuracy in collaborative filtering
    Department of Computer Science and Technology, University of Science and Technology of China, Hefei 230027, China
    不详
    Liu, S. (psychen@mail.ustc.edu.cn), 1600, Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States (09): : 8397 - 8406