Relational learning via collective matrix factorization

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2008, Pages 650-658

  Singh, Ajit P ^a   Gordon, Geoffrey J ^a  

^a Carnegie Mellon University   (United States)

Author keywords

Algorithms; Experimentation; Theory

Indexed keywords

ALTERNATING PROJECTION ALGORITHMS; BREG-MAN DIVERGENCES; ERROR DISTRIBUTIONS; ERROR MODELS; EXPERIMENTATION; LARGE-SCALE OPTIMIZATIONS; LOW-RANK MATRICES; MATRIX FACTORIZATIONS; MATRIXES; MEASURE ERRORS; MOVIE RATINGS; MULTIPLE MATRICES; NON-LINEAR RELATIONSHIPS; PREDICTION TECHNIQUES; PREDICTIVE ACCURACIES; RELATIONAL LEARNING; RELATIONAL SCHEMATA; SPARSE MATRICES; STOCHASTIC OPTIMIZATION METHODS; THEORY; UNKNOWN VALUES;

ALGORITHMS; EDUCATION; FACTORIZATION; INFORMATION MANAGEMENT; LIGHT MEASUREMENT; MINING; MOTION PICTURES;

MATRIX ALGEBRA;

EID: 65449121541     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1401890.1401969     Document Type: Conference Paper

References (37)

1. D. Agarwal and S. Merugu. Predictive discrete latent factor models for large scale dyadic data. In KDD, pages 26-35, 2007.
2. D. J. Aldous. Representations for partially exchangeable arrays of random variables. J. Multi. Anal., 11(4):581-598, 1981.
3. D. J. Aldous. Exchangeability and related topics, chapter 1. Springer, 1985.
4. K. S. Azoury and M. Warmuth. Relative loss bounds for on-line density estimation with the exponential family of distributions. Mach. Learn., 43:211-246, 2001.
5. A. Banerjee, S. Basu, and S. Merugu. Multi-way clustering on relation graphs. In SDM. SIAM, 2007.
6. A. Banerjee, S. Merugu, I. S. Dhillon, and J. Ghosh. Clustering with Bregman divergences. J. Mach. Learn. Res., 6:1705-1749, 2005.
7. L. Bottou. Online algorithms and stochastic approximations. In Online Learning and Neural Networks. Cambridge UP, 1998.
8. L. Bottou and Y. LeCun. Large scale online learning. In NIPS, 2003.
9. S. Boyd and L. Vandenberghe. Convex Optimization. Cambridge UP, 2004.
10. L. Bregman. The relaxation method of finding the common points of convex sets and its application to the solution of problems in convex programming. USSR Comp. Math and Math. Phys., 7:200-217, 1967.
11. Y. Censor and S. A. Zenios. Parallel Optimization: Theory, Algorithms, and Applications. Oxford UP, 1997.
12. P. P. Chen. The entity-relationship model: Toward a unified view of data. ACM Trans. Data. Sys., 1(1):9-36, 1976.
13. D. Cohn and T. Hofmann. The missing link-a probabilistic model of document content and hypertext connectivity. In NIPS, 2000.
14. M. Collins, S. Dasgupta, and R. E. Schapire. A generalization of principal component analysis to the exponential family. In NIPS, 2001.
15. J. Forster and M. K. Warmuth. Relative expected instantaneous loss bounds. In COLT, pages 90-99, 2000.
16. G. H. Golub and C. F. V. Loan. Matrix Computions. John Hopkins UP, 3rd edition, 1996.
17. 2 models. In NIPS, 2002.
18. D. Harman. Overview of the 2nd text retrieval conference (TREC-2). Inf. Process. Manag., 31(3):271-289, 1995.
19. T. Hofmann. Probabilistic latent semantic indexing. In SIGIR, pages 50-57, 1999.
20. Internet Movie Database Inc. IMDB interfaces. http://www.imdb.com/ interfaces, Jan. 2007.
21. D. D. Lee and H. S. Seung. Algorithms for non-negative matrix factorization. In NIPS, 2001.
22. J. D. Leeuw. Block relaxation algorithms in statistics, 1994.
23. B. Long, Z. M. Zhang, X. Wu;, and P. S. Yu. Spectral clustering for multi-type relational data. In ICML, pages 585-592, 2006.
24. B. Long, Z. M. Zhang, X. Wu, and P. S. Yu. Relational clustering by symmetric convex coding. In ICML, pages 569-576, 2007.
25. B. Long, Z. M. Zhang, and P. S. Yu. A probabilistic framework for relational clustering. In KDD, pages 470-479, 2007.
26. P. McCullagh and J. Nelder. Generalized Linear Models. Chapman and Hall: London., 1989.
27. Netflix. Netflix prize dataset. http://www.netflixprize.com, Jan. 2007.
28. J. Nocedal and S. J. Wright. Numerical Optimization. Springer, 1999.
29. F. Pereira and G. Gordon. The support vector decomposition machine. In ICML, pages 689-696, 2006.
30. J. D. M. Rennie and N. Srebro. Fast maximum margin matrix factorization for collaborative prediction. In ICML, pages 713-719, 2005.
31. A. P. Singh and G. J. Gordon. Relational learning via collective matrix factorization. Technical Report CMU-ML-08-109, Machine Learning Department, Carnegie Mellon University, 2008.
32. N. Srebro and T. Jaakola. Weighted low-rank approximations. In ICML, 2003.
33. N. Srebro, J. D. Rennie, and T. S. Jaakkola. Maximum-margin matrix factorization. In NIPS, 2004.
34. P. Stoica and Y. Selen. Cyclic minimizers, majorization techniques, and the expectation-maximization algorithm: a refresher. Sig. Process. Mag., IEEE, 21(1):112-114, 2004.
35. K. Yu, S. Yu, and V. Tresp. Multi-label informed latent semantic indexing. In SIGIR, pages 258-265, 2005.
36. S. Yu, K. Yu, V. Tresp, H.-P. Kriegel, and M. Wu. Supervised probabilistic principal component analysis. In KDD, pages 464-473, 2006.
37. S. Zhu, K. Yu, Y. Chi, and Y. Gong. Combining content and link for classification using matrix factorization. In SIGIR, pages 487-494, 2007.