Probabilistic models for incomplete multi-dimensional arrays

Journal of Machine Learning Research

Volumn 5, Issue , 2009, Pages 89-96

  Chu, Wei ^a   Ghahramani, Zoubin ^b  

^a YAHOO RESEARCH   (United States)

^b UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

ARRAY DIMENSIONS; CLASSICAL MODEL; COLLABORATIVE FILTERING; CORE TENSOR; DATA SETS; MULTIDIMENSIONAL ARRAYS; MULTIPLE SET; MULTIWAY ARRAYS; PROBABILISTIC FRAMEWORK; PROBABILISTIC MODELS;

AMINO ACIDS; BENCHMARKING;

ARTIFICIAL INTELLIGENCE;

EID: 84862293016     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (32)

1. Acar, E., & Yener, B. (2007). Unsupervised multiway data analysis: A literature survey Technical Report 07-06). RPI-Computer Science.
2. Andersson, C. A., & Bro, R. (2000). The N-way toolbox for MATLAB. Chemom. Intell. Lab. Syst., 52, 1-4.
3. Bonilla, E. V., Chai, K. M. A., & Williams, C. K. I. (2008). Multi-task Gaussian process prediction. Advances in Neural Information Processing Systems 20.
4. Bro, R. (1998). Multi-way analysis in the food industry: Models, algorithms, and applications. Ph.D. Thesis, University of Amsterdam and Royal Veterinary and Agricultural University, Denmark.
5. Carroll, J. D., & Chang, J. (1970). Analysis of individual differences in multidimensional scaling via an nway generalization of "eckart-young" decomposition. Psychometrika, 35, 218-319.
6. Coppi, R., & Bolasco, S. (Eds.). (1989). Multiway data analysis. Amsterdam, The Netherlands, The Netherlands: North-Holland Publishing Co.
7. Costantini, R., Sbaiz, L., & Süsstrunk, S. (2008). Higher order svd analysis for dynamic texture synthesis. IEEE Transactions on Image Processing, 17, 42-52.
8. Gupta, A. K., & Nagar, D. K. (2000). Matrix variate distributions. Chapman&Hall/CRC.
9. Harshman, R. A. (1972). Parafac2: Mathematical and technical notes. UCLA working papers in phonetics, 22, 30-44.
10. Kim, Y.-D., & Choi, S. (2007). Nonnegative tucker decomposition. Proc. of IEEE Conference on Computer Vision and Pattern Recognition (pp. 1-8).
11. Lathauwer, L., Moor, M., & Vandewalle, J. (2000). A multilinear singular value decomposition. SIAM J. Matrix Anal. Appl., 43, 1253-1278.
12. Lawrence, N. (2005). Gaussian process latent variable models. Journal of Machine Learning Research, 6, 1783-1816.
13. Meeds, E., Ghahramani, Z., Neal, R. M., & Roweis, S. T. (2007). Modeling dyadic data with binary latent factors. Advances in Neural Information Processing Systems 19 (pp. 977-984).
14. Missaoui, R., Goutte, C., Choupo, A. K., & Boujenoui, A. (2007). A probabilistic model for data cube compression and query approximation. Proc. of the 10th ACM International Workshop on Data Warehousing and OLAP (pp. 33-40).
15. Omberg, L., Golub, G. H., & Alter, O. (2007). A tensor higher-order singular value decomposition for integrative analysis of dna microarray data from different studies. PNAS, 104, 18371-18376.
16. Porteous, I., Bart, E., & Welling, M. (2008). Multi-HDP a non parametric bayesian model for tensor factorization. Proc. of the 23rd AAAI Conference on Artificial Intelligence (pp. 1487-1490).
17. Rosipal, R., & Girolami, M. (2001). An expectationmaximization approach to nonlinear component analysis. Neural Computation, 13, 505-510.
18. Roweis, S. T., & Ghahramani, Z. (1999). A unified review if linear gaussian models. Neural Computation, 11, 305-345.
19. Salakhutdinov, R., & Mnih, A. (2008). Probabilistic matrix factorization. Advances in Neural Information Processing Systems 20.
20. Salakhutdinov, R., Mnih, A., & Hinton, G. E. (2007). Restricted boltzmann machines for collaborative filtering. Proc. of International Conference on Machine Learning.
21. Schölkopf, B., Smola, A., & Müller, K.-R. (1998). Nonlinear component analysis as a kernel eigenvalue problem. Neural Computation, 10, 1299-1319.
22. Shashua, A., & Hazan, T. (2005). Non-negative tenosr factorization with applications to statistics and computer vision. Proc. of International Conference on Machine Learning.
23. Srebro, N., & Jaakkola, T. (2003). Weighted low-rank approximations. Proc. of International Conference on Machine Learning.
24. Sun, J., Tao, D., & Faloutsos, C. (2006). Beyond streams and graphs: Dynamic tensor analysis. Proc. of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining.
25. Sun, J. T., Zeng, H. J., Liu, H., Lu, Y., & Chen, Z. (2005). Cubesvd: A novel approach to personalized web search. Proc. of International World Wide Web Conference.
26. Tenenbaum, J. B., & Freeman, W. T. (2000). Separating style and content with bilinear models. Neural Computation, 12, 1247-1283.
27. Tipping, M. E. (2001). Sparse kernel principal component analysis. Advances in Neural Information Processing Systems 13.
28. Tipping, M. E., & Bishop, C. M. (1999). Probabilistic principal component analysis. Journal of the Royal Statisitical Scoiety, B, 611-622.
29. Tucker, L. R. (1966). Some mathematical notes on threemode factor analysis. Psychometrika, 31, 279-311.
30. Wang, H., & Ahuja, N. (2005). Efficient rank-r approximation of tensors: A new approach to compact representation of image ensembles and recognition. Proc. of IEEE International Conference on Computer Vision and Pattern Recognition.
31. Yu, K., & Chu, W. (2008). Gaussian process models for link analysis and transfer learning. Advances in Neural Information Processing Systems 20. MIT Press.
32. Zhang, T., & Golub, G. H. (2001). Rank-one approximation to high order tensors. SIAM J. Matrix Anal. Appl., 23, 534-550.