{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,24]],"date-time":"2026-09-24T13:42:58Z","timestamp":1790257378268,"version":"4.1.0"},"reference-count":38,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"21","license":[{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,11,1]],"date-time":"2016-11-01T00:00:00Z","timestamp":1477958400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100002661","name":"F.R.S.-FNRS","doi-asserted-by":"publisher","award":["F.4501.16"],"award-info":[{"award-number":["F.4501.16"]}],"id":[{"id":"10.13039\/501100002661","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1564000"],"award-info":[{"award-number":["CCF-1564000"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2016,11,1]]},"DOI":"10.1109\/tsp.2016.2591510","type":"journal-article","created":{"date-parts":[[2016,7,14]],"date-time":"2016-07-14T20:34:30Z","timestamp":1468528470000},"page":"5571-5584","source":"Crossref","is-referenced-by-count":36,"title":["Efficient and Non-Convex Coordinate Descent for Symmetric Nonnegative Matrix Factorization"],"prefix":"10.1109","volume":"64","author":[{"given":"Arnaud","family":"Vandaele","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Gillis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qi","family":"Lei","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kai","family":"Zhong","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Inderjit","family":"Dhillon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2492007.2492029"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2011.10.014"},{"key":"ref32","article-title":"Algorithms for Non-negative Matrix Factorization","volume":"13","author":"lee","year":"0","journal-title":"Proc Adv Neural Inf Process"},{"key":"ref31","doi-asserted-by":"crossref","first-page":"2117","DOI":"10.1109\/TNN.2011.2172457","article-title":"Symmetric nonnegative matrix factorization: Algorithms and applications to probabilistic clustering","volume":"22","author":"he","year":"2011","journal-title":"IEEE Trans Neural Netw"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1122"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1561\/2200000055"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.83.066114"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719574"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.03.016"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0223-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-013-9594-z"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.149"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"ref15","article-title":"Nonnegative matrix factorization: Algorithms and applications","author":"ho","year":"2008"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1587\/transfun.E92.A.708"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1117\/1.3184771"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1162\/NECO_a_00256"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020577"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-004-0194-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-008-0134-6"},{"key":"ref27","article-title":"Coordinate descent methods for symmetric nonnegative matrix factorization","author":"vandaele","year":"2015"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273568"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.10"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2285514"},{"key":"ref5","first-page":"1079","article-title":"Clustering by nonnegative matrix factorization using graph random walk","author":"yang","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972832.83"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0247-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2005.27"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1142\/5273"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"788","DOI":"10.1038\/44565","article-title":"Learning the parts of objects by nonnegative matrix factorization","volume":"401","author":"lee","year":"1999","journal-title":"Nature"},{"key":"ref20","article-title":"Nonnegative matrix factorization: Complexity, algorithms and applications","author":"gillis","year":"2011"},{"key":"ref22","article-title":"Solving the maximum clique problem with symmetric rank-one nonnegative matrix approximation","author":"belachew","year":"2015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0892-3"},{"key":"ref24","author":"bertsekas","year":"1999","journal-title":"Corrections for the Book Nonlinear Programming"},{"key":"ref23","author":"cardano","year":"1968","journal-title":"Ars Magna or the Rules of Algebra"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/110834524"},{"key":"ref25","author":"bertsekas","year":"1999","journal-title":"Nonlinear Programming"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/78\/7562579\/7513400-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/7562579\/07513400.pdf?arnumber=7513400","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:00Z","timestamp":1649443740000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7513400\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,11,1]]},"references-count":38,"journal-issue":{"issue":"21"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2016.2591510","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,11,1]]}}}