{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T15:51:08Z","timestamp":1776441068659,"version":"3.51.2"},"reference-count":47,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw."],"published-print":{"date-parts":[[2011,10]]},"DOI":"10.1109\/tnn.2011.2164621","type":"journal-article","created":{"date-parts":[[2011,8,31]],"date-time":"2011-08-31T15:44:06Z","timestamp":1314805446000},"page":"1626-1637","source":"Crossref","is-referenced-by-count":65,"title":["Minimum-Volume-Constrained Nonnegative Matrix Factorization: Enhanced Ability of Learning Parts"],"prefix":"10.1109","volume":"22","author":[{"family":"Guoxu Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Shengli Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zuyuan Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Jun-Mei Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"family":"Zhaoshui He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2007.09.010"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2007.01.024"},{"key":"ref33","first-page":"1","article-title":"The gramian and K-volume in N-space: Some classical results in linear algebra","volume":"2","author":"nils","year":"1999","journal-title":"J Young Investig"},{"key":"ref32","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1007\/978-3-642-00599-2_14","article-title":"Minimum determinant constraint for non-negative matrix factorization","author":"schachtner","year":"2009","journal-title":"Proc Independ Comp Anal Signal Separat"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2008.2005793"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2076831"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.895831"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1162\/089976698300017746"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2008.4408452"},{"key":"ref10","first-page":"811","article-title":"Flexible component analysis for sparse, smooth, nonnegative coding or representation","author":"cichocki","year":"2008","journal-title":"Proc Neural Inf Process"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2008.05.106"},{"key":"ref11","first-page":"1385","article-title":"Learning sparse representations by non-negative matrix factorization and sequential cone programming","volume":"7","author":"heiler","year":"2006","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2007.4370971"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2004.1381036"},{"key":"ref14","first-page":"1","article-title":"First results on uniqueness of sparse non-negative matrix","author":"theis","year":"2005","journal-title":"Proc 13th Eur Signal Process Conf"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2007.366320"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/NNSP.2002.1030067"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2003.1199270"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0437847100"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/36.297973"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2091427"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2009.72"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2009.2030586"},{"key":"ref3","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst 13"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2000162"},{"key":"ref29","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2000","journal-title":"Proc Adv Neural Inf Process Syst 13"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005293"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.873291"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2041361"},{"key":"ref2","first-page":"1457","article-title":"Non-negative matrix factorization with sparseness constraints","volume":"5","author":"hoyer","year":"2004","journal-title":"J Mach Learn Res"},{"key":"ref9","first-page":"1141","article-title":"When does non-negative matrix factorization give a correct decomposition into parts?","author":"donoho","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst 16"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by non-negative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2007.915117"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2005.844293"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018647011077"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2011.2109396"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/235815.235821"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.dsp.2011.02.001"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2003.820672"},{"key":"ref24","author":"cichocki","year":"2003","journal-title":"Adaptive Blind Signal and Image Processing Learning Algorithms and Applications"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.928937"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2009.2025802"},{"key":"ref44","author":"cichocki","year":"2006","journal-title":"NMFLAB for Signal Processing NMFLABMATLAB Toolbox for Non-Negative Matrix Factorization"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2010.2052828"},{"key":"ref43","author":"hoyer","year":"2004","journal-title":"NMFpack"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2009.2035920"}],"container-title":["IEEE Transactions on Neural Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/72\/6032791\/06003792.pdf?arnumber=6003792","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:48:46Z","timestamp":1633909726000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6003792\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":47,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tnn.2011.2164621","relation":{},"ISSN":["1045-9227","1941-0093"],"issn-type":[{"value":"1045-9227","type":"print"},{"value":"1941-0093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}