{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T20:48:12Z","timestamp":1754599692482,"version":"3.41.0"},"reference-count":46,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Basic Science Research Program through the National Research Foundation of Korea","award":["NRF-2017R1E1A1A03070105 and NRF-2019R1A5A1028324"],"award-info":[{"award-number":["NRF-2017R1E1A1A03070105 and NRF-2019R1A5A1028324"]}]},{"name":"Institute for Information & communications Technology Promotion (IITP) grant funded by the Korea government","award":["2019-0-01906"],"award-info":[{"award-number":["2019-0-01906"]}]},{"name":"Artificial Intelligence Graduate School Program"},{"DOI":"10.13039\/501100008122","name":"ITRC","doi-asserted-by":"crossref","award":["IITP-2018-0-01441"],"award-info":[{"award-number":["IITP-2018-0-01441"]}],"id":[{"id":"10.13039\/501100008122","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Intell. Syst. Technol."],"published-print":{"date-parts":[[2022,6,30]]},"abstract":"<jats:p>Learning graph-structured data with graph neural networks (GNNs) has been recently emerging as an important field because of its wide applicability in bioinformatics, chemoinformatics, social network analysis, and data mining. Recent GNN algorithms are based on neural message passing, which enables GNNs to integrate local structures and node features recursively. However, past GNN algorithms based on 1-hop neighborhood neural message passing are exposed to a risk of loss of information on local structures and relationships. In this article, we propose Neighborhood Edge AggregatoR (NEAR), a framework that aggregates relations between the nodes in the neighborhood via edges. NEAR, which can be orthogonally combined with Graph Isomorphism Network (GIN), gives integrated information that describes which nodes in the neighborhood are connected. Therefore, NEAR can reflect additional information of a local structure of each node beyond the nodes themselves in 1-hop neighborhood. Experimental results on multiple graph classification tasks show that our algorithm makes a good improvement over other existing 1-hop based GNN-based algorithms.<\/jats:p>","DOI":"10.1145\/3506714","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T11:44:15Z","timestamp":1650627855000},"page":"1-17","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["NEAR: Neighborhood Edge AggregatoR for Graph Classification"],"prefix":"10.1145","volume":"13","author":[{"given":"Cheolhyeong","family":"Kim","sequence":"first","affiliation":[{"name":"Pohang University of Science and Technology, Pohang. Gyeongbuk, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haeseong","family":"Moon","sequence":"additional","affiliation":[{"name":"University of California San Diego, San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3678-2687","authenticated-orcid":false,"given":"Hyung Ju","family":"Hwang","sequence":"additional","affiliation":[{"name":"Pohang University of Science and Technology, Pohang. Gyeongbuk, Republic of Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,22]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2005.132"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/BF01305232"},{"key":"e_1_3_1_4_2","article-title":"MolGAN: An implicit generative model for small molecular graphs","author":"Cao Nicola De","year":"2018","unstructured":"Nicola De Cao and Thomas Kipf. 2018. MolGAN: An implicit generative model for small molecular graphs. Retrieved from http:\/\/arxiv.org\/abs\/1805.11973.","journal-title":"R"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1039\/C8SC04228D"},{"key":"e_1_3_1_6_2","first-page":"3837","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems","author":"Defferrard Micha\u00ebl","year":"2016","unstructured":"Micha\u00ebl Defferrard, Xavier Bresson, and Pierre Vandergheynst. 2016. Convolutional neural networks on graphs with fast localized spectral filtering. In Proceedings of the Annual Conference on Neural Information Processing Systems. 3837\u20133845."},{"key":"e_1_3_1_7_2","unstructured":"B. Douglas. 2011. The Weisfeiler-Lehman Method and Graph Isomorphism Testing. Retrieved from https:\/\/arxiv.org\/abs\/1101.5211."},{"key":"e_1_3_1_8_2","first-page":"5724","volume-title":"Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada","author":"Du Simon S.","year":"2019","unstructured":"Simon S. Du, Kangcheng Hou, Ruslan Salakhutdinov, Barnab\u00e1s P\u00f3czos, Ruosong Wang, and Keyulu Xu. 2019. Graph neural tangent kernel: Fusing graph neural networks with graph kernels. In Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, NeurIPS 2019, December 8-14, 2019, Vancouver, BC, Canada. 5724\u20135734. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2019\/hash\/663fd3c5144fd10bd5ca6611a9a5b92d-Abstract.html."},{"key":"e_1_3_1_9_2","first-page":"6530","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems.","author":"Fout Alex","year":"2017","unstructured":"Alex Fout, Jonathon Byrd, Basir Shariat, and Asa Ben-Hur. 2017. Protein interface prediction using graph convolutional networks. In Proceedings of the Annual Conference on Neural Information Processing Systems.6530\u20136539. Retrieved from http:\/\/papers.nips.cc\/paper\/7231-protein-interface-prediction-using-graph-convolutional-networks."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.5555\/3305381.3305512"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"e_1_3_1_12_2","first-page":"2030","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems Advances in Neural Information Processing Systems","author":"Hamilton William L.","year":"2018","unstructured":"William L. Hamilton, Payal Bajaj, Marinka Zitnik, Dan Jurafsky, and Jure Leskovec. 2018. Embedding logical queries on knowledge graphs. In Proceedings of the Annual Conference on Neural Information Processing Systems Advances in Neural Information Processing Systems. 2030\u20132041. Retrieved from http:\/\/papers.nips.cc\/paper\/7473-embedding-logical-queries-on-knowledge-graphs."},{"key":"e_1_3_1_13_2","first-page":"1025","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems","author":"Hamilton William L.","year":"2017","unstructured":"William L. Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Proceedings of the Annual Conference on Neural Information Processing Systems. 1025\u20131035."},{"key":"e_1_3_1_14_2","first-page":"448","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","author":"Ioffe Sergey","year":"2015","unstructured":"Sergey Ioffe and Christian Szegedy. 2015. Batch normalization: Accelerating deep network training by reducing internal covariate shift. In Proceedings of the 32nd International Conference on Machine Learning. 448\u2013456."},{"key":"e_1_3_1_15_2","first-page":"2191","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"Ivanov Sergey","year":"2018","unstructured":"Sergey Ivanov and Evgeny Burnaev. 2018. Anonymous walk embeddings. In Proceedings of the 35th International Conference on Machine Learning. 2191\u20132200."},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3307339.3342161"},{"key":"e_1_3_1_17_2","first-page":"4289","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems","author":"Kazemi Seyed Mehran","year":"2018","unstructured":"Seyed Mehran Kazemi and David Poole. 2018. SimplE embedding for link prediction in knowledge graphs. In Proceedings of the Annual Conference on Neural Information Processing Systems. 4289\u20134300. Retrieved from http:\/\/papers.nips.cc\/paper\/7682-simple-embedding-for-link-prediction-in-knowledge-graphs."},{"key":"e_1_3_1_18_2","unstructured":"Kristian Kersting Nils M. Kriege Christopher Morris Petra Mutzel and Marion Neumann. 2016. Benchmark Data Sets for Graph Kernels. Retrieved from http:\/\/graphkernels.cs.tu-dortmund.de."},{"key":"e_1_3_1_19_2","volume-title":"Proceedings of the 3rd International Conference on Learning Representations","author":"Kingma Diederik P.","year":"2015","unstructured":"Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In Proceedings of the 3rd International Conference on Learning Representations. Retrieved from http:\/\/arxiv.org\/abs\/1412.6980."},{"key":"e_1_3_1_20_2","unstructured":"Thomas N. Kipf and Max Welling. 2016. Variational graph auto-encoders. Retrieved from http:\/\/arxiv.org\/abs\/1611.07308."},{"key":"e_1_3_1_21_2","volume-title":"Proceedings of the 5th International Conference on Learning Representations","author":"Kipf Thomas N.","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In Proceedings of the 5th International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=SJU4ayYgl."},{"key":"e_1_3_1_22_2","first-page":"4204","volume-title":"Proceedings of the Annual Conference on Advances in Neural Information Processing Systems","author":"Knyazev Boris","year":"2019","unstructured":"Boris Knyazev, Graham W. Taylor, and Mohamed Amer. 2019. Understanding attention and generalization in graph neural networks. In Proceedings of the Annual Conference on Advances in Neural Information Processing Systems. 4204\u20134214."},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1186\/s13321-020-00435-6"},{"key":"e_1_3_1_24_2","first-page":"3734","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research)","volume":"97","author":"Lee Junhyun","year":"2019","unstructured":"Junhyun Lee, Inyeop Lee, and Jaewoo Kang. 2019. Self-attention graph pooling. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.), Vol. 97. PMLR, 3734\u20133743. Retrieved from http:\/\/proceedings.mlr.press\/v97\/lee19c.html."},{"key":"e_1_3_1_25_2","first-page":"4212","volume-title":"Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research)","volume":"97","author":"Ma Jianxin","year":"2019","unstructured":"Jianxin Ma, Peng Cui, Kun Kuang, Xin Wang, and Wenwu Zhu. 2019. Disentangled graph convolutional networks. In Proceedings of the 36th International Conference on Machine Learning (Proceedings of Machine Learning Research), Kamalika Chaudhuri and Ruslan Salakhutdinov (Eds.), Vol. 97. PMLR, 4212\u20134221."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.576"},{"key":"e_1_3_1_27_2","first-page":"4602","volume-title":"Proceedings of the 33rd AAAI Conference on Artificial Intelligence, the 31st Innovative Applications of Artificial Intelligence Conference, the 9th AAAI Symposium on Educational Advances in Artificial Intelligence.","author":"Morris Christopher","year":"2019","unstructured":"Christopher Morris, Martin Ritzert, Matthias Fey, William L. Hamilton, Jan Eric Lenssen, Gaurav Rattan, and Martin Grohe. 2019. Weisfeiler and Lehman go neural: Higher-order graph neural networks. In Proceedings of the 33rd AAAI Conference on Artificial Intelligence, the 31st Innovative Applications of Artificial Intelligence Conference, the 9th AAAI Symposium on Educational Advances in Artificial Intelligence.4602\u20134609."},{"key":"e_1_3_1_28_2","first-page":"2014","volume-title":"Proceedings of the 33rd International Conference on Machine Learning","author":"Niepert Mathias","year":"2016","unstructured":"Mathias Niepert, Mohamed Ahmed, and Konstantin Kutzkov. 2016. Learning convolutional neural networks for graphs. In Proceedings of the 33rd International Conference on Machine Learning. 2014\u20132023."},{"key":"e_1_3_1_29_2","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems","author":"Nikolentzos Giannis","year":"2020","unstructured":"Giannis Nikolentzos and Michalis Vazirgiannis. 2020. Random walk graph neural networks. In Proceedings of the Annual Conference on Neural Information Processing Systems. Retrieved from https:\/\/proceedings.neurips.cc\/paper\/2020\/hash\/ba95d78a7c942571185308775a97a3a0-Abstract.html."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113538"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5997"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078187"},{"key":"e_1_3_1_34_2","first-page":"488","volume-title":"Proceedings of the 12th International Conference on Artificial Intelligence and Statistics","author":"Shervashidze Nino","year":"2009","unstructured":"Nino Shervashidze, S. V. N. Vishwanathan, Tobias Petri, Kurt Mehlhorn, and Karsten M. Borgwardt. 2009. Efficient graphlet kernels for large graph comparison. In Proceedings of the 12th International Conference on Artificial Intelligence and Statistics. 488\u2013495. Retrieved from http:\/\/proceedings.mlr.press\/v5\/shervashidze09a.html."},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.5555\/2627435.2670313"},{"key":"e_1_3_1_36_2","volume-title":"Proceedings of the 6th International Conference on Learning Representations","author":"Velickovic Petar","year":"2018","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Li\u00f2, and Yoshua Bengio. 2018. Graph attention networks. In Proceedings of the 6th International Conference on Learning Representations. Retrieved from https:\/\/openreview.net\/forum?id=rJXMpikCZ."},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313417"},{"issue":"9","key":"e_1_3_1_38_2","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 Boris","year":"1968","unstructured":"Boris Weisfeiler and Andrei A. Lehman. 1968. A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno-Technicheskaya Informatsia 2, 9 (1968), 12\u201316.","journal-title":"Nauchno-Technicheskaya Informatsia"},{"key":"e_1_3_1_39_2","doi-asserted-by":"publisher","DOI":"10.1039\/C7SC02664A"},{"key":"e_1_3_1_40_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.120.145301"},{"key":"e_1_3_1_41_2","volume-title":"Proceedings of the 7th International Conference on Learning Representations","author":"Xinyi Zhang","year":"2019","unstructured":"Zhang Xinyi and Lihui Chen. 2019. Capsule graph neural network. In Proceedings of the 7th International Conference on Learning Representations. OpenReview.net. Retrieved from https:\/\/openreview.net\/forum?id=Byl8BnRcYm."},{"key":"e_1_3_1_42_2","volume-title":"Proceedings of the International Conference on Learning Representations","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks? In Proceedings of the International Conference on Learning Representations."},{"key":"e_1_3_1_43_2","first-page":"5449","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"Xu Keyulu","year":"2018","unstructured":"Keyulu Xu, Chengtao Li, Yonglong Tian, Tomohiro Sonobe, Ken-ichi Kawarabayashi, and Stefanie Jegelka. 2018. Representation learning on graphs with jumping knowledge networks. In Proceedings of the 35th International Conference on Machine Learning. 5449\u20135458."},{"key":"e_1_3_1_44_2","first-page":"4805","volume-title":"Proceedings of the Annual Conference on Neural Information Processing Systems.","author":"Ying Zhitao","year":"2018","unstructured":"Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, William L. Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. In Proceedings of the Annual Conference on Neural Information Processing Systems.4805\u20134815."},{"key":"e_1_3_1_45_2","first-page":"6412","volume-title":"Proceedings of the Annual Conference on Advances in Neural Information Processing Systems","author":"You Jiaxuan","year":"2018","unstructured":"Jiaxuan You, Bowen Liu, Zhitao Ying, Vijay S. Pande, and Jure Leskovec. 2018. Graph convolutional policy network for goal-directed molecular graph generation. In Proceedings of the Annual Conference on Advances in Neural Information Processing Systems. 6412\u20136422. Retrieved from http:\/\/papers.nips.cc\/paper\/7877-graph-convolutional-policy-network-for-goal-directed-molecular-graph-generation."},{"key":"e_1_3_1_46_2","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_3_1_47_2","first-page":"3968","volume-title":"Proceedings of the Annual Conference on Advances in Neural Information Processing Systems.","author":"Zhang Zhen","year":"2018","unstructured":"Zhen Zhang, Mianzhi Wang, Yijian Xiang, Yan Huang, and Arye Nehorai. 2018. RetGK: Graph kernels based on return probabilities of random walks. In Proceedings of the Annual Conference on Advances in Neural Information Processing Systems.3968\u20133978."}],"container-title":["ACM Transactions on Intelligent Systems and Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3506714","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3506714","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:11:50Z","timestamp":1750191110000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3506714"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":46,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2022,6,30]]}},"alternative-id":["10.1145\/3506714"],"URL":"https:\/\/doi.org\/10.1145\/3506714","relation":{},"ISSN":["2157-6904","2157-6912"],"issn-type":[{"type":"print","value":"2157-6904"},{"type":"electronic","value":"2157-6912"}],"subject":[],"published":{"date-parts":[[2022,4,22]]},"assertion":[{"value":"2020-07-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-04-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}