{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T14:40:46Z","timestamp":1730299246988,"version":"3.28.0"},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1109\/ssp.2018.8450822","type":"proceedings-article","created":{"date-parts":[[2018,9,7]],"date-time":"2018-09-07T16:05:36Z","timestamp":1536336336000},"page":"363-367","source":"Crossref","is-referenced-by-count":1,"title":["Minimax Lower Bounds for Nonnegative Matrix Factorization"],"prefix":"10.1109","author":[{"given":"Mine","family":"Alsan","sequence":"first","affiliation":[]},{"given":"Zhaoqiang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/070709967"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"1589","DOI":"10.1109\/TNN.2007.895831","article-title":"On the convergence of multiplicative update algorithms for non-negative matrix factorization","volume":"18","author":"lin","year":"2007","journal-title":"IEEE Transactions on Neural Networks"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2757914"},{"key":"ref14","first-page":"1913","article-title":"Nonnegative matrix factorizations as probabilistic inference in composite models","author":"f\u00e9votte","year":"2009","journal-title":"EUSIPCO"},{"key":"ref15","volume":"46","author":"hyv\u00e4rinen","year":"2004","journal-title":"Independent Component Analysis"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2517006"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2799931"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2713761"},{"journal-title":"Festschrift for Lucien Le Cam Research Papers in Probability and Statistics","year":"2012","author":"pollard","key":"ref19"},{"key":"ref4","article-title":"Optimality, computation, and interpretation of nonnegative matrix factorizations","author":"chu","year":"2004","journal-title":"SIAM Journal on Matrix Analysis"},{"key":"ref3","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"NIPS"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74494-8_22"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"ref2","first-page":"67","article-title":"Non-negative matrix factorization, a new tool for feature extraction: theory and applications","volume":"3","author":"buciu","year":"2008","journal-title":"International Journal of Computers Communications and Control"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.4408452"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/978-94-007-0602-6_13","article-title":"Descent methods for nonnegative matrix factorization","author":"ho","year":"2011","journal-title":"Numerical Linear Algebra in Signals Systems and Control"},{"key":"ref20","first-page":"1","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2012","journal-title":"COLT"},{"key":"ref22","article-title":"A review of non-negative matrix factorization methods for clustering","author":"t?rkmen","year":"2015","journal-title":"arXiv preprint arXiv 1507 03194"},{"key":"ref21","first-page":"606","article-title":"On the equivalence of nonnegative matrix factorization and spectral clustering","author":"ding","year":"2005","journal-title":"SDM SIAM"},{"journal-title":"Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)","year":"2006","author":"cover","key":"ref24"},{"key":"ref23","first-page":"3180","article-title":"Efficient online spherical k-means clustering","volume":"5","author":"zhong","year":"2005","journal-title":"IEEE IJCNN"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366913"}],"event":{"name":"2018 IEEE Statistical Signal Processing Workshop (SSP)","start":{"date-parts":[[2018,6,10]]},"location":"Freiburg","end":{"date-parts":[[2018,6,13]]}},"container-title":["2018 IEEE Statistical Signal Processing Workshop (SSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8411683\/8450682\/08450822.pdf?arnumber=8450822","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,23]],"date-time":"2020-08-23T22:11:04Z","timestamp":1598220664000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8450822\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/ssp.2018.8450822","relation":{},"subject":[],"published":{"date-parts":[[2018,6]]}}}