ACM Home Page
Please provide us with feedback. Feedback
Probabilistic polyadic factorization and its application to personalized recommendation
Full text PdfPdf (276 KB)
Source
Conference on Information and Knowledge Management archive
Proceeding of the 17th ACM conference on Information and knowledge management table of contents
Napa Valley, California, USA
SESSION: IR: recommender systems table of contents
Pages 941-950  
Year of Publication: 2008
ISBN:978-1-59593-991-3
Authors
Yun Chi  NEC Laboratories America, Cupertino, CA, USA
Shenghuo Zhu  NEC Laboratories America, Cupertino, CA, USA
Yihong Gong  NEC Laboratories America, Cupertino, CA, USA
Yi Zhang  University of California Santa Cruz, Santa Cruz, CA, USA
Sponsors
ACM: Association for Computing Machinery
SIGWEB: ACM Special Interest Group on Hypertext, Hypermedia, and Web
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 11,   Downloads (12 Months): 132,   Citation Count: 2
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1458082.1458206
What is a DOI?

ABSTRACT

Multiple-dimensional, i.e., polyadic, data exist in many applications, such as personalized recommendation and multiple-dimensional data summarization. Analyzing all the dimensions of polyadic data in a principled way is a challenging research problem. Most existing methods separately analyze the marginal relationships among pairwise dimensions and then combine the results afterwards. Motivated by the fact that various dimensions of polyadic data jointly affect each other, we propose a probabilistic polyadic factorization approach to directly model all the dimensions simultaneously in a unified framework. We then show the connection between the probabilistic polyadic factorization and a non-negative version of the Tucker tensor factorization. We provide detailed theoretical analysis of the new modeling framework, discuss implementation techniques for our models, and propose several extensions to the basic framework. We then apply the proposed models to the application of personalized recommendation. Extensive experiments on a social bookmarking dataset, Delicious, and a paper citation dataset, CiteSeer, demonstrate the effectiveness of the proposed models.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
J. Delgado and N. Ishii. Memory-based weighted majority prediction for recommender systems. In ACM SIGIR'99 Workshop on Recommender Systems, 1999.
 
3
C. Ding, X. He, and H. D. Simon. On the equivalence of nonnegative matrix factorization and spectral clustering. In SIAM SDM, 2005.
4
 
5
R. A. Harshman. Foundations of the parafac procedure: models and conditions for an "explanatory" multi-modal factor analysis. UCLA working papers in phonetics, 16, 1970.
 
6
 
7
8
 
9
D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, 2000.
10
 
11
M. Mørup, L. K. Hansen, and S. M. Arnfred. Algorithms for sparse non-negative TUCKER (also named HONMF). Technical report, Department of Informatics and Mathematical Modeling, Technical University of Denmark, 2007.
12
 
13
L. Si and R. Jin. A flexible mixture model for collaborative filtering. In Proceedings of the Twentieth International Conference on Machine Learning (ICML 2003), 2003.
 
14
L. R. Tucker. Some mathematical notes on three-mode factor analysis. Psychometrika, 31, 1966.
15
16


Collaborative Colleagues:
Yun Chi: colleagues
Shenghuo Zhu: colleagues
Yihong Gong: colleagues
Yi Zhang: colleagues