{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:03:15Z","timestamp":1766066595946,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T00:00:00Z","timestamp":1457654400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["14J01495"],"award-info":[{"award-number":["14J01495"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["15H02719"],"award-info":[{"award-number":["15H02719"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2016,5]]},"DOI":"10.1007\/s10994-016-5553-0","type":"journal-article","created":{"date-parts":[[2016,3,11]],"date-time":"2016-03-11T19:51:20Z","timestamp":1457725880000},"page":"285-306","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["A column-wise update algorithm for nonnegative matrix factorization in Bregman divergence with an orthogonal constraint"],"prefix":"10.1007","volume":"103","author":[{"given":"Keigo","family":"Kimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mineichi","family":"Kudo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuzuru","family":"Tanaka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,3,11]]},"reference":[{"issue":"7","key":"5553_CR1","doi-asserted-by":"publisher","first-page":"2664","DOI":"10.1109\/TIT.2005.850145","volume":"51","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Guo, X., & Wang, H. (2005). On the optimality of conditional expectation as a Bregman predictor. IEEE Transactions on Information Theory, 51(7), 2664\u20132669.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5553_CR2","first-page":"1705","volume":"6","author":"A Banerjee","year":"2005","unstructured":"Banerjee, A., Merugu, S., Dhillon, I. S., & Ghosh, J. (2005). Clustering with Bregman divergences. The Journal of Machine Learning Research, 6, 1705\u20131749.","journal-title":"The Journal of Machine Learning Research"},{"issue":"8","key":"5553_CR3","doi-asserted-by":"publisher","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. S. (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"},{"key":"5553_CR4","doi-asserted-by":"crossref","unstructured":"Cai, D., Wang, X., & He, X. (2009). Probabilistic dyadic data analysis with local and global consistency. In Proceedings of the 26th annual international conference on machine learning (pp. 105\u2013112). ACM.","DOI":"10.1145\/1553374.1553388"},{"issue":"3","key":"5553_CR5","doi-asserted-by":"publisher","first-page":"708","DOI":"10.1587\/transfun.E92.A.708","volume":"92","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., & Anh-Huy, P. (2009). Fast local algorithms for large scale nonnegative matrix and tensor factorizations. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 92(3), 708\u2013721.","journal-title":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences"},{"key":"5553_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative matrix and tensor factorizations: Applications to exploratory multi-way data analysis and blind source separation","author":"A Cichocki","year":"2009","unstructured":"Cichocki, A., Zdunek, R., Phan, A. H., & Amari, S.-I. (2009). Nonnegative matrix and tensor factorizations: Applications to exploratory multi-way data analysis and blind source separation. New York: Wiley."},{"issue":"8","key":"5553_CR7","doi-asserted-by":"publisher","first-page":"3913","DOI":"10.1016\/j.csda.2008.01.011","volume":"52","author":"C Ding","year":"2008","unstructured":"Ding, C., Li, T., & Peng, W. (2008). On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing. Computational Statistics & Data Analysis, 52(8), 3913\u20133927.","journal-title":"Computational Statistics & Data Analysis"},{"key":"5553_CR8","doi-asserted-by":"crossref","unstructured":"Ding, C., Li, T., Peng, W., & Park, H. (2006). Orthogonal nonnegative matrix t-factorizations for clustering. In Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 126\u2013135). ACM.","DOI":"10.1145\/1150402.1150420"},{"key":"5553_CR9","doi-asserted-by":"crossref","unstructured":"Hsieh, C.-J., & Dhillon, I. S. (2011). Fast coordinate descent methods with variable selection for non-negative matrix factorization. In Proceedings of the 17th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 1064\u20131072). ACM.","DOI":"10.1145\/2020408.2020577"},{"issue":"2","key":"5553_CR10","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/s10898-013-0035-4","volume":"58","author":"J Kim","year":"2014","unstructured":"Kim, J., He, Y., & Park, H. (2014). Algorithms for nonnegative matrix and tensor factorizations: A unified view based on block coordinate descent framework. Journal of Global Optimization, 58(2), 285\u2013319.","journal-title":"Journal of Global Optimization"},{"key":"5553_CR11","doi-asserted-by":"crossref","unstructured":"Kim, J., & Park, H. (2008). Toward faster nonnegative matrix factorization: A new algorithm and comparisons. In Proceedings of the 8th IEEE international conference on data mining (pp. 353\u2013362). IEEE.","DOI":"10.1109\/ICDM.2008.149"},{"issue":"6","key":"5553_CR12","doi-asserted-by":"publisher","first-page":"3261","DOI":"10.1137\/110821172","volume":"33","author":"J Kim","year":"2011","unstructured":"Kim, J., & Park, H. (2011). Fast nonnegative matrix factorization: An active-set-like method and comparisons. SIAM Journal on Scientific Computing, 33(6), 3261\u20133281.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"5553_CR13","first-page":"556","volume":"13","author":"DD Lee","year":"2000","unstructured":"Lee, D. D., & Seung, H. S. (2000). Algorithms for non-negative matrix factorization. Advances in Neural Information Processing Systems, 13, 556\u2013562.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"5553_CR14","doi-asserted-by":"crossref","unstructured":"Li, L., Lebanon, G., & Park, H. (2012). Fast Bregman divergence NMF using Taylor expansion and coordinate descent. In Proceedings of the 18th ACM SIGKDD international conference on knowledge discovery and data mining (pp. 307\u2013315). ACM.","DOI":"10.1145\/2339530.2339582"},{"issue":"9","key":"5553_CR15","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1016\/j.patrec.2009.12.023","volume":"31","author":"Z Li","year":"2010","unstructured":"Li, Z., Wu, X., & Peng, H. (2010). Nonnegative matrix factorization on orthogonal subspace. Pattern Recognition Letters, 31(9), 905\u2013911.","journal-title":"Pattern Recognition Letters"},{"issue":"10","key":"5553_CR16","doi-asserted-by":"publisher","first-page":"2756","DOI":"10.1162\/neco.2007.19.10.2756","volume":"19","author":"C-J Lin","year":"2007","unstructured":"Lin, C.-J. (2007). Projected gradient methods for nonnegative matrix factorization. Neural Computation, 19(10), 2756\u20132779.","journal-title":"Neural Computation"},{"key":"5553_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/j.cam.2013.09.022","volume":"260","author":"A Mirzal","year":"2014","unstructured":"Mirzal, A. (2014). A convergent algorithm for orthogonal nonnegative matrix factorization. Journal of Computational and Applied Mathematics, 260, 149\u2013166.","journal-title":"Journal of Computational and Applied Mathematics"},{"key":"5553_CR18","unstructured":"Pompili, F., Gillis, N., Absil, P.-A., & Glineur, F. (2012). Two algorithms for orthogonal nonnegative matrix factorization with application to clustering. arXiv preprint \n                    arXiv:1201.0901\n                    \n                  ."},{"key":"5553_CR19","doi-asserted-by":"crossref","unstructured":"Yoo, J., & Choi, S. (2008). Orthogonal nonnegative matrix factorization: Multiplicative updates on stiefel manifolds. In Intelligent data engineering and automated learning (pp. 140\u2013147). Springer.","DOI":"10.1007\/978-3-540-88906-9_18"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5553-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-016-5553-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5553-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-016-5553-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T08:04:36Z","timestamp":1589702676000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-016-5553-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,3,11]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,5]]}},"alternative-id":["5553"],"URL":"https:\/\/doi.org\/10.1007\/s10994-016-5553-0","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2016,3,11]]},"assertion":[{"value":"23 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 February 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}