{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:20:42Z","timestamp":1740169242788,"version":"3.37.3"},"reference-count":38,"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\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2019YFB2102600"],"award-info":[{"award-number":["2019YFB2102600"]}],"id":[{"id":"10.13039\/501100012166","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.3126417","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T22:35:42Z","timestamp":1636410942000},"page":"151285-151293","source":"Crossref","is-referenced-by-count":2,"title":["CN-Motifs Perceptive Graph Neural Networks"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7891-1144","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"first","affiliation":[{"name":"Software Engineering Institute, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4793-7023","authenticated-orcid":false,"given":"Tian-Ming","family":"Bu","sequence":"additional","affiliation":[{"name":"Shanghai Key Laboratory of Trustworthy Computing, East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref38","article-title":"Fast graph representation learning with PyTorch geometric","author":"fey","year":"2019","journal-title":"arXiv 1903 02428"},{"key":"ref33","first-page":"1","article-title":"Query-driven active surveying for collective classification","volume":"8","author":"namata","year":"2012","journal-title":"Proc 10th Int Workshop Mining Learn Graphs"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"},{"key":"ref31","first-page":"5453","article-title":"Representation learning on graphs with jumping knowledge networks","author":"xu","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref30","article-title":"Layer normalization","author":"lei ba","year":"2016","journal-title":"arXiv 1607 06450"},{"key":"ref37","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014","journal-title":"arXiv 1412 6980"},{"key":"ref36","first-page":"3844","article-title":"Convolutional neural networks on graphs with fast localized spectral filtering","volume":"29","author":"defferrard","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557108"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1126\/science.298.5594.824"},{"key":"ref11","article-title":"How powerful are graph neural networks?","author":"xu","year":"2018","journal-title":"arXiv 1810 00826"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5861"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357880"},{"key":"ref14","article-title":"Geom-GCN: Geometric graph convolutional networks","author":"pei","year":"2020","journal-title":"arXiv 2002 05287"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00125"},{"key":"ref16","first-page":"1","article-title":"Beyond homophily in graph neural networks: Current limitations and effective designs","volume":"33","author":"zhu","year":"2020","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref17","article-title":"Beyond low-frequency information in graph convolutional networks","author":"bo","year":"2021","journal-title":"arXiv 2101 00797"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3336191.3371843"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3184558.3186900"},{"journal-title":"Introduction to Modern Information Retrieval","year":"1983","author":"salton","key":"ref28"},{"key":"ref4","first-page":"6861","article-title":"Simplifying graph convolutional networks","author":"wu","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref27","first-page":"547","article-title":"Étude comparative de la distribution florale dans une portion des Alpes et des Jura","volume":"37","author":"jaccard","year":"1901","journal-title":"Bull Soc Vaudoise Sci Nat"},{"key":"ref3","article-title":"Graph attention networks","author":"kovi\u00e0","year":"2017","journal-title":"arXiv 1710 10903"},{"key":"ref6","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","author":"abu-el-haija","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403076"},{"key":"ref5","first-page":"1725","article-title":"Simple and deep graph convolutional networks","author":"chen","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref8","article-title":"A fair comparison of graph neural networks for graph classification","author":"errica","year":"2019","journal-title":"arXiv 1912 09893"},{"key":"ref7","article-title":"Link prediction based on graph neural networks","author":"zhang","year":"2018","journal-title":"arXiv 1802 09691"},{"key":"ref2","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"arXiv 1609 02907"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403150"},{"key":"ref1","article-title":"Inductive representation learning on large graphs","author":"hamilton","year":"2017","journal-title":"arXiv 1706 02216"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2015.06.035"},{"key":"ref22","article-title":"Non-local graph neural networks","author":"liu","year":"2020","journal-title":"arXiv 2005 14612"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3437963.3441735"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86520-7_28"},{"key":"ref23","article-title":"Two sides of the same coin: Heterophily and oversmoothing in graph convolutional neural networks","author":"yan","year":"2021","journal-title":"arXiv 2102 06462"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.64.025102"},{"key":"ref25","first-page":"1","article-title":"Adaptive universal generalized pagerank graph neural network","author":"chien","year":"2021","journal-title":"Proc Int Conf Learn Represent"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09606682.pdf?arnumber=9606682","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:03:53Z","timestamp":1662667433000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9606682\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":38,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3126417","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2021]]}}}