Non-negative tensor factorization with applications to statistics and computer vision

ICML 2005 - Proceedings of the 22nd International Conference on Machine Learning

Volumn , Issue , 2005, Pages 793-800

  Shashua, Amnon ^a   Hazan, Tamir ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER VISION; DATA REDUCTION; IMAGE CODING; LEARNING SYSTEMS; MATRIX ALGEBRA; PROBLEM SOLVING; STATISTICS;

NON-NEGATIVE MATRIX FACTORIZATION (NMF); POSITIVE-PRESERVING GRADIENT DESCENT ALGORITHM; SPARSE IMAGE CODING; TENSOR FACTORIZATION;

TENSORS;

EID: 31844432834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. Buntine, W., & Perttu, S. (2003). Is multinomial pea multi-faceted clustering or dimensionality reduction, Proc. 9th Int. Workshop on Artificial Intelligence. and Statistics (pp. 30-307).
2. Catral, M., Han, L., Neumann, M., & Plemmons, R. (2004). On reduced rank for symmetric nonnegative matrices. Linear Algebra and its Applicatoins, 393, 107-126.
3. Chu, M., Diele, F., Plemmons, R., & Ragni, S. (2004), Optimality, computation and interpretation of nonnegative matrix factorizations, SIAM Journal on Matrix Analysis.
4. Deerwester, A., Dumanis, S., Furnas, G., T.K., L., & Harshman, R. (1990). Indexing by latent semantic analysis. Journal of the American Society for Information Science, 41.
5. Dempster, A., Laird, N., & Rubin, D. (1977). Maximum likelihood from incomplete data via the em algorithm. Journal of the Royal Stat. Soc., series B, 39, 1-38.
6. Donoho, D., & Stodden, V. (2003). When does non-negative matrix factorization give a correct decomposition into parts. Proceedings of the conference on Neural Information Processing Systems (NIPS).
7. Harshman, R. (1970). Foundations of the parafac procedure: Models and conditions for an "explanatory" multi-modal factor analysis. UCLA Working Papers in Phonetics, 16.
8. Hofmann, T. (1999). Probabilistic latent semantic analysis. Proc. of Uncertainty in Artificial Intelligence, UAI'99. Stockholm.
9. Kofidis, E., & Regalia, P. (2002). On the best rank-1 approxiamtion of higher order supersymmetric tensors. Matrix Analysis and Applications, 23, 863-884.
10. Kruksal, J. (1977). Three way arrays: rank and uniqueness of trilinear de-composition, with application to arithmetic complexity and statistics, Linear Algebra and its Applications, 18, 95-138.
11. Lathauwer, L. D., Moor, B. D., & Vandewalle, J. (2000). A multilinear singular value decomposition. Matrix Analysis and Application, 21, 1253-1278.
12. Lee, D., & Seung, H. (1999). Learning the parts of objects by non-negative matrix factorization. Nature, 401, 788-791.
13. Paatero, P., & Tapper, U. (1994). Positive matrix factorization: a non-negative factor model with optimal utilization of error estimates of data values. Envirometrics, 5, 111-126.
14. Shashua, A. (1997). On photometric issues in 3D visual recognition from a single 2D image. International Journal of Computer Vision, 21, 99-122.
15. Shashua, A., & Levin, A. (2001). Linear image coding for regression and classification using the tensor-rank principle. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. Hawaii.
16. Sidlropoulos, N., & Bro, R. (2000). On the uniqueness of multilinear decomposition of n-way arrays, Journal of Chemometrics, 14, 229-239.
17. Tipping, M., & Bishop, C. (1999), Probabilistic principal component analysis. Journal of the Royal Statistical Society, Series B,21(3):611-622.
18. Ullman, S., & Basri, R. (1991). Recognition by linear combination of models. IEEE Transactions on Pattern Analysis and Machine Intelligence, 13, 992-1006.
19. Vasilescu, M., & Terzopoulos, D. (2002). Multilinear analysis of Image ensembles: Tensorfaces. Proceedings of the European Conference on Computer Vision (pp. 447-460).
20. Welling, M., & Weber, M. (2001). Positive tensor factorization. Pattern Recognition Letters, 22, 1255-1261.
21. Xianqian, L., & Sidiropoulos, N. (2001). Cramer-rao lower boubds for low-rank decomposition of multidimensional arrays. IEEE Transactions on Signal Processing, 49.
22. Zhang, T., & Golub, G. (2001). Rank-one approximation to high order tensors. Matrix Analysis and Applications, & 23, 534-550.