Context-aware recommendation using GPU based parallel tensor decomposition

被引：3

作者：

Zou, Benyou ^{[1
,2
]}

Lan, Mengwei ^{[1
,2
]}

Li, Cuiping ^{[1
,2
]}

Tan, Liwen ^{[1
,2
]}

Chen, Hong ^{[1
,2
]}

机构：

[1] Key Lab of Data Engineering and Knowledge Engineering of MOE, Renmin University of China, Beijing

[2] School of Information, Renmin University of China, Beijing

来源：

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | 2014年 / 8933卷

关键词：

Collaborative filtering; GPU; Recommendation algorithm; Tensor;

D O I：

10.1007/978-3-319-14717-8_17

中图分类号：

学科分类号：

摘要：

Recommender system plays an important role in many practical applications that help users to deal with information overload and provide personalized recommendations to them. The context in which a choice is made has been recognized as an important factor for recommendation systems. Recently, researchers extend the classical matrix factorization and allows for a generic integration of contextual information by modeling the data as a tensor. However, current tensor factorization methods suffer from the limitation that the computing cost can be very high in practice. In this paper, we propose GALS, a GPU based parallel tensor factorization algorithm, to accelerate the tensor factorization on large data sets to support the efficient context-aware recommendation. Experiments show that the proposed method can achieve 10 times faster than the current tensor factorization methods. © Springer International Publishing Switzerland 2014.

引用

页码：213 / 226

页数：13

共 17 条

[1]

Agrawal R., Imieliski T., Swami A.N., Mining association rules between sets of items in large databases, Sigmod Record, 22, pp. 207-216, (1993)

[2]

Buluc A., Gilbert J.R., Challenges and advances in parallel sparse matrix-matrix multiplication, ICPP 2008: Proceedings of the 2008 37th International Conference on Parallel Processing, pp. 503-510, (2008)

[3]

Carroll J.D., Chang J.-J., Analysis of individual differences in multidimensional scaling via an n-way generalization of eckart-young decomposition, Psychometrika, 35, 3, pp. 283-319, (1970)

[4]

Chew P.A., Bader B.W., Kolda T.G., Abdelali A., Cross-language information retrieval using PARAFAC2, Knowledge Discovery and Data Mining, pp. 143-152, (2007)

[5]

Ding S., He J., Yan H., Suel T., Using graphics processors for high performance ir query processing, WWW 2009: Proceedings of the 18th International Conference on World Wide Web, pp. 421-430, (2009)

[6]

Garcia V., Debreuve E., Barlaud M., Fast k nearest neighbor search using gpu, 2008 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, pp. 1-6, (2008)

[7]

Harshman R.A., Foundations of the PARAFAC procedure: Model and conditions for an “explanatory” multi-mode factor analysis, UCLA Working Papers in Phonetics, 16, pp. 1-84, (1970)

[8]

He B., Yang K., Fang R., Lu M., Govindaraju N.K., Luo Q., Sander P.V., Relational joins on graphics processors, SIGMOD 2008: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 511-524, (2008)

[9]

Kapteyn A., Neudecker H., Wansbeek T., An approach to n -mode components analysis, Psychometrika, 51, pp. 269-275, (1986)

[10]

Karatzoglou A., Amatriain X., Baltrunas L., Oliver N., Multiverse recommendation: Ndimensional tensor factorization for context-aware collaborative filtering, Proceedings of the Fourth ACM Conference on Recommender Systems, RecSys 2010, pp. 79-86, (2010)

← 1 2 →