{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:53:58Z","timestamp":1777449238000,"version":"3.51.4"},"reference-count":36,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province, China","doi-asserted-by":"publisher","award":["ZR2018MA032"],"award-info":[{"award-number":["ZR2018MA032"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100007129","name":"Natural Science Foundation of Shandong Province, China","doi-asserted-by":"publisher","award":["ZR2020MA064"],"award-info":[{"award-number":["ZR2020MA064"]}],"id":[{"id":"10.13039\/501100007129","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3083600","type":"journal-article","created":{"date-parts":[[2021,5,25]],"date-time":"2021-05-25T19:45:08Z","timestamp":1621971908000},"page":"77407-77415","source":"Crossref","is-referenced-by-count":5,"title":["A Simple Graph Convolutional Network With Abundant Interaction for Collaborative Filtering"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1586-7040","authenticated-orcid":false,"given":"Ronghui","family":"Guo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1230-7603","authenticated-orcid":false,"given":"Xunkai","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2097-5879","authenticated-orcid":false,"given":"Youpeng","family":"Hu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8364-3228","authenticated-orcid":false,"given":"Yixuan","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Xiong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7607-8195","authenticated-orcid":false,"given":"Meixia","family":"Qu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3397271.3401137"},{"key":"ref32","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"wu","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186066"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209991"},{"key":"ref36","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"arXiv 1706 02216"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.6094"},{"key":"ref34","first-page":"10936","article-title":"Graph convolutional network for recommendation with low-pass collaborative filters","author":"yu","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","first-page":"478","article-title":"User-based collaborative-filtering recommendation algorithms on Hadoop","author":"zhao","year":"2010","journal-title":"Proc Int'l Conf Knowledge Discovery and Data Mining"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i01.5330"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3331184.3331267"},{"key":"ref13","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"arXiv 1609 02907"},{"key":"ref14","article-title":"Graph neural networks exponentially lose expressive power for node classification","author":"oono","year":"2019","journal-title":"arXiv 1905 10947"},{"key":"ref15","first-page":"1725","article-title":"Simple and deep graph convolutional networks","author":"chen","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/3077136.3080797"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3209978.3209981"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219890"},{"key":"ref19","article-title":"Graph convolutional matrix completion","author":"van den berg","year":"2017","journal-title":"arXiv 1706 02263"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1209"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313488"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR42600.2020.01017"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/3298689.3346997"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2003.1167344"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1159"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372071"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1155\/2009\/421425"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1038\/srep07702"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3351034"},{"key":"ref9","article-title":"BPR: Bayesian personalized ranking from implicit feedback","author":"rendle","year":"2012","journal-title":"arXiv 1205 2618"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357924"},{"key":"ref20","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052569"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313705"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3020192"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.330161"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00532"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00121"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09440428.pdf?arnumber=9440428","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:56:17Z","timestamp":1639770977000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9440428\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3083600","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}