{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:31:54Z","timestamp":1756463514690,"version":"3.41.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100015749","name":"Communication University of China","doi-asserted-by":"publisher","award":["CUC23WH009"],"award-info":[{"award-number":["CUC23WH009"]}],"id":[{"id":"10.13039\/501100015749","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3573181","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T17:05:40Z","timestamp":1748019940000},"page":"92365-92375","source":"Crossref","is-referenced-by-count":1,"title":["Prune and Distill: A Novel Knowledge Distillation Method for GCNs-Based Recommender Systems"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3114-6566","authenticated-orcid":false,"given":"Peng","family":"Yi","sequence":"first","affiliation":[{"name":"State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-7417-1739","authenticated-orcid":false,"given":"Zhaoxian","family":"Li","sequence":"additional","affiliation":[{"name":"Faculty of Social Sciences, University of Copenhagen, Copenhagen, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-6253-5848","authenticated-orcid":false,"given":"Lu","family":"Chen","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3873-6411","authenticated-orcid":false,"given":"Cheng","family":"Yang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Media Convergence and Communication, Communication University of China, Beijing, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8644-5531","authenticated-orcid":false,"given":"Xiongcai","family":"Cai","sequence":"additional","affiliation":[{"name":"School of Computer Science and Engineering, University of New South Wales, Sydney, NSW, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1148170.1148257"},{"issue":"3","key":"ref3","first-page":"313","article-title":"Recommender systems using linear classifiers","volume":"2","author":"Zhang","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1297231.1297251"},{"key":"ref5","first-page":"1","article-title":"Probabilistic matrix factorization","volume-title":"Proc. NeurIPS","author":"Mnih"},{"key":"ref6","article-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"Rendle","year":"2012","journal-title":"arXiv:1205.2618"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1935826.1935910"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2740908.2742726"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/447"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.330161"},{"key":"ref11","article-title":"Graph convolutional matrix completion","author":"van den Berg","year":"2017","journal-title":"arXiv:1706.02263"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401063"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-26387-3_34"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3535101"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3488560.3501396"},{"key":"ref18","first-page":"1","article-title":"Do deep nets really need to be deep?","volume-title":"Proc. NeurIPS","volume":"27","author":"Ba"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.48550\/arXiv.1503.02531"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3220021"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2019.00047"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467319"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570477"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.12.025"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380151"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462863"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482093"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271715"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3404835.3462862"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3580305.3599768"},{"key":"ref31","article-title":"LightGCL: Simple yet effective graph contrastive learning for recommendation","author":"Cai","year":"2023","journal-title":"arXiv:2302.08191"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401123"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449986"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3459637.3482291"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412005"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449878"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/3543507.3583209"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref39","first-page":"249","article-title":"Understanding the difficulty of training deep feedforward neural networks","volume-title":"Proc. AISTATS","author":"Glorot"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11014062.pdf?arnumber=11014062","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T18:02:36Z","timestamp":1748887356000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11014062\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3573181","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}