{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T06:10:31Z","timestamp":1770358231610,"version":"3.49.0"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["71871144"],"award-info":[{"award-number":["71871144"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3305945","type":"journal-article","created":{"date-parts":[[2023,8,17]],"date-time":"2023-08-17T17:32:21Z","timestamp":1692293541000},"page":"88433-88450","source":"Crossref","is-referenced-by-count":4,"title":["Matrix Completion of Adaptive Jumping Graph Neural Networks for Recommendation Systems"],"prefix":"10.1109","volume":"11","author":[{"given":"Xiaodong","family":"Zhu","sequence":"first","affiliation":[{"name":"Business School, University of Shanghai for Science and Technology, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3978-6043","authenticated-orcid":false,"given":"Junyu","family":"Fu","sequence":"additional","affiliation":[{"name":"Business School, University of Shanghai for Science and Technology, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"Business School, University of Shanghai for Science and Technology, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/883"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3285029"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2008.22"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00521-021-05723-2"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271761"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132926"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.3390\/info12060232"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2018.03.004"},{"key":"ref11","first-page":"8676","article-title":"Representation learning on graphs with jumping knowledge networks","volume-title":"Proc. ICML","author":"Xu"},{"key":"ref12","first-page":"1","article-title":"PairNorm: Tackling oversmoothing in GNNs","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhao"},{"key":"ref13","first-page":"1","article-title":"Graph convolutional matrix completion","volume-title":"Proc. ACM SIGKDD Int. Conf. Knowl. Discov. Data Mining","author":"Berg"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2019.102142"},{"key":"ref16","first-page":"1","article-title":"Inductive matrix completion based on graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3477495.3532038"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3503161.3548020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/592"},{"key":"ref20","article-title":"Relational inductive biases, deep learning, and graph networks","author":"Battaglia","year":"2018","journal-title":"arXiv:1806.01261"},{"key":"ref21","first-page":"86","article-title":"Revisiting semi-supervised learning with graph embeddings","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Yang"},{"key":"ref22","first-page":"1025","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/b978-0-12-813677-5.00011-0"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1606.09375"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2010.04.005"},{"key":"ref26","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Welling"},{"key":"ref27","first-page":"2053","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. ICML","author":"Gilmer"},{"key":"ref28","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Veli\u010dkovi\u0107"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5747"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11691"},{"key":"ref31","first-page":"4917","article-title":"Towards deeper graph neural networks with differentiable group normalization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhou"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33013060"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/CCAA.2017.8229786"},{"key":"ref34","first-page":"1","article-title":"DropEdge: Towards deep graph convolutional networks on node classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Rong"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67664-3_21"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93417-4_38"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.03762"},{"key":"ref39","first-page":"1","article-title":"Decoupled weight decay regularization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Loshchilov"},{"key":"ref40","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. 13th Int. Conf. Artif. Intell. Statist.","author":"Glorot"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.5555\/2981562.2981720"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2020.02.068"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2959100.2959165"},{"key":"ref45","first-page":"3050","article-title":"Deep models of interactions across sets","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Hartford"},{"key":"ref46","article-title":"Neural network matrix factorization","author":"Dziugaite","year":"2015","journal-title":"arXiv:1511.06443"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00140"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s13198-021-01101-2"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TETCI.2021.3102619"},{"key":"ref50","first-page":"3698","article-title":"Geometric matrix completion with recurrent multi-graph neural networks","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Monti"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2020.3040909"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.3390\/electronics12102320"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3258413"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2022.3203791"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/s11276-022-03099-2"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TCSS.2022.3148411"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-022-01790-3"},{"key":"ref58","article-title":"How powerful are graph neural networks?","author":"Xu","year":"2018","journal-title":"arXiv:1810.00826"},{"key":"ref59","first-page":"23341","article-title":"How powerful are spectral graph neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wang"},{"key":"ref60","article-title":"ACMP: Allen-Cahn message passing for graph neural networks with particle phase transition","author":"Wang","year":"2022","journal-title":"arXiv:2206.05437"},{"key":"ref61","article-title":"A generalization of ViT\/MLP-mixer to graphs","author":"He","year":"2022","journal-title":"arXiv:2212.13350"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599834"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599292"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.5555\/2969442.2969475"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1145\/3292500.3330895"},{"key":"ref66","article-title":"Deep coevolutionary network: Embedding user and item features for recommendation","author":"Dai","year":"2016","journal-title":"arXiv:1609.03675"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482419"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10223037.pdf?arnumber=10223037","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,14]],"date-time":"2024-03-14T03:21:43Z","timestamp":1710386503000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10223037\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":67,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3305945","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}