Robust manifold nonnegative matrix factorization

ACM Transactions on Knowledge Discovery from Data

Volumn 8, Issue 3, 2014, Pages

  Huang, Jin ^a   Nie, Feiping ^a   Huang, Heng ^a   Ding, Chris ^a  

^a The University of Texas at Arlington   (United States)

Author keywords

Clustering; Manifold; Nonnegative matrix factorization (NMF); Robust NMF

Indexed keywords

LAGRANGE MULTIPLIERS;

AUGMENTED LAGRANGIAN METHODS; CLUSTERING; CLUSTERING TECHNIQUES; CONSTRAINED OPTIMI-ZATION PROBLEMS; EXPLORATORY DATA ANALYSIS; MANIFOLD; NONNEGATIVE MATRIX FACTORIZATION; ROBUST NMF;

CONSTRAINED OPTIMIZATION;

EID: 84903737038     PISSN: 15564681     EISSN: 1556472X     Source Type: Journal    
DOI: 10.1145/2601434     Document Type: Article

References (50)

1. M. Belkin and P. Niyogi. 2003. Laplacian eigenmaps for dimensionality reduction and data representation. Neural Computation 15, 6 (2003), 1373-1396. (Pubitemid 37049796)
2. M.W. Berry, M. Browne, A. N. Langville, V. P. Pauca, and R. J. Plemmons. 2006. Algorithms and applications for approximate nonnegative matrix gactorization. In Computational Statistics and Data Analysis. 155-173.
3. M.W. Berry, S. T. Dumais, and G.W. O'Brien. 1995. Using linear algebra for intelligent information retrieval. SIAM Review 37 (Dec. 1995), 575-595.
4. D. P. Bertsekas. 1982. Constrained optimization and Lagrange multiplier methods. Computer Science and Applied Mathematics 1 (1982).
5. D. P. Bertsekas. 2003. Nonlinear Programming. Athena Scientific.
6. D. P. Bertsekas. 1996. Constrained optimization and lagrange multiplier methods. Athena Scientific.
7. D. Cai, X. He, J. Han, and T. S. Huang. 2011. Graph regularized non-negative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 33, 8 (2011), 1548-1560.
8. 2,0-norm constraint. In International Joint Conference on Artificial Intelligence (IJCAI). 1240-1246.
9. O. Chapelle, B. Schölkopf, and A. Zien. 2006. Semi-Supervised Learning. MIT Press.
10. M. Cooper and J. Foote. 2000. Summarizing video using non-negative similarity matrix factorization. In Proceedings of IEEE Workshop on Multimedia Signal Processing. IEEE, 25-28.
11. L. S. Dhillon, R. W. Heath, T. Strohmer, and J. A. Tropp. 2008. Constructing packings in Grassmannian manifolds via alternating projections. Experimental Mathematics 17, 1 (2008), 9-35.
12. C. Ding, T. Li, and M. Jordan. 2010. Convex and semi-nonnegative matrix factorizations. IEEE Transactions on Pattern Analysis and Machine Intelligence 32, 1 (2010), 45-55.
13. P. Fogel, S. S. Young, D. M. Hawkins, and N. Ledirac. 2007. Inferential, robust non-negative matrix factorization analysis of microarray data. Bioinformatics 23, 1 (2007), 44-49. (Pubitemid 46017854)
14. P. W. Foltz and S. T. Dumais. 1992. Personalized information delivery: An analysis of information filtering methods. Commununications ACM 34, 12 (1992), 51-60.
15. A. Frank and A. Asuncion. UCI Machine Learning Repository. Technical Report.
16. D. Gabay and B. Mercier. 1976. A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Computers Mathematics with Applications 2, 1 (1976), 1416-1438.
17. Q. Gu and J. Zhou. 2009. Co-clustering on manifolds. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. ACM, 359-368.
18. A. B. Hamza and D. J. Brady. 2006. Reconstruction of reflectance spectra using robust nonnegative matrix factorization. IEEE Transactions on Signal Processing 54, 9 (2006), 3637-3642. (Pubitemid 46405401)
19. M. R. Hestenes. 1969. Multiplier and gradient methods. Journal of Optimization Theory and Applications 4 (1969), 303-320.
20. P. O. Hoyer. 2004. Non-negative matrix factorization with sparseness constraints. Journal ofMachine Learning Research 5 (2004), 1457-1469.
21. J. Huang, F. Nie, and H. Huang. 2013a. Robust discrete matrix completion. In Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI). 424-430.
22. J. Huang, F. Nie, H. Huang, Y. Lei, and C. Ding. 2013b. Social trust prediction using rank-k matrix recovery. In International Joint Conference on Artificial Intelligence (IJCAI). 2647-2653.
23. 1 norm factorization in the presence of outliers and missing data by alternative convex programming. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 592-599.
24. H. Kim and H. Park. 2007. Sparse non-negative matrix factorizations via alternating non-negativityconstrained least squares for microarray data analysis. Bioinformatics 23, 12 (2007), 1495-1502. (Pubitemid 47244474)
25. 2,1 norm. In Proceedings of the ACM International Conference on Information and Knowledge Management. ACM, 673-682.
26. D. D. Lee and H. S. Seung. 2001. Algorithms for non-negative matrix factorization. In Advances in Neural Information Processing Systems. MIT Press, 556-562.
27. Z. Lin, M. Chen, and Y. Ma. 2009. The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices. Technical Report. UIUC Technical Report UILU-ENG-09-2215.
28. U. Luxburg. 2007. A tutorial on spectral clustering. Statistics and Computing 17, 4 (2007), 395-416.
29. M. Lyons, S. Akamatsu, M. Kamachi, and J. Gyoba. 1998. Coding facial expressions with gabor wavelets. In 3rd IEEE International Conference on Automatic Face and Gesture Recognition.
30. A. M. Martinez and R. Benavente. 1998. The AR Face Database. CVC Technical Report 24.
31. A. M. Martinez, A. M. Martínez, and A. C. Kak. 2001. PCA versus LDA. IEEE Transactions on Pattern Analysis and Machine Intelligence 2, 23 (2001), 228-233. (Pubitemid 32254716)
32. A. Y. Ng, M. I. Jordan, and Y. Weiss. 2001. On spectrral clustering: Analysis and an algorithm. In Advances in Neural Information Processing Systems. 849-856.
33. F. Nie, H. Huang, and C. Ding. 2012a. Low-rank matrix recovery via efficient Schatten p-norm minimization. In Twenty-Sixth AAAI Conference on Artificial Intelligence (AAAI). 655-661.
34. F. Nie, H. Wang, X. Cai, H. Huang, and C. Ding. 2012b. Robust matrix completion via joint Schatten p-norm and lp-norm minimization. In IEEE International Conference on Data Mining (ICDM). 566-574.
35. P. Paatero and U. Tapper. 1994. Positive matrix factorization: A non-negative factor model with optimal utilization of error estimates of data values. Environmetrics 5, 2 (1994), 111-C126.
36. M. J. D. Powell. 1969. A Method for Nonlinear Constraints in Minimization Problems. In R. Fletcher, editor, Optimization. Academic Press, London and New York. 283-298 pages.
37. J. D. M. Rennie and N. Srebro. 2005. Fast maximum margin matrix factorization for collaborative prediction. In International Conference on Machine Learning. ACM, 713-719.
38. S. T. Roweis and L. K. Saul. 2000. Nonlinear dimensionality reduction by locally linear embedding. Science 290, 5500 (2000), 2323-2326. (Pubitemid 32041578)
39. G. Salton, A.Wong, and C. S. Yang. 1975. A vector space model for automatic indexing. Communication ACM 18, 11 (1975), 613-620.
40. F. Samaria and A. Harter. 1994. Parameterisation of a stochastic model for human face identification. In 2nd IEEE Workshop on Applications of Computer Vision. IEEE.
41. J. Shi and J. Malik. 2000. Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence 22, 8 (2000), 888-905.
42. T. Sim, S. Baker, and M. Bsat. 2002. The CMU pose, illumination, and expression database. IEEE Transactions on Pattern Analysis and Machine Intelligence 25, 12 (2002), 1615-1618.
43. H.Wang, H. Huang, and C. Ding. 2011a. Simultaneous clustering ofmulti-type relational data via symmetric nonnegative matrix tri-factorization. In ACM International Conference on Information and Knowledge Management (CIKM). 279-284.
44. H. Wang, H. Huang, C. Ding, and F. Nie. 2013. Predicting protein-protein interactions from multimodal biological data sources via nonnegative matrix tri-factorization. In International Conference on Research in Computational Molecular Biology (RECOMB). 302-313.
45. H. Wang, F. Nie, H. Huang, and C. Ding. 2011b. Nonnegative matrix tri-factorization based high-order co-clustering and its fast implementation. In IEEE International Conference on Data Mining (ICDM). 774-783.
46. J. Wright, A. Ganesh, S. Rao, Y. Peng, and Y. Ma. 2009a. Robust principal component analysis: Exact recovery of corrupted low-rank matrices by convex optimization. In Proceedings of Advances in Neural Information Processing Systems. 2080-2088.
47. J. Wright, Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma. 2009b. Robust face recognition via sparse representation. IEEE Transactions on Pattern Analysis and Machine Intelligence 31, 2 (2009), 210-227.
48. Y. Xu, W. Yin, Z. Wen, and Y. Zhang. 2011. An alternating direction algorithm for matrix completion with nonnegative factors. Matrix 1 (2011), 1-14.
49. X. Yu and J. Shi. 2003. Multiclass spectral clustering. In Proceedings of International Conference on Computer Vision. 313-319.
50. M. Yuan and Y. Lin. 2006. Model selection and estimation in regression with grouped variables. Journal of the Royal Statistical Society: Series B 68, 1 (2006), 49-67. (Pubitemid 43415335)