Nonnegative Matrix Factorization Via Archetypal Analysis

References

• Arora, S., Ge, R., Halpern, Y., Mimno, D. M., Moitra,A., Sontag, D., Wu, Y., Zhu, M. (2013), “A Practical Algorithm for Topic Modeling With Provable Guarantees,” ICML, 280–288. volume: 28 issue number: 2 publisher: PMLR
   Google Scholar
• Arora, S., Ge, R., Kannan, R., and Moitra, A. (2012), “Computing a Nonnegative Matrix Factorization–Provably,” in Proceedings of the Forty-Fourth Annual ACM Symposium on Theory of Computing, New York, NY: ACM, pp. 145–162.
   Google Scholar
• Araújo, M. C. U, Bezerra Saldanha, T. C., Harrop Galvao, R. K., Yoneyama, T., Chame, H. C., and Visani, V. (2001), “The Successive Projections Algorithm for Variable Selection in Spectroscopic Multicomponent Analysis,” Chemometrics and Intelligent Laboratory Systems, 57, 65–73. DOI: 10.1016/S0169-7439(01)00119-8.
   Web of Science ®Google Scholar
• Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., and Chanussot, J. (2012), “Hyperspectral Unmixing Overview: Geometrical, Statistical, and Sparse Regression-based Approaches,” IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 5, 354–379. DOI: 10.1109/JSTARS.2012.2194696.
   Web of Science ®Google Scholar
• Bolte, J., Sabach, S., and Teboulle, M. (2014), “Proximal Alternating Linearized Minimization for Nonconvex and Nonsmooth Problems,” Mathematical Programming, 146, 459–494. DOI: 10.1007/s10107-013-0701-9.
   Web of Science ®Google Scholar
• Cai, D., He, X., Han, J., and Huang, T. S. (2011), “Graph Regularized Nonnegative Matrix Factorization for Data Representation,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 33, 1548–1560.
   PubMed Web of Science ®Google Scholar
• Cichocki, A., Zdunek, R., Phan, A. H., and Amari, S-i. (2009), Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation, Hoboken, NJ: Wiley.
   Google Scholar
• Cutler, A., and Breiman, L. (1994), “Archetypal Analysis,” Technometrics, 36, 338–347. DOI: 10.1080/00401706.1994.10485840.
   Web of Science ®Google Scholar
• Del Buono, N., and Pio, G. (2015), “Non-negative Matrix Tri-factorization for Co-clustering: An Analysis of the Block Matrix,” Information Sciences, 301, 13–26. DOI: 10.1016/j.ins.2014.12.058.
   Web of Science ®Google Scholar
• Donoho, D. L., and Stodden, V. (2003), “When Does Non-negative Matrix Factorization Give a Correct Decomposition Into Parts?” Proceedings of the 16th International Conference of Neural Information Processing Systems Series: NIPS’03, 1141–1148, Cambridge, MA: MIT Press
   Google Scholar
• Frandi, E., Ñanculef, R., and Suykens, J. (2014), “Complexity Issues and Randomization Strategies in Frank-Wolfe Algorithms for Machine Learning,” arXiv preprint arXiv:1410.4062.
   Google Scholar
• Frank, M., and Wolfe, P. (1956), “An Algorithm for Quadratic Programming,” Naval Research Logistics, 3, 95–110. DOI: 10.1002/nav.3800030109.
   Google Scholar
• Ge, R., and Zou, J. (2015), “Intersecting Faces: Non-negative Matrix Factorization With New Guarantees,” Proceedings of the 32nd International Conference on Machine Learning (ICML-15), pp. 2295–2303.
   Google Scholar
• Gillis, N., and Kumar, A. (2015), “Exact and Heuristic Algorithms for Semi-nonnegative Matrix Factorization,” SIAM Journal on Matrix Analysis and Applications, 36, 1404–1424. DOI: 10.1137/140993272.
   Web of Science ®Google Scholar
• Gillis, N., and Vavasis, S. A. (2014), “Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 698–714. DOI: 10.1109/TPAMI.2013.226.
   PubMed Web of Science ®Google Scholar
• Gillis, N., and Vavasis, S. A. (2015), “Semidefinite Programming Based Preconditioning for More Robust Near-separable Nonnegative Matrix Factorization,” SIAM Journal on Optimization, 25, 677–698. DOI: 10.1137/130940670.
   Web of Science ®Google Scholar
• Jaggi, M. (2013), “Revisiting Frank-Wolfe: Projection-free Sparse Convex Optimization,” ICML, 427–435.
   Google Scholar
• Kim, D., Sra, S., and Dhillon, I. S. (2008), “Fast Projection-based Methods for the Least Squares Nonnegative Matrix Approximation Problem,” Statistical Analysis and Data Mining, 1, 38–51. DOI: 10.1002/sam.104.
   Google Scholar
• Kumar, A., Sindhwani, V., and Kambadur, P. (2013), “Fast Conical Hull Algorithms for Near-Separable Non-negative Matrix Factorization, International Conference on Machine Learning, pp. 231–239.
   Google Scholar
