{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T17:09:45Z","timestamp":1729616985010,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,5]]},"DOI":"10.1109\/icassp.2014.6854906","type":"proceedings-article","created":{"date-parts":[[2014,7,29]],"date-time":"2014-07-29T15:23:23Z","timestamp":1406647403000},"page":"6746-6750","source":"Crossref","is-referenced-by-count":1,"title":["First Order Methods for Robust non-negative matrix factorization for large scale noisy data"],"prefix":"10.1109","author":[{"given":"Jason Gejie","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuchin","family":"Aeron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Hierarchical Clustering of Hyperspectral Images Using Rank-two Non-negative Matrix Factorization","year":"2013","author":"gillis","key":"13"},{"journal-title":"Topic Discovery Through Data Dependent and Random Projections","year":"2013","author":"ding","key":"14"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2011.2141672"},{"year":"0","key":"12"},{"journal-title":"On the Complexity of Nonnegative Matrix Factorization","year":"2012","author":"vavasis","key":"3"},{"journal-title":"Necessary and Sufficient Conditions for Novel Word Detection in Separable Topic Models","year":"2013","author":"ding","key":"2"},{"key":"1","article-title":"When does non-negative matrix factorization give a correct decomposition into parts","volume":"16","author":"donoho","year":"2004","journal-title":"Adv Neural Inf Process Syst"},{"key":"10","article-title":"On accelerated proximal gradient methods for convex-concave optimization","author":"tseng","year":"2008","journal-title":"SIAM Journal of Optimization"},{"journal-title":"Robust Near-Separable Nonnegative Matrix Factorization Using Linear Optimization","year":"2013","author":"gillis","key":"7"},{"journal-title":"Fast Conical Hull Algorithms for Near-separable Non-negative Matrix Factorization","year":"2012","author":"kumar","key":"6"},{"key":"5","first-page":"1223","article-title":"Factoring nonnegative matrices with linear programs","volume":"25","author":"recht","year":"2012","journal-title":"Advances Neural Info Process Sys"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2013.6737093"},{"journal-title":"Computing A Non-negative Matrix Factorization Provably","year":"2011","author":"arora","key":"9"},{"key":"8","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/8996.001.0001","author":"sra","year":"2011","journal-title":"Optimization for Machine Learning"}],"event":{"name":"ICASSP 2014 - 2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2014,5,4]]},"location":"Florence, Italy","end":{"date-parts":[[2014,5,9]]}},"container-title":["2014 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6844297\/6853544\/06854906.pdf?arnumber=6854906","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,13]],"date-time":"2019-08-13T05:25:53Z","timestamp":1565673953000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6854906\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/icassp.2014.6854906","relation":{},"subject":[],"published":{"date-parts":[[2014,5]]}}}