TY - GEN
T1 - Parallel collaborative filtering recommendation model based on two-phase similarity
AU - Su, Hongyi
AU - Lin, Xianfei
AU - Wang, Caiqun
AU - Yan, Bo
AU - Zheng, Hong
N1 - Publisher Copyright:
© Springer International Publishing Switzerland 2015.
PY - 2015
Y1 - 2015
N2 - Problems such as cold startup, accuracy, and scalability are faced by traditional collaborative filtering recommendation algorithm if the system is expanded continuously. To resolve these issues, we propose a parallel collaborative filtering recommendation model on the basis of two-phase similarity (PCF-TPS) and weighted distance similarity measure (WDSM). In accordance with WDSM, the users’ similarity is calculated and their similarity matrix is obtained. At the same time, the items’ similarity is counted and its similarity matrix is got in line with Tanimoto Coefficient Similarity. For the users’ similarity matrix, their preferences are endowed with weights and in this way their new preferences matrix is received. In addition, the nearest neighbor item is found and a more accurate recommendation to the target user is given on the basis of the items’ similarity matrix and users’ new preferences matrix. Besides, in regard to the parallel computing framework, the parallel implementation of the model is completed. All these experiments are done on MovieLens dataset. The results show that PCF-TPS solves the problem of cold startup and increases the accuracy concerning CF. Compared with PCF-EV, PCF-TPS’s parallel realization can be improved to nearly 125 times on the whole. That is to say, it will be more meaningful to complex model using GPU than a small model. What’s more, PCF-EV’s distributed implementation is much more efficient than PCF-EV’s.
AB - Problems such as cold startup, accuracy, and scalability are faced by traditional collaborative filtering recommendation algorithm if the system is expanded continuously. To resolve these issues, we propose a parallel collaborative filtering recommendation model on the basis of two-phase similarity (PCF-TPS) and weighted distance similarity measure (WDSM). In accordance with WDSM, the users’ similarity is calculated and their similarity matrix is obtained. At the same time, the items’ similarity is counted and its similarity matrix is got in line with Tanimoto Coefficient Similarity. For the users’ similarity matrix, their preferences are endowed with weights and in this way their new preferences matrix is received. In addition, the nearest neighbor item is found and a more accurate recommendation to the target user is given on the basis of the items’ similarity matrix and users’ new preferences matrix. Besides, in regard to the parallel computing framework, the parallel implementation of the model is completed. All these experiments are done on MovieLens dataset. The results show that PCF-TPS solves the problem of cold startup and increases the accuracy concerning CF. Compared with PCF-EV, PCF-TPS’s parallel realization can be improved to nearly 125 times on the whole. That is to say, it will be more meaningful to complex model using GPU than a small model. What’s more, PCF-EV’s distributed implementation is much more efficient than PCF-EV’s.
KW - Collaborative filtering
KW - GPU
KW - Recommend mechanism
KW - Two-phase similarity
UR - http://www.scopus.com/inward/record.url?scp=84943608591&partnerID=8YFLogxK
U2 - 10.1007/978-3-319-22180-9_1
DO - 10.1007/978-3-319-22180-9_1
M3 - Conference contribution
AN - SCOPUS:84943608591
SN - 9783319221793
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
BT - Intelligent Computing Theories and Methodologies - 11th International Conference, ICIC 2015, Proceedings
A2 - Bevilacqua, Vitoantonio
A2 - Huang, De-Shuang
A2 - Premaratne, Prashan
PB - Springer Verlag
T2 - 11th International Conference on Intelligent Computing, ICIC 2015
Y2 - 20 August 2015 through 23 August 2015
ER -