{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T17:50:06Z","timestamp":1772301006561,"version":"3.50.1"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,8,13]],"date-time":"2014-08-13T00:00:00Z","timestamp":1407888000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10994-014-5463-y","type":"journal-article","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T18:20:24Z","timestamp":1407867624000},"page":"205-226","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["SAGA: sparse and geometry-aware non-negative matrix factorization through non-linear local embedding"],"prefix":"10.1007","volume":"97","author":[{"given":"Nicolas","family":"Courty","sequence":"first","affiliation":[]},{"given":"Xing","family":"Gong","sequence":"additional","affiliation":[]},{"given":"Jimmy","family":"Vandel","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Burger","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,8,13]]},"reference":[{"key":"5463_CR1","doi-asserted-by":"crossref","unstructured":"Arora, S., Ge, R., Kannan, R., & Moitra, A. (2012) Computing a nonnegative matrix factorization-provably. In: Proceedings of the 44th Symposium on Theory of Computing (pp. 145\u2013162). ACM.","DOI":"10.1145\/2213977.2213994"},{"key":"5463_CR2","unstructured":"Bache, K., & Lichman, M. (2013). UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml . Accessed 27 Dec 2013."},{"key":"5463_CR3","unstructured":"Bandeira, A., Fickus, M., Mixon, D., & Wong, P. (2012). The road to deterministic matrices with the restricted isometry property. arXiv preprint arXiv:1202.1234 ."},{"issue":"2","key":"5463_CR4","doi-asserted-by":"crossref","first-page":"354","DOI":"10.1109\/JSTARS.2012.2194696","volume":"5","author":"JM Bioucas-Dias","year":"2012","unstructured":"Bioucas-Dias, J. M., Plaza, A., Dobigeon, N., Parente, M., Du, Q., Gader, P., et al. (2012). Hyperspectral unmixing overview: Geometrical, statistical, and sparse regression-based approaches. IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing, 5(2), 354\u2013379.","journal-title":"IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing"},{"key":"5463_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"SP Boyd","year":"2004","unstructured":"Boyd, S. P., & Vandenberghe, L. (2004). Convex optimization. New York: Cambridge University Press."},{"issue":"6","key":"5463_CR6","doi-asserted-by":"crossref","first-page":"1090","DOI":"10.1109\/TNN.2008.2000162","volume":"19","author":"I Buciu","year":"2008","unstructured":"Buciu, I., Nikolaidis, N., & Pitas, I. (2008). Nonnegative matrix factorization in polynomial feature space. IEEE Transactions on Neural Networks, 19(6), 1090\u20131100.","journal-title":"IEEE Transactions on Neural Networks"},{"issue":"8","key":"5463_CR7","doi-asserted-by":"crossref","first-page":"1548","DOI":"10.1109\/TPAMI.2010.231","volume":"33","author":"D Cai","year":"2011","unstructured":"Cai, D., He, X., Han, J., & Huang, T. (2011). Graph regularized nonnegative matrix factorization for data representation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 33(8), 1548\u20131560.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"9\u201310","key":"5463_CR8","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.crma.2008.03.014","volume":"346","author":"E Candes","year":"2008","unstructured":"Candes, E. (2008). The restricted isometry property and its implications for compressed sensing. Comptes Rendus Mathematique, 346(9\u201310), 589\u2013592.","journal-title":"Comptes Rendus Mathematique"},{"issue":"47\u201349","key":"5463_CR9","doi-asserted-by":"crossref","first-page":"4801","DOI":"10.1016\/j.tcs.2009.06.018","volume":"410","author":"A \u00c7ivril","year":"2009","unstructured":"\u00c7ivril, A., & Magdon-Ismail, M. (2009). On selecting a maximum volume sub-matrix of a matrix and related problems. Theoretical Computer Science, 410(47\u201349), 4801\u20134811.","journal-title":"Theoretical Computer Science"},{"key":"5463_CR10","doi-asserted-by":"crossref","unstructured":"Courty, N., & Burger, T. (2013). A kernel view on manifold sub-sampling based on karcher variance optimization. In: Geometric Science of Information (pp. 751\u2013758). Berlin: Springer.","DOI":"10.1007\/978-3-642-40020-9_84"},{"key":"5463_CR11","doi-asserted-by":"crossref","unstructured":"Courty, N., Burger, T., & Johann, L. (2011). PerTurbo: A new classification algorithm based on the spectrum perturbations of the laplace-beltrami operator. In: Proceedings of ECML\/PKDD (vol. 1, pp. 359\u2013374). Berlin: Springer","DOI":"10.1007\/978-3-642-23780-5_33"},{"issue":"4","key":"5463_CR12","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1080\/00401706.1994.10485840","volume":"36","author":"A Cutler","year":"1994","unstructured":"Cutler, A., & Breiman, L. (1994). Archetypal analysis. Technometrics, 36(4), 338\u2013347.","journal-title":"Technometrics"},{"issue":"1","key":"5463_CR13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/TPAMI.2008.277","volume":"32","author":"C Ding","year":"2010","unstructured":"Ding, C., Li, T., & Jordan, M. (2010). Convex and semi-nonnegative matrix factorizations. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(1), 45\u201355.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5463_CR14","unstructured":"Donoho, D. L., & Stodden, V. C. (2003). When does non-negative matrix factorization give a correct decomposition into parts? In: NIPS."},{"issue":"7","key":"5463_CR15","doi-asserted-by":"crossref","first-page":"3239","DOI":"10.1109\/TIP.2012.2190081","volume":"21","author":"E Esser","year":"2012","unstructured":"Esser, E., Moller, M., Osher, S., Sapiro, G., & Xin, J. (2012). A convex model for nonnegative matrix factorization and dimensionality reduction on physical space. IEEE Transactions on Image Processing, 21(7), 3239\u20133252.","journal-title":"IEEE Transactions on Image Processing"},{"key":"5463_CR16","doi-asserted-by":"crossref","unstructured":"Garg, R., & Khandekar, R. (2009). Gradient descent with sparsification: An iterative algorithm for sparse recovery with restricted isometry property. In: ICML (pp. 337\u2013344).","DOI":"10.1145\/1553374.1553417"},{"key":"5463_CR17","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, B. (1999). Fast and robust smallest enclosing balls. In: Proceedings of the 7th Annual European Symposium on Algorithms, ESA \u201999 (pp. 325\u2013338).","DOI":"10.1007\/3-540-48481-7_29"},{"key":"5463_CR18","first-page":"3349","volume":"13","author":"N Gillis","year":"2012","unstructured":"Gillis, N. (2012). Sparse and unique nonnegative matrix factorization through data preprocessing. JMLR, 13, 3349\u20133386.","journal-title":"JMLR"},{"key":"5463_CR19","doi-asserted-by":"crossref","unstructured":"Gillis, N., & Vavasis, S. (2013). Fast and robust recursive algorithms for separable nonnegative matrix factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence. doi: 10.1109\/TPAMI.2013.226 .","DOI":"10.1109\/TPAMI.2013.226"},{"key":"5463_CR20","doi-asserted-by":"crossref","unstructured":"Guillemot, C., & Turkan, M. (2012). Neighbor embedding with non-negative matrix factorization for image prediction. In: IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2012 (pp. 785\u2013788).","DOI":"10.1109\/ICASSP.2012.6288001"},{"key":"5463_CR21","unstructured":"Hoyer, P. O. (2004). Non-negative matrix factorization with sparseness constraints. JMLR, 5, 1457\u20131469."},{"key":"5463_CR22","unstructured":"Kersting, K., Xu, Z., Wahabzada, M., Bauckhage, C., Thurau, C., Roemer, C., Ballvora, A., Rascher, U., Leon, J., & Pluemer, L. (2012). Pre-symptomatic prediction of plant drought stress using dirichlet-aggregation regression on hyperspectral images. AAAI Computational Sustainability and AI Track."},{"issue":"12","key":"5463_CR23","doi-asserted-by":"crossref","first-page":"1495","DOI":"10.1093\/bioinformatics\/btm134","volume":"23","author":"H Kim","year":"2007","unstructured":"Kim, H., & Park, H. (2007). Sparse non-negative matrix factorizations via alternating non-negativity-constrained least squares for microarray data analysis. Bioinformatics, 23(12), 1495\u20131502.","journal-title":"Bioinformatics"},{"key":"5463_CR24","unstructured":"Kumar, A., Sindhwani, V., & Kambadur, P. (2013). Fast conical hull algorithms for near-separable non-negative matrix factorization. In: ICML (pp. 231\u2013239)."},{"key":"5463_CR25","unstructured":"Kyrillidis, A., Becker, S., & Cevher, V. (2013). Sparse projections onto the simplex. JMLR W&CP: Proceedings of The 30th International Conference on Machine Learning (ICML 2013) (vol.28, 235\u2013243)."},{"key":"5463_CR26","first-page":"129","volume":"6","author":"JD Lafferty","year":"2005","unstructured":"Lafferty, J. D., & Lebanon, G. (2005). Diffusion kernels on statistical manifolds. Journal of Machine Learning Research, 6, 129\u2013163.","journal-title":"Journal of Machine Learning Research"},{"issue":"9","key":"5463_CR27","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1109\/TPAMI.2006.184","volume":"28","author":"S Lafon","year":"2006","unstructured":"Lafon, S., & Lee, A. (2006). Diffusion maps and coarse-graining: A unified framework for dimensionality reduction, graph partitioning, and data set parameterization. PAMI, 28(9), 1393\u20131403.","journal-title":"PAMI"},{"issue":"11","key":"5463_CR28","doi-asserted-by":"crossref","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998). Gradient-based learning applied to document recognition. Proceedings of the IEEE, 86(11), 2278\u20132324.","journal-title":"Proceedings of the IEEE"},{"key":"5463_CR29","doi-asserted-by":"crossref","unstructured":"Li, Y., & Ngom, A. (2012). A new kernel non-negative matrix factorization and its application in microarray data analysis. In: IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology 2012 (CIBCB) (pp. 371\u2013378). IEEE.","DOI":"10.1109\/CIBCB.2012.6217254"},{"issue":"4","key":"5463_CR30","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6377(89)90064-3","volume":"8","author":"N Maculan","year":"1989","unstructured":"Maculan, N., & de Paula, G. (1989). A linear-time median-finding algorithm for projecting a vector on the simplex of rn. Operations Research Letters, 8(4), 219\u2013222.","journal-title":"Operations Research Letters"},{"key":"5463_CR31","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.neucom.2011.06.033","volume":"80","author":"M M\u00f8rup","year":"2012","unstructured":"M\u00f8rup, M., & Hansen, L. (2012). Archetypal analysis for machine learning and data mining. Neurocomputing, 80, 54\u201363.","journal-title":"Neurocomputing"},{"key":"5463_CR32","unstructured":"Nene, S., Nayar, S., & Murase, H. (1996). Columbia object image library (coil-20). New York: Department of Computer Science, Columbia University."},{"key":"5463_CR33","doi-asserted-by":"crossref","unstructured":"\u00d6ztireli, C., Alexa, M., & Gross, M. (2010). Spectral sampling of manifolds. In: SIGGRAPH ASIA.","DOI":"10.1145\/1882262.1866190"},{"key":"5463_CR34","unstructured":"Recht, B., Re, C., Tropp, J., & Bittorf, V. (2012). Factoring nonnegative matrices with linear programs. In: NIPS (pp. 1223\u20131231)."},{"key":"5463_CR35","volume-title":"Learning with kernels: Support vector machines, regularization, optimization, and beyond","author":"B Sch\u00f6lkopf","year":"2002","unstructured":"Sch\u00f6lkopf, B., & Smola, A. (2002). Learning with kernels: Support vector machines, regularization, optimization, and beyond. Cambridge: The MIT Press."},{"key":"5463_CR36","unstructured":"Shroff, N., Turaga, P., & Chellappa, R. (2011). Manifold precis: An annealing technique for diverse sampling of manifolds. In: NIPS (pp. 154\u2013162)."},{"key":"5463_CR37","doi-asserted-by":"crossref","unstructured":"Sim, T., Baker, S., & Bsat, M. (2002). The cmu pose, illumination, and expression (pie) database. In: Proceedings of Fifth IEEE International Conference on Automatic Face and Gesture Recognition, 2002 (pp. 46\u201351). IEEE.","DOI":"10.1109\/AFGR.2002.1004130"},{"key":"5463_CR38","doi-asserted-by":"crossref","unstructured":"Thurau, C., Kersting, K., & Bauckhage, C. (2010). Yes we can: Simplex volume maximization for descriptive web-scale matrix factorization. In: CIKM (pp. 1785\u20131788).","DOI":"10.1145\/1871437.1871729"},{"issue":"2","key":"5463_CR39","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10618-011-0216-z","volume":"24","author":"C Thurau","year":"2012","unstructured":"Thurau, C., Kersting, K., Wahabzada, M., & Bauckhage, C. (2012). Descriptive matrix factorization for sustainability adopting the principle of opposites. Data Mining and Knowledge Discovery, 24(2), 325\u2013354.","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"4","key":"5463_CR40","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/s11222-007-9033-z","volume":"17","author":"U Luxburg Von","year":"2007","unstructured":"Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395\u2013416.","journal-title":"Statistics and Computing"},{"issue":"5","key":"5463_CR41","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1109\/TPAMI.2009.72","volume":"32","author":"FY Wang","year":"2010","unstructured":"Wang, F. Y., Chi, C. Y., Chan, T. H., & Wang, Y. (2010). Nonnegative least-correlated component analysis for separation of dependent sources by volume maximization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 32(5), 875\u2013888.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5463_CR42","unstructured":"Yu, K., Zhang, T., & Gong, Y. (2009). Nonlinear learning using local coordinate coding. In: NIPS (pp. 2223\u20132231)."},{"key":"5463_CR43","doi-asserted-by":"crossref","unstructured":"Zhang, D., Zhou, Z., & Chen, S. (2006). Non-negative matrix factorization on kernels. In: PRICAI 2006: Trends in Artificial Intelligence (pp. 404\u2013412). New York: Springer.","DOI":"10.1007\/978-3-540-36668-3_44"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5463-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-014-5463-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5463-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:40:39Z","timestamp":1559353239000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-014-5463-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,13]]},"references-count":43,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["5463"],"URL":"https:\/\/doi.org\/10.1007\/s10994-014-5463-y","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,13]]}}}