{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T16:20:55Z","timestamp":1783614055079,"version":"3.55.0"},"reference-count":55,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61873288"],"award-info":[{"award-number":["61873288"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61972423"],"award-info":[{"award-number":["61972423"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Hunan Provincial Science and Technology Program","award":["2018WK4001"],"award-info":[{"award-number":["2018WK4001"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/tkde.2021.3105544","type":"journal-article","created":{"date-parts":[[2021,8,18]],"date-time":"2021-08-18T20:15:47Z","timestamp":1629317747000},"page":"1-1","source":"Crossref","is-referenced-by-count":38,"title":["Higher-order Interaction Goes Neural: A Substructure Assembling Graph Attention Network for Graph Classification"],"prefix":"10.1109","author":[{"given":"Jianliang","family":"Gao","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaoting","family":"Ying","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mingming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2017.2782278"},{"key":"ref2","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Duvenaud"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2016.03.014"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty440"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219980"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2751541"},{"key":"ref8","first-page":"1","article-title":"How powerful are graph neural networks?","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xu"},{"key":"ref9","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kipf"},{"key":"ref10","first-page":"1024","article-title":"Inductive representation learning on large graphs","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Hamilton"},{"key":"ref11","first-page":"1","article-title":"Graph attention networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Veli\u010dkovi\u0107"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/569"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3357384.3357815"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014072"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/7503.003.0186"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/360"},{"key":"ref19","first-page":"488","article-title":"Efficient graphlet kernels for large graph comparison","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Shervashidze"},{"key":"ref20","first-page":"2539","article-title":"Weisfeiler-Lehman graph kernels","volume":"12","author":"Shervashidze","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref21","first-page":"1615","article-title":"On valid optimal assignment kernels and applications to graph classification","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Kriege"},{"key":"ref22","first-page":"1","article-title":"subgraph2vec: Learning distributed representations of rooted sub-graphs from large graphs","author":"Narayanan","year":"2016"},{"key":"ref23","first-page":"5448","article-title":"A persistent Weisfeiler-Lehman procedure for graph classification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Rieck"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.42"},{"key":"ref25","first-page":"1615","article-title":"Wasserstein Weisfeiler-Lehman graph kernels","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Togninalli"},{"key":"ref26","first-page":"1106","article-title":"ImageNet classification with deep convolutional neural networks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Krizhevsky"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5987"},{"key":"ref28","first-page":"1","article-title":"Graph cross networks with vertex infomax pooling","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Li"},{"key":"ref29","first-page":"1","article-title":"Sampling and recovery of graph signals based on graph neural networks","author":"Chen","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-015-0872-1"},{"key":"ref31","first-page":"1","article-title":"LanczosNet: Multi-scale deep graph convolutional networks","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liao"},{"key":"ref32","first-page":"4800","article-title":"Hierarchical graph representation learning with differentiable pooling","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Ying"},{"key":"ref33","first-page":"6661","article-title":"Self-attention graph pooling","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3081010"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9029"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098015"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2018.8622263"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403081"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3425637"},{"key":"ref40","first-page":"21","article-title":"MixHop: Higher-order graph convolutional architectures via sparsified neighborhood mixing","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Abu-El-Haija"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00014"},{"key":"ref42","first-page":"1263","article-title":"Neural message passing for quantum chemistry","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gilmer"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/275"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897542"},{"issue":"9","key":"ref45","first-page":"12","article-title":"A reduction of a graph to a canonical form and an algebra arising during this reduction","volume":"2","author":"Weisfeiler","year":"1968","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"ref47","first-page":"1201","article-title":"Graph kernels","volume":"11","author":"Vishwanathan","year":"2010","journal-title":"J. Mach. Learn. Res."},{"key":"ref48","first-page":"3964","article-title":"RetGK: Graph kernels based on return probabilities of random walks","volume-title":"Proc. Int. Conf. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref49","first-page":"2014","article-title":"Learning convolutional neural networks for graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Niepert"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-01418-6_3"},{"key":"ref51","first-page":"17","article-title":"Capsule graph neural network","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Xinyi"},{"key":"ref52","first-page":"1","article-title":"Hierarchical graph pooling with structure learning","volume-title":"Proc. Conf. Assoc. Advancement Artif. Intell.","author":"Zhang"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17072"},{"key":"ref54","first-page":"1","article-title":"How to find your friendly neighborhood: Graph attention design with self-supervision","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Kim"},{"key":"ref55","first-page":"1","article-title":"A fair comparison of graph neural networks for graph classification","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Errica"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/4358933\/09516965.pdf?arnumber=9516965","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T23:37:36Z","timestamp":1705016256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9516965\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":55,"URL":"https:\/\/doi.org\/10.1109\/tkde.2021.3105544","relation":{},"ISSN":["1041-4347","1558-2191","2326-3865"],"issn-type":[{"value":"1041-4347","type":"print"},{"value":"1558-2191","type":"electronic"},{"value":"2326-3865","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}