• Lin, C-J. (2007), “Projected Gradient Methods for Nonnegative Matrix Factorization,” Neural Computation, 19, 2756–2779. DOI: 10.1162/neco.2007.19.10.2756.
   PubMed Web of Science ®Google Scholar
• Linstrom, P.J., and Mallard, W.G. (eds.), Nist Chemistry Webbook, Nist Standard Reference Database Number 69. Gaithersburg, MD: National Institute of Standards and Technology. Available at http://webbook.nist.gov (retrieved January 5, 2017).
   Google Scholar
• Lee, D. D., and Seung, H. S. (1999), “Learning the Parts of Objects by Non-negative Matrix Factorization,” Nature, 401, 788–791. DOI: 10.1038/44565.
   PubMed Web of Science ®Google Scholar
• Lee, D. D., and Seung, H. S. (2001), “Algorithms for Non-negative Matrix Factorization,” Advances in Neural Information Processing Systems, 13, 556–562.
   Google Scholar
• Ma, W-K., Bioucas-Dias, J. M., Chan, T-H, Gillis, N., Gader, P., Plaza, A. J., Ambikapathi, A.M. and Chi, C.-Y. (2014), “A Signal Processing Perspective on Hyperspectral Unmixing: Insights From Remote Sensing,” IEEE Signal Processing Magazine, 31, 67–81. DOI: 10.1109/MSP.2013.2279731.
   Web of Science ®Google Scholar
• Long, B., Zhang, Z. M., and Yu, P. S. (2005), Co-clustering by Block Value Decomposition, in Proceedings of the Eleventh ACM SIGKDD International Conference on Knowledge Discovery in Data Mining, pp. 635–640. Chicago, IL: ACM
   Google Scholar
• Miao, L., and Qi, H. (2007), “Endmember Extraction From Highly Mixed Data Using Minimum Volume Constrained Nonnegative Matrix Factorization,” IEEE Transactions on Geoscience and Remote Sensing, 45, 765–777. DOI: 10.1109/TGRS.2006.888466.
   Web of Science ®Google Scholar
• Mørup, M., and Hansen, L. K. (2012), “Archetypal Analysis for Machine Learning and Data Mining,” Neurocomputing, 80, 54–63. DOI: 10.1016/j.neucom.2011.06.033.
   Web of Science ®Google Scholar
• Paatero, P. (1997), “Least Squares Formulation of Robust Non-negative Factor Analysis,” Chemometrics and Intelligent Laboratory Systems, 37, 23–35. DOI: 10.1016/S0169-7439(96)00044-5.
   Web of Science ®Google Scholar
• Paatero, P., and Tapper, U. (1994), Positive Matrix Factorization: A Non-negative Factor Model With Optimal Utilization of Error Estimates of Data Values, Environmetrics, 5, 111–126. DOI: 10.1002/env.3170050203.
   Web of Science ®Google Scholar
• Roux, J. L., Cheveigné, A. D., and Parra, L. C. (2009), “Adaptive Template Matching With Shift-invariant Semi-nmf,” Advances in Neural Information Processing Systems, 21, 921–928.
   Google Scholar
• Recht, B., Re, C., Tropp, J., and Bittorf, V. (2012), “Factoring Nonnegative Matrices With Linear Programs,” Advances in Neural Information Processing Systems, 25, 1214–1222.
   Google Scholar
• Wang, F., and Li, P. (2010), “Efficient Nonnegative Matrix Factorization With Random Projections,” in Proceedings of the 2010 SIAM International Conference on Data Mining, Columbus, OH: SIAM, pp. 281–292.
   Google Scholar
• Wang, H., Nie, F., Huang, H., and Makedon, F. (2011), “Fast Nonnegative Matrix Tri-factorization for Large-scale Data Co-clustering,” IJCAI Proceedings-International Joint Conference on Artificial Intelligence, vol. 22, p. 1553.
   Google Scholar
• Xu, W., Liu, X., and Gong, Y. (2003), “Document Clustering Based on Non-negative Matrix Factorization,” in Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Informaion Retrieval, pp. 267–273. Toronto, Canada: ACM.
   Google Scholar
• Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., and Pan, C. (2014b), “Spectral Unmixing Via Data-guided Sparsity,” IEEE Transactions on Image Processing, 23, 5412–5427. DOI: 10.1109/TIP.2014.2363423.
   PubMed Web of Science ®Google Scholar
• Zhu, F., Wang, Y., Fan, B., Meng, G., and Pan, C. (2014c), “Effective Spectral Unmixing Via Robust Representation and Learning-based Sparsity,” arXiv:1409.0685.
   Google Scholar
• Zhu, F., Wang, Y., Xiang, S., Fan, B., and Pan, C. (2014d), “Structured Sparse Method for Hyperspectral Unmixing,” ISPRS Journal of Photogrammetry and Remote Sensing, 88, 101–118. DOI: 10.1016/j.isprsjprs.2013.11.014.
   Web of Science ®Google Scholar
• Ziegler, G. M. (2012), Lectures on Polytopes, vol. 152, New York, NY: Springer Science & Business Media.
   Google Scholar