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 条
  • [41] A Collaborative Filtering Algorithm of Calculating Similarity Based on Item Rating and Attributes
    Li, Zelong
    Huang, Mengxing
    Zhang, Yu
    2017 14TH WEB INFORMATION SYSTEMS AND APPLICATIONS CONFERENCE (WISA 2017), 2017, : 215 - 218
  • [42] Ensemble Similarity based Collaborative Filtering Feedback: A Recommender System Scenario
    Thukral, Rishabh
    Ramesh, Dharavath
    2018 INTERNATIONAL CONFERENCE ON ADVANCES IN COMPUTING, COMMUNICATIONS AND INFORMATICS (ICACCI), 2018, : 2398 - 2402
  • [43] Collaborative filtering based on significances
    Bobadilla, Jesus
    Hernando, Antonio
    Ortega, Fernando
    Gutierrez, Abraham
    INFORMATION SCIENCES, 2012, 185 (01) : 1 - 17
  • [44] An improved similarity measure method in Collaborative Filtering Recommendation Algorithm
    Mao, Jiumei
    Cui, Zhiming
    Zhao, Pengpeng
    Li, Xuehuan
    2013 INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA (CLOUDCOM-ASIA), 2013, : 297 - 303
  • [45] A similarity measure based on Kullback-Leibler divergence for collaborative filtering in sparse data
    Deng, Jiangzhou
    Wang, Yong
    Guo, Junpeng
    Deng, Yongheng
    Gao, Jerry
    Park, Younghee
    JOURNAL OF INFORMATION SCIENCE, 2019, 45 (05) : 656 - 675
  • [46] An Improved Fusion-Based Semantic Similarity Measure for Effective Collaborative Filtering Recommendations
    Al-Hassan, Malak
    Abu-Salih, Bilal
    Alshdaifat, Esra'a
    Aloqaily, Ahmad
    Rodan, Ali
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS, 2024, 17 (01)
  • [47] Sparsity Analysis of New Biased Pearson Similarity Measure for Memory Based Collaborative Filtering
    Raghuwanshi, Sandeep
    Agrawal, Shikha
    Agrawal, Jitendra
    Pandey, Swati
    ADVANCED NETWORK TECHNOLOGIES AND INTELLIGENT COMPUTING, ANTIC 2023, PT IV, 2024, 2093 : 344 - 361
  • [48] An Improved Fusion-Based Semantic Similarity Measure for Effective Collaborative Filtering Recommendations
    Malak Al-Hassan
    Bilal Abu-Salih
    Esra’a Alshdaifat
    Ahmad Aloqaily
    Ali Rodan
    International Journal of Computational Intelligence Systems, 17
  • [49] Improving neighbor-based collaborative filtering by using a hybrid similarity measurement
    Wang, Dawei
    Yih, Yuehwern
    Ventresca, Mario
    EXPERT SYSTEMS WITH APPLICATIONS, 2020, 160
  • [50] TST: Threshold Based Similarity Transitivity Method in Collaborative Filtering with Cloud Computing
    Xie, Feng
    Chen, Zhen
    Xu, Hongfeng
    Feng, Xiwei
    Hou, Qi
    TSINGHUA SCIENCE AND TECHNOLOGY, 2013, 18 (03) : 318 - 327