A Geometric Approach to Archetypal Analysis and Nonnegative Matrix Factorization

References

• Arora, S., Ge, R., Kannan, R., and Moitra, A. (2012), “Computing a Nonnegative Matrix Factorization—Provably,” in Proceedings of the 44th symposium on Theory of Computing, pp. 145–162.
   Google Scholar
• Ball, K. (1997), “An Elementary Introduction to Modern Convex Geometry,” Flavors of Geometry, 31, 1–58.
   Google Scholar
• Bittorf, V., Recht, B., Re, C., and Tropp, J. (2012), “Factoring Nonnegative Matrices With Linear Programs,” in Advances in Neural Information Processing Systems 25, pp. 1223–1231.
   Google Scholar
• Boardman, J. (1994), “Geometric Mixture Analysis of Imaging Spectrometry Data,” in Geoscience and Remote Sensing Symposium (IGARSS)’ 94 (Vol. 4), pp. 2369–2371.
   Google Scholar
• Chang, C.-I., and Plaza, A. (2006), “A Fast Iterative Algorithm for Implementation of Pixel Purity Index,” Geoscience and Remote Sensing Letters, IEEE, 3, 63–67.
   Web of Science ®Google Scholar
• Cutler, A., and Breiman, L. (1994), “Archetypal Analysis,” Technometrics, 36, 338–347.
   Web of Science ®Google Scholar
• Ding, W., Hossein Rohban, M., Ishwar, P., and Saligrama, V. (2013), “Topic Discovery through Data Dependent and Random Projections,” in Proceedings of The 30th International Conference on Machine Learning, pp. 1202–1210.
   Google Scholar
• Ding, W., Ishwar, P., and Saligrama, V. (2016), “A Provably Efficient Algorithm for Separable Topic Discovery,” in IEEE Journal of Selected Topics in Signal Processing, 10, 712–725.
   Google Scholar
• Donoho, D., and Stodden, V. (2003), “When does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?” in Advances in Neural Information Processing Systems, pp. 1141–1148.
   Google Scholar
• Elhamifar, E., Sapiro, G., and Vidal, R. (2012), “See all by Looking at a Few: Sparse Modeling for Finding Representative Objects,” in 2012 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), IEEE, pp. 1600–1607.
   Google Scholar
• Esser, E., Moller, M., Osher, S., Sapiro, G., and Xin, J. (2012), “A Convex Model for Nonnegative Matrix Factorization and Dimensionality Reduction on Physical Space,” IEEE Transactions on Image Processing, 21, 3239–3252.
   PubMed Web of Science ®Google Scholar
• Gillis, N. (2013), “Robustness Analysis of Hottopixx, a Linear Programming Model for Factoring Nonnegative Matrices,” SIAM Journal on Matrix Analysis and Applications, 34, 1189–1212.
   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.
   Google Scholar
• ——— (2014), “Fast and Robust Recursive Algorithms for Separable Nonnegative Matrix Factorization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, 36, 698–714.
   PubMed Web of Science ®Google Scholar
• Kim, J., Monteiro, R., and Park, H. (2012), “Group Sparsity in Nonnegative Matrix Factorization,” in SDM, SIAM, pp. 851–862.
   Google Scholar
• Kumar, A., Sindhwani, V., and Kambadur, P. (2013), “Fast Conical Hull Algorithms for Near-Separable Non-Negative Matrix Factorization,” in Proceedings of the 30th International Conference on Machine Learning, pp. 231–239.
   Google Scholar
• Lee, D., and Seung, H. (1999), “Learning the Parts of Objects by Non-Negative Matrix Factorization,” Nature, 401, 788–791.
   PubMed Web of Science ®Google Scholar
• Lee, D. D., and Seung, H. S. (2001), “Algorithms for Non-Negative Matrix Factorization,” in Advances in Neural Information Processing Systems, pp. 556–562.
   Google Scholar
• Li, S. (2011), “Concise Formulas for the Area and Volume of a Hyperspherical Cap,” Asian Journal of Mathematics and Statistics, 4, 66–70.
   Google Scholar
• Nascimento, J., and Bioucas Dias, J. (2005), “Vertex Component Analysis: A Fast Algorithm to Unmix Hyperspectral Data,” IEEE Transactions on Geoscience and Remote Sensing, 43, 898–910.
   Web of Science ®Google Scholar
• Obozinski, G., Wainwright, M. J., Jordan, M. I., et al. (2011), “Support Union Recovery in High-Dimensional Multivariate Regression,” The Annals of Statistics, 39, 1–47.
   Web of Science ®Google Scholar
• Vavasis, S. (2009), “On the Complexity of Nonnegative Matrix Factorization,” SIAM Journal on Optimization, 20, 1364–1377.
   Web of Science ®Google Scholar
• Yuan, M., and Lin, Y. (2006), “Model Selection and Estimation in Regression With Grouped Variables,” Journal of the Royal Statistical Society, Series B, 68, 49–67.
   Google Scholar
• Zhou, T., Bilmes, J. A., and Guestrin, C. (2014), “Divide-and-Conquer Learning by Anchoring a Conical Hull,” in Advances in Neural Information Processing Systems, pp. 1242–1250.
   Google Scholar