Fast nonnegative tensor factorization with an active-set-like method

High-Performance Scientific Computing: Algorithms and Applications

Volumn 9781447124375, Issue , 2012, Pages 311-326

  Kim, Jingu ^a   Park, Haesun ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA MINING; ITERATIVE METHODS; PROBLEM SOLVING; SIGNAL PROCESSING;

ACTIVE SETS; CANDECOMP/PARAFAC; CONSTRAINED LEAST SQUARES; LEAST SQUARE PROBLEMS; NON NEGATIVES; NON-NEGATIVITY; NONNEGATIVE TENSOR FACTORIZATIONS; PARAFAC DECOMPOSITION; PIVOTING METHODS; TEXT-MINING;

TENSORS;

EID: 84949178333     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1007/978-1-4471-2437-5_16     Document Type: Chapter

References (29)

1. Acar, E., Yener, B.: Unsupervised multiway data analysis: A literature survey. IEEE Trans. Knowl. Data Eng. 21(1), 6-20 (2009)
2. Bader, B.W., Berry, M.W., Browne, M.: Discussion tracking in Enron email using PARAFAC. In: Survey of Text Mining II: Clustering, Classification, and Retrieval, pp. 147-163. Springer, Berlin (2008)
3. Bertsekas, D.P.: Nonlinear Programming. Scientific, Athena (1999)
4. Bro, R., De Jong, S.: A fast non-negativity-constrained least squares algorithm. J. Chem. 11, 393-401 (1997)
5. 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), 283-319 (1970)
6. Carroll, J.D., Soete, G.D., Pruzansky, S.: Fitting of the latent class model via iteratively reweighted least squares CANDECOMP with nonnegativity constraints. In: Multiway data analysis, pp. 463-472. North-Holland, Amsterdam (1989). http://portal.acm.org/citation.cfm?id=120565.120614
7. Cichocki, A., Phan, A.H.: Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. E92-A(3), 708-721 (2009)
8. Cichocki, A., Zdunek, R., Amari, S.I.: Hierarchical ALS algorithms for nonnegative matrix and 3D tensor factorization. In: Lecture Notes in Computer Science, vol. 4666, pp. 169-176. Springer, Berlin (2007)
9. FitzGerald, D., Cranitch, M., Coyle, E.: Non-negative tensor factorisation for sound source separation. In: Proceedings of the Irish Signals and Systems Conference (2005)
10. Friedlander, M.P., Hatz, K.: Computing nonnegative tensor factorizations. Comput. Optim. Appl. 23(4), 631-647 (2008). doi:10.1080/10556780801996244
11. Harshman, R.A.: Foundations of the PARAFAC procedure: Models and conditions for an "explanatory" multi-modal factor analysis. In: UCLA Working Papers in Phonetics, vol. 16, pp. 1-84 (1970)
12. Júdice, J.J., Pires, F.M.: A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems. Comput. Oper. Res. 21(5), 587-596 (1994)
13. Kim, H., Park, H.: Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for micro-array data analysis. Bioinformatics 23(12), 1495-1502 (2007)
14. Kim, H., Park, H.: Nonnegative matrix factorization based on alternating nonnegativity constrained least squares and active set method. SIAM J. Matrix Anal. Appl. 30(2), 713-730 (2008). doi:10.1137/07069239X
15. Kim, H., Park, H., Eldén, L.: Non-negative tensor factorization based on alternating large-scale non-negativity-constrained least squares. In: Proceedings of IEEE 7th International Conference on Bioinformatics and Bioengineering (BIBE07), vol. 2, pp. 1147-1151 (2007)
16. Kim, J., Park, H.: Sparse nonnegative matrix factorization for clustering. Tech. rep., Georgia Institute of Technology Technical Report GT-CSE-08-01 (2008)
17. Kim, J., Park, H.: Toward faster nonnegative matrix factorization: A new algorithm and comparisons. In: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (ICDM), pp. 353-362 (2008)
18. Kim, J., Park, H.: Fast nonnegative matrix factorization: An active-set-like method and comparisons. SIAM J. Sci. Comput. 33, 3261 (2011)
19. Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Rev. 51(3), 455-500 (2009)
20. Lawson, C.L., Hanson, R.J.: Solving Least Squares Problems. Prentice Hall, New York (1974)
21. Lee, D.D., Seung, H.S.: Learning the parts of objects by non-negative matrix factorization. Nature 401(6755), 788-791 (1999)
22. Lee, D.D., Seung, H.S.: Algorithms for non-negative matrix factorization. In: Advances in Neural Information Processing Systems, vol. 13, pp. 556-562. MIT Press, Cambridge (2001)
23. Lim, L.H., Comon, P.: Nonnegative approximations of nonnegative tensors. J. Chem., 23(7-8), 432-441 (2009)
24. Paatero, P.: A weighted non-negative least squares algorithm for three-way PARAFAC factor analysis. Chemom. Intell. Lab. Syst. 38(2), 223-242 (1997)
25. Paatero, P.: The multilinear engine: A table-driven, least squares program for solving multilinear problems, including the n-way parallel factor analysis model. J. Comput. Graph. Stat. 8, 854-888 (1999)
26. Paatero, P., Tapper, U.: Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. EnvironMetrics 5(1), 111-126 (1994)
27. Shashua, A., Hazan, T.: Non-negative tensor factorization with applications to statistics and computer vision. In: ICML '05: Proceedings of the 22nd International Conference on Machine Learning, pp. 792-799. ACM, New York (2005). doi: http://doi.acm.org/10.1145/1102351.1102451
28. Van Benthem, M.H., Keenan, M.R.: Fast algorithm for the solution of large-scale nonnegativity-constrained least squares problems. J. Chem. 18, 441-450 (2004). doi:10.1002/cem.889
29. Welling, M., Weber, M.: Positive tensor factorization. Pattern Recognit. Lett. 22(12), 1255-1261 (2001). doi:10.1016/S0167-8655(01)00070-8