Power coefficient as a similarity measure for memory-based collaborative recommender systems

被引:89
作者
Al-Shamri, Mohammad Yahya H. [1 ,2 ]
机构
[1] Ibb Univ, Fac Engn & Architecture, Dept Elect Engn, Ibb, Yemen
[2] King Khalid Univ, Coll Comp Sci, Comp Networks & Commun Engn Dept, Abha, Saudi Arabia
关键词
Web personalization; Collaborative recommender system; Similarity measure; Jaccard coefficient; Dice coefficient; Power coefficient;
D O I
10.1016/j.eswa.2014.03.025
中图分类号
TP18 [人工智能理论];
学科分类号
140502 [人工智能];
摘要
E-commerce systems employ recommender systems to enhance the customer loyalty and hence increasing the cross-selling of products. However, choosing appropriate similarity measure is a key to the recommender system success. Based on this measure, a set of neighbors for the current active user is formed which in turn will be used later to recommend unseen items to this active user. Pearson correlation coefficient, the most popular similarity measure for memory-based collaborative recommender system (CRS), measures how much two users are correlated. However, statistic's literature introduced many other coefficients for matching two sets (vectors) that may perform better than Pearson correlation coefficient. This paper explores Jaccard and Dice coefficients for matching users of CRS. A more general coefficient called a Power coefficient is proposed in this paper which represents a family of coefficients. Specifically. Power coefficient gives many degrees for emphasizing on the positive matches between users. However, CRS users have positive and negative matches and therefore these coefficients have to be modified to take negative matches into consideration. Consequently, they become more suitable for CRS research. Many experiments are carried out for all the proposed variants and are compared with the traditional approaches. The experimental results show that the proposed variants outperform Pearson correlation coefficient and cosine similarity measure as they are the most common approaches for memory-based CRS. (C) 2014 Elsevier Ltd. All rights reserved.
引用
收藏
页码:5680 / 5688
页数:9
相关论文
共 17 条
[1]
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
[2]
Al-Shamri M.Y.H., 2007, P 3 IND INT C ART IN, P301
[3]
[Anonymous], 2014, J INTELL LEARN SYST
[4]
[Anonymous], 2011, Pei. data mining concepts and techniques
[5]
[Anonymous], 2012, Mining of massive datasets
[6]
Recommender systems survey [J].
Bobadilla, J. ;
Ortega, F. ;
Hernando, A. ;
Gutierrez, A. .
KNOWLEDGE-BASED SYSTEMS, 2013, 46 :109-132
[7]
Breese J. S., 1998, Uncertainty in Artificial Intelligence. Proceedings of the Fourteenth Conference (1998), P43
[8]
Comparison of Collaborative Filtering Algorithms: Limitations of Current Techniques and Proposals for Scalable, High-Performance Recommender Systems [J].
Cacheda, Fidel ;
Carneiro, Victor ;
Fernandez, Diego ;
Formoso, Vreixo .
ACM TRANSACTIONS ON THE WEB, 2011, 5 (01)
[9]
MEASURES OF THE AMOUNT OF ECOLOGIC ASSOCIATION BETWEEN SPECIES [J].
DICE, LR .
ECOLOGY, 1945, 26 (03) :297-302
[10]
Guo G., 2013, P 23 INT JOINT C ART, P2619