{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T16:08:57Z","timestamp":1762272537681,"version":"3.37.3"},"reference-count":51,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,2,1]],"date-time":"2022-02-01T00:00:00Z","timestamp":1643673600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972328"],"award-info":[{"award-number":["61972328"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2022,2,1]]},"DOI":"10.1109\/tkde.2020.2985964","type":"journal-article","created":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:49:23Z","timestamp":1586551763000},"page":"653-666","source":"Crossref","is-referenced-by-count":10,"title":["Fast and Secure Distributed Nonnegative Matrix Factorization"],"prefix":"10.1109","volume":"34","author":[{"given":"Yuqiu","family":"Qian","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3993-4751","authenticated-orcid":false,"given":"Conghui","family":"Tan","sequence":"additional","affiliation":[]},{"given":"Danhao","family":"Ding","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9139-3855","authenticated-orcid":false,"given":"Hui","family":"Li","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3423-4895","authenticated-orcid":false,"given":"Nikos","family":"Mamoulis","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972740.45"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2007.902017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.18"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339629"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851152"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098118"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2018.2881452"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2767592"},{"key":"ref9","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume-title":"Proc. NIPS","author":"Lee"},{"article-title":"The why and how of nonnegative matrix factorization","year":"2014","author":"Gillis","key":"ref10"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.1986.4307748"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/s0167-6377(99)00074-7"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/110821172"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1162\/neco.2007.19.10.2756"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11785231_91"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380855"},{"article-title":"Parallel non negative matrix factorization for document clustering","year":"2007","author":"Kanjani","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1117\/12.685655"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/1772690.1772760"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.gpb.2013.06.001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-44845-8_22"},{"key":"ref24","first-page":"34:1","article-title":"MLlib: Machine learning in apache spark","volume":"17","author":"Meng","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/2627373.2627380"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1186\/s12859-015-0485-4"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/15M1025487"},{"key":"ref28","first-page":"53:1","article-title":"Iterative hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"Pilanci","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972801.25"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44598-6_3"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281275"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.153"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19896-0_10"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.217"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-59171-1_3"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-009-0243-x"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FSKD.2011.6019699"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972788.24"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78524-8_13"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-74143-5_32"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref43","first-page":"369","article-title":"Faster ridge regression via the subsampled randomized hadamard transform","volume-title":"Proc. NIPS","author":"Lu"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488620"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487591"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/0314056"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2015.03.002"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159662"},{"key":"ref50","article-title":"Subgradient methods","author":"Boyd","year":"2003","journal-title":"Stanford University"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-013-0035-4"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/9677034\/09063484.pdf?arnumber=9063484","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,9]],"date-time":"2024-01-09T22:36:08Z","timestamp":1704839768000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9063484\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,2,1]]},"references-count":51,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2020.2985964","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"type":"print","value":"1041-4347"},{"type":"electronic","value":"1558-2191"},{"type":"electronic","value":"2326-3865"}],"subject":[],"published":{"date-parts":[[2022,2,1]]}}}