{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,28]],"date-time":"2023-08-28T04:27:16Z","timestamp":1693196836791},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T00:00:00Z","timestamp":1508976000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Japan Society for the Promotion of Science (JP)","award":["JSPS KAKENHI Grant Number 15K20986","JSPS KAKENHI Grant Number 26242027"],"award-info":[{"award-number":["JSPS KAKENHI Grant Number 15K20986","JSPS KAKENHI Grant Number 26242027"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2018,4]]},"DOI":"10.1007\/s10994-017-5673-1","type":"journal-article","created":{"date-parts":[[2017,10,26]],"date-time":"2017-10-26T19:30:48Z","timestamp":1509046248000},"page":"643-673","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations"],"prefix":"10.1007","volume":"107","author":[{"given":"Tomohiko","family":"Mizutani","sequence":"first","affiliation":[]},{"given":"Mirai","family":"Tanaka","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,10,26]]},"reference":[{"issue":"1","key":"5673_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1080\/10556780701589669","volume":"23","author":"SD Ahipasaoglu","year":"2008","unstructured":"Ahipasaoglu, S. D., Sun, P., & Todd, M. J. (2008). Linear convergence of a modified Frank\u2013Wolfe algorithm for computing minimum-volume enclosing ellipsoids. Optimization Methods and Software, 23(1), 5\u201319.","journal-title":"Optimization Methods and Software"},{"issue":"2","key":"5673_CR2","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0169-7439(01)00119-8","volume":"57","author":"UMC Ara\u00fajo","year":"2001","unstructured":"Ara\u00fajo, U. M. C., Saldanha, B. T. C., Galv\u00e3o, R. K. H., Yoneyama, T., Chame, H. C., & Visani, V. (2001). The successive projections algorithm for variable selection in spectroscopic multicomponent analysis. Chemometrics and Intelligent Laboratory Systems, 57(2), 65\u201373.","journal-title":"Chemometrics and Intelligent Laboratory Systems"},{"key":"5673_CR3","unstructured":"Arora, S., Ge, R., Halpern, Y., Mimno, D., & Moitra, A. (2013). A practical algorithm for topic modeling with provable guarantees. In Proceedings of the 30th international conference on machine learning (ICML)"},{"key":"5673_CR4","doi-asserted-by":"crossref","unstructured":"Arora, S., Ge, R., Kannan, R., & Moitra, A. (2012). Computing a nonnegative matrix factorization\u2014Provably. In Proceedings of the 44th symposium on theory of computing (STOC), pp. 145\u2013162.","DOI":"10.1145\/2213977.2213994"},{"key":"5673_CR5","doi-asserted-by":"crossref","unstructured":"Arora, S., Ge, R., & Moitra, A. (2012). Learning topic models\u2014Going beyond SVD. In Proceedings of the 53rd annual symposium on foundations of computer science (FOCS), pp. 1\u201310.","DOI":"10.1109\/FOCS.2012.49"},{"issue":"2","key":"5673_CR6","doi-asserted-by":"publisher","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":"5673_CR7","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1016\/j.laa.2012.04.038","volume":"437","author":"J-C Bourin","year":"2012","unstructured":"Bourin, J.-C., Lee, E.-Y., & Lin, M. (2012). On a decomposition lemma for positive semi-definite block-matrices. Linear Algebra and its Applications, 437, 1906\u20131912.","journal-title":"Linear Algebra and its Applications"},{"key":"5673_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"3","key":"5673_CR9","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01436084","volume":"7","author":"P Businger","year":"1965","unstructured":"Businger, P., & Golub, G. H. (1965). Linear least squares solutions by Householder transformations. Numerische Mathematik, 7(3), 269\u2013276.","journal-title":"Numerische Mathematik"},{"issue":"6","key":"5673_CR10","doi-asserted-by":"publisher","first-page":"925","DOI":"10.1109\/JPROC.2009.2035722","volume":"98","author":"E Cand\u00e8s","year":"2010","unstructured":"Cand\u00e8s, E., & Plan, Y. (2010). Matrix completion with noise. Proceedings of the IEEE, 98(6), 925\u2013936.","journal-title":"Proceedings of the IEEE"},{"key":"5673_CR11","doi-asserted-by":"publisher","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, 4801\u20134811.","journal-title":"Theoretical Computer Science"},{"key":"5673_CR12","unstructured":"Donoho, D., & Stodden, V. (2003). When does non-negative matrix factorization give a correct decomposition into parts? In Proceedings of advances in neural information processing systems 16 (NIPS), pp. 1141\u20131148."},{"issue":"3","key":"5673_CR13","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF02288367","volume":"1","author":"C Eckart","year":"1936","unstructured":"Eckart, C., & Young, G. (1936). The approximation of one matrix by another of lower rank. Psychometrika, 1(3), 211\u2013218.","journal-title":"Psychometrika"},{"issue":"2","key":"5673_CR14","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1137\/140994915","volume":"8","author":"N Gillis","year":"2015","unstructured":"Gillis, N., & Ma, W. K. (2015). Enhancing pure-pixel identification performance via preconditioning. SIAM Journal on Imaging Sciences, 8(2), 1161\u20131186.","journal-title":"SIAM Journal on Imaging Sciences"},{"issue":"4","key":"5673_CR15","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TPAMI.2013.226","volume":"36","author":"N Gillis","year":"2014","unstructured":"Gillis, N., & Vavasis, S. A. (2014). Fast and robust recursive algorithms for separable nonnegative matrix factorization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 36(4), 698\u2013714.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"issue":"1","key":"5673_CR16","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1137\/130940670","volume":"25","author":"N Gillis","year":"2015","unstructured":"Gillis, N., & Vavasis, S. A. (2015). Semidefinite programming based preconditioning for more robust near-separable nonnegative matrix factorization. SIAM Journal on Optimization, 25(1), 677\u2013698.","journal-title":"SIAM Journal on Optimization"},{"key":"5673_CR17","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix computation","author":"GH Golub","year":"2013","unstructured":"Golub, G. H., & Van Loan, C. F. (2013). Matrix computation (4th ed.). Baltimore: The Johns Hopkins University Press.","edition":"4"},{"issue":"3","key":"5673_CR18","doi-asserted-by":"publisher","first-page":"A1139","DOI":"10.1137\/130938700","volume":"37","author":"M Gu","year":"2015","unstructured":"Gu, M. (2015). Subspace iteration randomization and singular value problems. SIAM Journal on Scientific Computing, 37(3), A1139\u2013A1173.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5673_CR19","doi-asserted-by":"crossref","unstructured":"Gunasekar, S., Acharya, A., Gaur, N., & Ghosh, J. (2013). Noisy matrix completion using alternating minimization. In Proceedings of the European conference on machine learning and principles and practice of knowledge discovery in databases (ECML PKDD), pp. 194\u2013209.","DOI":"10.1007\/978-3-642-40991-2_13"},{"issue":"2","key":"5673_CR20","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P. G., & Tropp, J. A. (2011). Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decomposions. SIAM Review, 53(2), 217\u2013288.","journal-title":"SIAM Review"},{"key":"5673_CR21","first-page":"2057","volume":"11","author":"RH Keshavan","year":"2010","unstructured":"Keshavan, R. H., Montanari, A., & Oh, S. (2010). Matrix completion from noisy entrie. Journal of Machine Learning Research, 11, 2057\u20132078.","journal-title":"Journal of Machine Learning Research"},{"issue":"5","key":"5673_CR22","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1109\/TGRS.2013.2265322","volume":"52","author":"X Lu","year":"2014","unstructured":"Lu, X., Wu, H., & Yuan, Y. (2014). Double constrained NMF for hyperspectral unmixing. IEEE Transactions on Geoscience and Remote Sensing, 52(5), 2746\u20132758.","journal-title":"IEEE Transactions on Geoscience and Remote Sensing"},{"issue":"2","key":"5673_CR23","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MSP.2013.2279731","volume":"31","author":"W-K Ma","year":"2014","unstructured":"Ma, W.-K., Bioucas-Dias, J. M., Chan, T.-H., Gillis, N., Gader, P., Plaza, A. J., et al. (2014). A signal processing perspective on hyperspectral unmixing: Insights from remote sensing. IEEE Signal Processing Magazine, 31(2), 67\u201381.","journal-title":"IEEE Signal Processing Magazine"},{"key":"5673_CR24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809071","volume-title":"Introduction to information retrieval","author":"CD Manning","year":"2008","unstructured":"Manning, C. D., Raghavan, P., & Schuetze, H. (2008). Introduction to information retrieval. Cambridge: Cambridge University Press."},{"issue":"2","key":"5673_CR25","doi-asserted-by":"publisher","first-page":"13:1","DOI":"10.1145\/1921632.1921639","volume":"5","author":"A\u00a0K Menon","year":"2011","unstructured":"Menon, A\u00a0. K., & Elkan, C. (2011). Fast algorithms for approximating the singular value decomposition. ACM Transactions on Knowledge Discovery from Data, 5(2), 13:1\u201313:36.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"5673_CR26","first-page":"1011","volume":"15","author":"T Mizutani","year":"2014","unstructured":"Mizutani, T. (2014). Ellipsoidal rounding for nonnegative matrix factorization under noisy separability. Journal of Machine Learning Research, 15, 1011\u20131039.","journal-title":"Journal of Machine Learning Research"},{"key":"5673_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.laa.2016.02.016","volume":"497","author":"T Mizutani","year":"2016","unstructured":"Mizutani, T. (2016). Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem. Linear Algebra and its Applications, 497, 1\u201322.","journal-title":"Linear Algebra and its Applications"},{"issue":"4","key":"5673_CR28","doi-asserted-by":"publisher","first-page":"898","DOI":"10.1109\/TGRS.2005.844293","volume":"43","author":"JMP Nascimento","year":"2005","unstructured":"Nascimento, J. M. P., & Dias, J. M. B. (2005). Vertex component analysis: A fast algorithm to unmix hyperspectral data. IEEE Transactions on Geoscience and Remote Sensing, 43(4), 898\u2013910.","journal-title":"IEEE Transactions on Geoscience and Remote Sensing"},{"key":"5673_CR29","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1006\/jcss.2000.1711","volume":"61","author":"CH Papadimitriou","year":"2000","unstructured":"Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000). Latent semantic indexing: A probabilistic analysis. Journal of Computer and System Sciences, 61, 217\u2013235.","journal-title":"Journal of Computer and System Sciences"},{"issue":"3","key":"5673_CR30","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/080736417","volume":"31","author":"V Rokhlin","year":"2009","unstructured":"Rokhlin, V., Szlam, A., & Tygert, M. (2009). A randomized algorithm for principal component analysis. SIAM Journal on Matrix Analysis and Applications, 31(3), 1100\u20131124.","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"5","key":"5673_CR31","doi-asserted-by":"publisher","first-page":"690","DOI":"10.1287\/opre.1040.0115","volume":"52","author":"P Sun","year":"2004","unstructured":"Sun, P., & Freund, R. M. (2004). Computation of minimum-volume covering ellipsoids. Operations Research, 52(5), 690\u2013706.","journal-title":"Operations Research"},{"issue":"9","key":"5673_CR32","doi-asserted-by":"publisher","first-page":"2269","DOI":"10.1109\/TSP.2016.2516971","volume":"64","author":"M Tepper","year":"2016","unstructured":"Tepper, M., & Sapiro, G. (2016). Compressed nonnegative matrix factorization is fast and accurate. IEEE Transactions on Signal Processing, 64(9), 2269\u20132283.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"5673_CR33","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"K-C Toh","year":"1999","unstructured":"Toh, K.-C., Todd, M. J., & T\u00fct\u00fcnc\u00fc, R. H. (1999). SDPT3\u2014A MATLAB software package for semidefinite programming. Optimization Methods and Software, 11, 545\u2013581.","journal-title":"Optimization Methods and Software"},{"key":"5673_CR34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574","volume-title":"Numerical linear algebra","author":"LN Trefethen","year":"1997","unstructured":"Trefethen, L. N., & Bau, D. (1997). Numerical linear algebra. Philadelphia: SIAM."},{"issue":"3","key":"5673_CR35","doi-asserted-by":"publisher","first-page":"1364","DOI":"10.1137\/070709967","volume":"20","author":"SA Vavasis","year":"2009","unstructured":"Vavasis, S. A. (2009). On the complexity of nonnegative matrix factorization. SIAM Journal of Optimization, 20(3), 1364\u20131377.","journal-title":"SIAM Journal of Optimization"},{"issue":"11","key":"5673_CR36","doi-asserted-by":"publisher","first-page":"4027","DOI":"10.1109\/TIP.2015.2456508","volume":"24","author":"Y Wang","year":"2015","unstructured":"Wang, Y., Pan, C., Xiang, S., & Zhu, F. (2015). Robust hyperspectral unmixing with correntropy-based metric. IEEE Transactions on Image Processing, 24(11), 4027\u20134040.","journal-title":"IEEE Transactions on Image Processing"},{"issue":"1\u20132","key":"5673_CR37","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D. P. (2014). Sketching as a tool for numerical linear algebra. Foundations and Trends in Theoretical Computer Science, 10(1\u20132), 1\u2013157.","journal-title":"Foundations and Trends in Theoretical Computer Science"},{"issue":"12","key":"5673_CR38","doi-asserted-by":"publisher","first-page":"5412","DOI":"10.1109\/TIP.2014.2363423","volume":"23","author":"F Zhu","year":"2014","unstructured":"Zhu, F., Wang, Y., Fan, B., Xiang, S., Meng, G., & Pan, C. (2014). Spectral unmixing via data-guided sparsity. IEEE Transactions on Image Processing, 23(12), 5412\u20135427.","journal-title":"IEEE Transactions on Image Processing"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-017-5673-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5673-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-017-5673-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,8,27]],"date-time":"2023-08-27T17:02:54Z","timestamp":1693155774000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-017-5673-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,26]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,4]]}},"alternative-id":["5673"],"URL":"https:\/\/doi.org\/10.1007\/s10994-017-5673-1","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,10,26]]}}}