{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T16:39:10Z","timestamp":1723048750789},"reference-count":9,"publisher":"World Scientific Pub Co Pte Lt","issue":"03","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Process. Lett."],"published-print":{"date-parts":[[2016,9]]},"abstract":"<jats:p> The goal of Nonnegative Matrix Factorization (NMF) is to represent a large nonnegative matrix in an approximate way as a product of two significantly smaller nonnegative matrices. This paper shows in detail how an NMF algorithm based on Newton iteration can be derived using the general Karush-Kuhn-Tucker (KKT) conditions for first-order optimality. This algorithm is suited for parallel execution on systems with shared memory and also with message passing. Both versions were implemented and tested, delivering satisfactory speedup results. <\/jats:p>","DOI":"10.1142\/s0129626416500146","type":"journal-article","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T22:37:55Z","timestamp":1474411075000},"page":"1650014","source":"Crossref","is-referenced-by-count":6,"title":["Parallel Nonnegative Matrix Factorization via Newton Iteration"],"prefix":"10.1142","volume":"26","author":[{"given":"Markus","family":"Flatz","sequence":"first","affiliation":[{"name":"Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mari\u00e1n","family":"Vajter\u0161ic","sequence":"additional","affiliation":[{"name":"Department of Computer Sciences, University of Salzburg, Jakob-Haringer-Str. 2, 5020 Salzburg, Austria"},{"name":"Mathematical Institute, Department of Informatics, Slovak Academy of Sciences, D\u00fabravsk\u00e1 cesta 9, 841 04 Bratislava, Slovakia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2016,9,20]]},"reference":[{"key":"p_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.csda.2006.11.006"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0308531101"},{"key":"p_9","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti653"},{"key":"p_10","first-page":"1457","volume":"5","author":"Hoyer Patrik O.","year":"2004","journal-title":"Journal of Machine Learning Research"},{"key":"p_12","doi-asserted-by":"publisher","DOI":"10.1016\/j.compstruc.2013.11.016"},{"key":"p_14","doi-asserted-by":"publisher","DOI":"10.1038\/44565"},{"key":"p_18","doi-asserted-by":"publisher","DOI":"10.1002\/env.3170050203"},{"key":"p_20","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2004.11.005"},{"key":"p_22","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2006.873291"}],"container-title":["Parallel Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129626416500146","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T13:15:23Z","timestamp":1565097323000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129626416500146"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,9]]},"references-count":9,"journal-issue":{"issue":"03","published-online":{"date-parts":[[2016,9,20]]},"published-print":{"date-parts":[[2016,9]]}},"alternative-id":["10.1142\/S0129626416500146"],"URL":"https:\/\/doi.org\/10.1142\/s0129626416500146","relation":{},"ISSN":["0129-6264","1793-642X"],"issn-type":[{"value":"0129-6264","type":"print"},{"value":"1793-642X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,9]]}}}