{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T10:50:49Z","timestamp":1730285449174,"version":"3.28.0"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1109\/noms54207.2022.9789871","type":"proceedings-article","created":{"date-parts":[[2022,6,9]],"date-time":"2022-06-09T17:21:22Z","timestamp":1654795282000},"page":"1-6","source":"Crossref","is-referenced-by-count":2,"title":["Non-negative Matrix Factorization For Network Delay Matrix Completion"],"prefix":"10.1109","author":[{"given":"Sanaa","family":"Ghandi","sequence":"first","affiliation":[{"name":"IMT Atlantique,LAB-STICC Laboratory,Brest,France"}]},{"given":"Alexandre","family":"Reiffers-Masson","sequence":"additional","affiliation":[{"name":"IMT Atlantique,LAB-STICC Laboratory,Brest,France"}]},{"given":"Sandrine","family":"Vaton","sequence":"additional","affiliation":[{"name":"IMT Atlantique,LAB-STICC Laboratory,Brest,France"}]},{"given":"Thierry","family":"Chonavel","sequence":"additional","affiliation":[{"name":"IMT Atlantique,LAB-STICC Laboratory,Brest,France"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.23919\/ICACT.2017.7890082"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398818"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057218"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524463"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737482"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3051736"},{"key":"ref16","first-page":"3057","article-title":"Matrix completion based adaptive sampling for measuring network delay with online support","volume":"14","author":"meng","year":"2020","journal-title":"KSII Transactions on Internet and Information Systems (TIIS)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GLOBECOM42002.2020.9348071"},{"year":"0","key":"ref18","article-title":"Synthetic data generation"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2190406"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2002.1019258"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1015467.1015471"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2228881"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"2273","DOI":"10.1109\/JSAC.2006.884026","article-title":"Ides: An internet distance estimation service for large networks","volume":"24","author":"mao","year":"2006","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298331"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2612695"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2014.6854901"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028827"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"year":"0","key":"ref20","article-title":"Ripe atlas"},{"key":"ref22","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"The Journal of Machine Learning Research"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2968380"},{"key":"ref24","first-page":"556","article-title":"Algorithms for non-negative matrix factorization","volume":"13","author":"seung","year":"2001","journal-title":"Advances in neural information processing systems"},{"key":"ref23","article-title":"A method of solving a convex programming problem with convergence rate mathcal{O}(1\/kˆ{2})","volume":"27","author":"nesterov","year":"0","journal-title":"Sov Math Dokl"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking46909.2019.8999453"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/885651.781053"}],"event":{"name":"NOMS 2022-2022 IEEE\/IFIP Network Operations and Management Symposium","start":{"date-parts":[[2022,4,25]]},"location":"Budapest, Hungary","end":{"date-parts":[[2022,4,29]]}},"container-title":["NOMS 2022-2022 IEEE\/IFIP Network Operations and Management Symposium"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9789703\/9789704\/09789871.pdf?arnumber=9789871","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,4]],"date-time":"2022-07-04T16:09:52Z","timestamp":1656950992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9789871\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/noms54207.2022.9789871","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]}}}