A collaborative filtering similarity measure based on potential field

被引:16
作者
Leng, Yajun [1 ]
Lu, Qing [1 ]
Liang, Changyong [2 ]
机构
[1] Shanghai Univ Elect Power, Coll Econ & Management, Shanghai, Peoples R China
[2] Hefei Univ Technol, Sch Management, Hefei, Peoples R China
基金
中国国家自然科学基金;
关键词
Algorithms; Systems theory; RECOMMENDER SYSTEMS; ALGORITHM; HYBRID; RULES;
D O I
10.1108/K-10-2014-0212
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Purpose - Collaborative recommender systems play a crucial role in providing personalized services to online consumers. Most online shopping sites and many other applications now use the collaborative recommender systems. The measurement of the similarity plays a fundamental role in collaborative recommender systems. Some of the most well-known similarity measures are: Pearson's correlation coefficient, cosine similarity and mean squared differences. However, due to data sparsity, accuracy of the above similarity measures decreases, which makes the formation of inaccurate neighborhood, thereby resulting in poor recommendations. The purpose of this paper is to propose a novel similarity measure based on potential field. Design/methodology/approach - The proposed approach constructs a dense matrix: user-user potential matrix, and uses this matrix to compute potential similarities between users. Then the potential similarities are modified based on users' preliminary neighborhoods, and k users with the highest modified similarity values are selected as the active user's nearest neighbors. Compared to the rating matrix, the potential matrix is much denser. Thus, the sparsity problem can be efficiently alleviated. The similarity modification scheme considers the number of common neighbors of two users, which can further improve the accuracy of similarity computation. Findings - Experimental results show that the proposed approach is superior to the traditional similarity measures. Originality/value - The research highlights of this paper are as follows: the authors construct a dense matrix: user-user potential matrix, and use this matrix to compute potential similarities between users; the potential similarities are modified based on users' preliminary neighborhoods, and k users with the highest modified similarity values are selected as the active user's nearest neighbors; and the proposed approach performs better than the traditional similarity measures. The manuscript will be of particular interests to the scientists interested in recommender systems research as well as to readers interested in solution of related complex practical engineering problems.
引用
收藏
页码:434 / 445
页数:12
相关论文
共 31 条
  • [1] Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions
    Adomavicius, G
    Tuzhilin, A
    [J]. IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) : 734 - 749
  • [2] A new similarity measure for collaborative filtering to alleviate the new user cold-starting problem
    Ahn, Hyung Jun
    [J]. INFORMATION SCIENCES, 2008, 178 (01) : 37 - 51
  • [3] A hybrid recommendation technique based on product category attributes
    Albadvi, Amir
    Shahbazi, Mohammad
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2009, 36 (09) : 11480 - 11488
  • [4] [Anonymous], P ITRUST 2005
  • [5] [Anonymous], 1993, FUNDAMENTALS PHYS
  • [6] [Anonymous], 2002, P 5 INT C COMP INF S
  • [7] E-commerce recommendation applications
    Ben Schafer, J
    Konstan, JA
    Riedl, J
    [J]. DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (1-2) : 115 - 153
  • [8] Collaborative filtering based on significances
    Bobadilla, Jesus
    Hernando, Antonio
    Ortega, Fernando
    Gutierrez, Abraham
    [J]. INFORMATION SCIENCES, 2012, 185 (01) : 1 - 17
  • [9] A collaborative filtering similarity measure based on singularities
    Bobadilla, Jesus
    Ortega, Fernando
    Hernando, Antonio
    [J]. INFORMATION PROCESSING & MANAGEMENT, 2012, 48 (02) : 204 - 217
  • [10] Deng Ai-Lin, 2003, Journal of Software, V14, P1621