{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:14:34Z","timestamp":1740132874384,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":["12371273","62471147"],"award-info":[{"award-number":["12371273","62471147"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013105","name":"Shanghai Rising-Star Program","doi-asserted-by":"publisher","award":["23QA1404600"],"award-info":[{"award-number":["23QA1404600"]}],"id":[{"id":"10.13039\/501100013105","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program","award":["2023QNRC001"],"award-info":[{"award-number":["2023QNRC001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Signal Process. Lett."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/lsp.2024.3460483","type":"journal-article","created":{"date-parts":[[2024,9,13]],"date-time":"2024-09-13T19:21:03Z","timestamp":1726255263000},"page":"2620-2624","source":"Crossref","is-referenced-by-count":0,"title":["Collective Matrix Completion via Graph Extraction"],"prefix":"10.1109","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7977-2859","authenticated-orcid":false,"given":"Tong","family":"Zhan","sequence":"first","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9362-508X","authenticated-orcid":false,"given":"Xiaojun","family":"Mao","sequence":"additional","affiliation":[{"name":"School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5421-5678","authenticated-orcid":false,"given":"Jian","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Data Science, Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6712-0750","authenticated-orcid":false,"given":"Zhonglei","family":"Wang","sequence":"additional","affiliation":[{"name":"Wang Yanan Institute for Studies in Economics, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2013.03.012"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.4171\/022-3\/69"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.002"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2234823"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401944"},{"key":"ref8","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Srebro","year":"2004"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.110145"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109234"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3226301"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2023.3283973"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaad013"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref19","first-page":"1224","article-title":"Low rank matrix completion with exponential family noise","volume-title":"Proc. Conf. Learn. Theory","author":"Lafond","year":"2015"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2500192"},{"key":"ref21","first-page":"1","article-title":"Collective matrix completion","volume":"20","author":"Alaya","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"ref23","first-page":"144","article-title":"Convex collective matrix factorization","volume-title":"Proc. 16th Int. Conf. Artif. Intell. Statist.","author":"Bouchard","year":"2013"},{"key":"ref24","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf","year":"2017"},{"key":"ref25","first-page":"1","article-title":"Graph convolutional matrix completion","volume-title":"Proc. 24th ACM SIGKDD Conf. Knowl. Discov. Data Mining","author":"den","year":"2018"},{"key":"ref26","first-page":"1","article-title":"Inductive matrix completion based on graph neural networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Zhang","year":"2019"},{"key":"ref27","first-page":"1917","article-title":"Exponential family matrix completion under structural constraints","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gunasekar","year":"2014"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref29","first-page":"4002","article-title":"Accelerated inexact soft-impute for fast large-scale matrix completion","volume-title":"Proc. 24th Int. Joint Conf. Artif. Intell.","author":"Yao","year":"2015"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2022.3167331"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2023.3240087"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2023.05.052"}],"container-title":["IEEE Signal Processing Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/97\/10380231\/10679920.pdf?arnumber=10679920","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,3]],"date-time":"2024-10-03T17:30:21Z","timestamp":1727976621000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10679920\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/lsp.2024.3460483","relation":{},"ISSN":["1070-9908","1558-2361"],"issn-type":[{"type":"print","value":"1070-9908"},{"type":"electronic","value":"1558-2361"}],"subject":[],"published":{"date-parts":[[2024]]}}}