{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T10:05:13Z","timestamp":1767261913977,"version":"3.37.3"},"reference-count":56,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":["61972144","61572184","61725206","61976087"],"award-info":[{"award-number":["61972144","61572184","61725206","61976087"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004735","name":"Hunan Provincial Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2017JJ1010"],"award-info":[{"award-number":["2017JJ1010"]}],"id":[{"id":"10.13039\/501100004735","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"U.S. NSF","doi-asserted-by":"publisher","award":["ECCS 78929","CNS 1526843"],"award-info":[{"award-number":["ECCS 78929","CNS 1526843"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002367","name":"Open Project Funding of State Key Laboratory of Computer Architecture, Institute of Computing Technology, Chinese Academy of Sciences","doi-asserted-by":"publisher","award":["CARCH201809"],"award-info":[{"award-number":["CARCH201809"]}],"id":[{"id":"10.13039\/501100002367","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Peng Cheng Laboratory Project of Guangdong Province","award":["PCL2018KP004"],"award-info":[{"award-number":["PCL2018KP004"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1109\/tnet.2020.2976129","type":"journal-article","created":{"date-parts":[[2020,3,19]],"date-time":"2020-03-19T21:46:20Z","timestamp":1584654380000},"page":"958-971","source":"Crossref","is-referenced-by-count":16,"title":["Accurate and Fast Recovery of Network Monitoring Data: A GPU Accelerated Matrix Completion"],"prefix":"10.1109","volume":"28","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2163-2723","authenticated-orcid":false,"given":"Kun","family":"Xie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuxiang","family":"Chen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8639-3818","authenticated-orcid":false,"given":"Xin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4964-1135","authenticated-orcid":false,"given":"Gaogang","family":"Xie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2725-2529","authenticated-orcid":false,"given":"Jiannong","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jigang","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"ref38","first-page":"950","article-title":"Multi-probe LSH: Efficient indexing for high-dimensional similarity search","author":"lv","year":"2007","journal-title":"Proc VLDB Endowment"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2019.2896634"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2815548"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2017.2775230"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2016.2595569"},{"key":"ref37","first-page":"518","article-title":"Similarity search in high dimensions via hashing","author":"gionis","year":"1999","journal-title":"Proc VLDB"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref35","first-page":"1297","article-title":"Practical large-scale optimization for max-norm regularization","author":"lee","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218633"},{"key":"ref27","first-page":"15","article-title":"An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems","volume":"6","author":"toh","year":"2010","journal-title":"Pacific J Optim"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2014.26"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2819504"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2819507"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"ref22","first-page":"1","article-title":"Nonconvex low rank matrix factorization via inexact first order oracle","author":"zhao","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553434"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref26","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/s10107-009-0306-5","article-title":"Fixed point and Bregman iterative methods for matrix rank minimization","volume":"128","author":"ma","year":"2009","journal-title":"Math Program"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"journal-title":"Finite Mixture Models","year":"2004","author":"mclachlan","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1090\/mmono\/065"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2907294.2907297"},{"key":"ref55","article-title":"CuMF_SGD: Fast and scalable matrix factorization","author":"xie","year":"2016","journal-title":"arXiv 1610 05838"},{"key":"ref54","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","author":"lee","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8655(00)00112-4"},{"article-title":"E2LSH 0.1 user manual","year":"2005","author":"andoni","key":"ref52"},{"key":"ref10","first-page":"30","article-title":"VANET based traffic estimation: A matrix completion approach","author":"du","year":"2013","journal-title":"Proc IEEE Global Commun Conf (GLOBECOM)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398818"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/564691.564729"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2639108.2639129"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020426"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/2507157.2507164"},{"key":"ref16","article-title":"A high-performance parallel algorithm for nonnegative matrix factorization","author":"kannan","year":"2015","journal-title":"arXiv 1509 09313"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2012.120"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0682-2"},{"key":"ref19","first-page":"299","article-title":"Network coordinates in the wild","volume":"7","author":"ledlie","year":"2007","journal-title":"Proc NSDI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230544"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2017.2761704"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2011.2169424"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"journal-title":"Cluster Dissection and Analysis Theory FORTRAN Programs Examples","year":"1985","author":"spath","key":"ref49"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2013.6638517"},{"journal-title":"Low Rank Approximation Algorithms Implementation Applications","year":"2011","author":"markovsky","key":"ref46"},{"journal-title":"Programming Massively Parallel Processors A Hands-On","year":"2016","author":"kirk","key":"ref45"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF02288367"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/997817.997857"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/2213836.2213898"},{"key":"ref44","first-page":"8","article-title":"NVIDIA CUDA C programming guide","volume":"120","author":"nvidia","year":"2011"},{"key":"ref43","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"recht","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/9119211\/9042872-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9119211\/09042872.pdf?arnumber=9042872","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:42:04Z","timestamp":1651070524000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9042872\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":56,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2020.2976129","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2020,6]]}}}