TY - JOUR
T1 - Semi-sparse algorithm based on multi-layer optimization for recommender system
AU - Guan, Hu
AU - Li, Huakang
AU - Xu, Cheng Zhong
AU - Guo, Minyi
N1 - Funding Information:
Acknowledgements We would like to thank the anonymous reviewers for their insightful comments on this paper. This work was supported in part by NSFC 61003012, 863 Program of China 2011AA01A202, and Program for Changjiang Scholars and Innovative Research Team in University (IRT1158, PCSIRT), China. The views expressed in this material are those of the authors and do not necessarily reflect the views of the sponsors.
PY - 2013/12
Y1 - 2013/12
N2 - Similarity among vectors is basic knowledge required to carry out recommendation and classification in recommender systems, which support personalized recommendation during online interactions. In this paper, we propose a Semi-sparse Algorithm based on Multi-layer Optimization to speed up the Pearson Correlation Coefficient, which is conventionally used in obtaining similarity among sparse vectors. In accelerating the batch of similarity-comparisons within one thread, the semi-sparse algorithm spares out over-reduplicated accesses and judgements on the selected sparse vector by making this vector dense locally. Moreover, a reduce-vector is proposed to restrict using locks on critical resources in the thread-pool, which is wrapped with Pthreads on a multi-core node to improve parallelism. Furthermore, among processes in our framework, a shared zip file is read to cut down messages within the Message Passing Interface package. Evaluation shows that the optimized multi-layer framework achieves a brilliant speedup on three benchmarks, Netflix, MovieLens and MovieLen1600.
AB - Similarity among vectors is basic knowledge required to carry out recommendation and classification in recommender systems, which support personalized recommendation during online interactions. In this paper, we propose a Semi-sparse Algorithm based on Multi-layer Optimization to speed up the Pearson Correlation Coefficient, which is conventionally used in obtaining similarity among sparse vectors. In accelerating the batch of similarity-comparisons within one thread, the semi-sparse algorithm spares out over-reduplicated accesses and judgements on the selected sparse vector by making this vector dense locally. Moreover, a reduce-vector is proposed to restrict using locks on critical resources in the thread-pool, which is wrapped with Pthreads on a multi-core node to improve parallelism. Furthermore, among processes in our framework, a shared zip file is read to cut down messages within the Message Passing Interface package. Evaluation shows that the optimized multi-layer framework achieves a brilliant speedup on three benchmarks, Netflix, MovieLens and MovieLen1600.
KW - Message passing interface
KW - Pearson correlation coefficient
KW - Reduce vector
KW - Semi-sparse algorithm
KW - Thread pool
UR - http://www.scopus.com/inward/record.url?scp=84887995767&partnerID=8YFLogxK
U2 - 10.1007/s11227-012-0830-6
DO - 10.1007/s11227-012-0830-6
M3 - Article
AN - SCOPUS:84887995767
SN - 0920-8542
VL - 66
SP - 1418
EP - 1437
JO - Journal of Supercomputing
JF - Journal of Supercomputing
IS - 3
ER -