{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,17]],"date-time":"2026-02-17T03:40:39Z","timestamp":1771299639538,"version":"3.50.1"},"reference-count":77,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T00:00:00Z","timestamp":1710201600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62025206, U23A20296"],"award-info":[{"award-number":["62025206, U23A20296"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009708","name":"Novo Nordisk Foundation","doi-asserted-by":"crossref","award":["NNF22OC0072415"],"award-info":[{"award-number":["NNF22OC0072415"]}],"id":[{"id":"10.13039\/501100009708","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1932574, ECCS-1933279, CNS-2028748, OAC-2104007"],"award-info":[{"award-number":["CNS-1932574, ECCS-1933279, CNS-2028748, OAC-2104007"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"Ningbo Municipal Bureau of Science and Technology","doi-asserted-by":"publisher","award":["2022A-237-G"],"award-info":[{"award-number":["2022A-237-G"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. ACM Manag. Data"],"published-print":{"date-parts":[[2024,3,12]]},"abstract":"<jats:p>Generating explanations for graph neural networks (GNNs) has been studied to understand their behaviors in analytical tasks such as graph classification. Existing approaches aim to understand the overall results of GNNs rather than providing explanations for specific class labels of interest, and may return explanation structures that are hard to access, nor directly queryable. We propose GVEX, a novel paradigm that generates Graph Views for GNN EXplanation. (1) We design a two-tier explanation structure called explanation views. An explanation view consists of a set of graph patterns and a set of induced explanation subgraphs. Given a database G of multiple graphs and a specific class label l assigned by a GNN-based classifier M, it concisely describes the fraction of G that best explains why l is assigned by M. (2) We propose quality measures and formulate an optimization problem to compute optimal explanation views for GNN explanation. We show that the problem is \u03a32P-hard. (3) We present two algorithms. The first one follows an explain-and-summarize strategy that first generates high-quality explanation subgraphs which best explain GNNs in terms of feature influence maximization, and then performs a summarization step to generate patterns. We show that this strategy provides an approximation ratio of 1\/2. Our second algorithm performs a single-pass to an input node stream in batches to incrementally maintain explanation views, having an anytime quality guarantee of 1\/4-approximation. Using real-world benchmark data, we experimentally demonstrate the effectiveness, efficiency, and scalability of GVEX. Through case studies, we showcase the practical applications of GVEX.<\/jats:p>","DOI":"10.1145\/3639295","type":"journal-article","created":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T18:51:32Z","timestamp":1711479092000},"page":"1-27","source":"Crossref","is-referenced-by-count":11,"title":["View-based Explanations for Graph Neural Networks"],"prefix":"10.1145","volume":"2","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-5635-9326","authenticated-orcid":false,"given":"Tingyang","family":"Chen","sequence":"first","affiliation":[{"name":"Zhejiang University, Ningbo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1044-5252","authenticated-orcid":false,"given":"Dazhuo","family":"Qiu","sequence":"additional","affiliation":[{"name":"Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3991-5155","authenticated-orcid":false,"given":"Yinghui","family":"Wu","sequence":"additional","affiliation":[{"name":"Case Western Reserve University, Cleveland, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7312-6312","authenticated-orcid":false,"given":"Arijit","family":"Khan","sequence":"additional","affiliation":[{"name":"Aalborg University, Aalborg, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8082-7398","authenticated-orcid":false,"given":"Xiangyu","family":"Ke","sequence":"additional","affiliation":[{"name":"Zhejiang University &amp; Zhejiang University, Ningbo, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3816-8450","authenticated-orcid":false,"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[{"name":"Zhejiang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,3,26]]},"reference":[{"key":"e_1_2_2_1_1","unstructured":"2024. Code and datasets. Tingyang Chen Dazhuo Qiu Yinghui Wu Arijit Khan Xiangyu Ke and Yunjun Gao. https:\/\/github.com\/ZJU-DAILY\/GVEX."},{"key":"e_1_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2019.00053"},{"key":"e_1_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/050643799"},{"key":"e_1_2_2_4_1","first-page":"5644","article-title":"Robust counterfactual explanations on graph neural networks","volume":"34","author":"Bajaj Mohit","year":"2021","unstructured":"Mohit Bajaj, Lingyang Chu, Zi Yu Xue, Jian Pei, Lanjun Wang, Peter Cho-Ho Lam, and Yong Zhang. 2021. Robust counterfactual explanations on graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 34 (2021), 5644--5655.","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"e_1_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1007"},{"key":"e_1_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/3301275.3302289"},{"key":"e_1_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/080733991"},{"key":"e_1_2_2_8_1","volume-title":"ACM-SIAM Symposium on Discrete Algorithms (SODA). 345--353","author":"Carr Robert D.","year":"2000","unstructured":"Robert D. Carr, Srinivas Doddi, Goran Konjevod, and Madhav Marathe. 2000. On the red-blue set cover problem. In ACM-SIAM Symposium on Discrete Algorithms (SODA). 345--353."},{"key":"e_1_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-015-0900-7"},{"key":"e_1_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00163"},{"key":"e_1_2_2_11_1","volume-title":"View-based Explanations for Graph Neural Networks (Full Extended Version). arXiv preprint: 2401.02086","author":"Chen Tingyang","year":"2024","unstructured":"Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, and Yunjun Gao. 2024. View-based Explanations for Graph Neural Networks (Full Extended Version). arXiv preprint: 2401.02086 (2024)."},{"key":"e_1_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020579"},{"key":"e_1_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0989"},{"key":"e_1_2_2_14_1","volume-title":"Towards prototype-based self-explainable graph neural network. arXiv preprint: 2210.01974","author":"Dai Enyan","year":"2022","unstructured":"Enyan Dai and Suhang Wang. 2022. Towards prototype-based self-explainable graph neural network. arXiv preprint: 2210.01974 (2022)."},{"key":"e_1_2_2_15_1","first-page":"13609","article-title":"Fairness in streaming submodular maximization: Algorithms and hardness","volume":"33","author":"Halabi Marwa El","year":"2020","unstructured":"Marwa El Halabi, Slobodan Mitrovi\u00b4c, Ashkan Norouzi-Fard, Jakab Tardos, and Jakub M Tarnawski. 2020. Fairness in streaming submodular maximization: Algorithms and hardness. Advances in Neural Information Processing Systems (NeurIPS) 33 (2020), 13609--13622.","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"e_1_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2489791"},{"key":"e_1_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2014.6816650"},{"key":"e_1_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.001"},{"key":"e_1_2_2_19_1","volume-title":"Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, NeurIPS Datasets and Benchmarks.","author":"Freitas Scott","year":"2021","unstructured":"Scott Freitas, Yuxiao Dong, Joshua Neil, and Duen Horng Chau. 2021. A large-scale database for graph representation learning. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, NeurIPS Datasets and Benchmarks."},{"key":"e_1_2_2_20_1","volume-title":"Bin Cui, and Hongzhi Yin.","author":"Gao Xinyi","year":"2022","unstructured":"Xinyi Gao, Wentao Zhang, Yingxia Shao, Quoc Viet Hung Nguyen, Bin Cui, and Hongzhi Yin. 2022. Efficient graph neural network inference at large scale. arXiv preprint: 2211.00495 (2022)."},{"key":"e_1_2_2_21_1","volume-title":"Allennlp: A deep semantic natural language processing platform. arXiv preprint","author":"Gardner Matt","year":"2018","unstructured":"Matt Gardner, Joel Grus, Mark Neumann, Oyvind Tafjord, Pradeep Dasigi, Nelson Liu, Matthew Peters, Michael Schmitz, and Luke Zettlemoyer. 2018. Allennlp: A deep semantic natural language processing platform. arXiv preprint: 1803.07640 (2018)."},{"key":"e_1_2_2_22_1","volume-title":"Graph neural networks: Adversarial robustness. Graph Neural Networks: Foundations, Frontiers, and Applications","author":"G\u00fcnnemann Stephan","year":"2022","unstructured":"Stephan G\u00fcnnemann. 2022. Graph neural networks: Adversarial robustness. Graph Neural Networks: Foundations, Frontiers, and Applications (2022), 149--176."},{"key":"e_1_2_2_23_1","unstructured":"Will Hamilton Zhitao Ying and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems (NeurIPS). 1024--1034."},{"key":"e_1_2_2_24_1","volume-title":"ACM International Conference on Management of Data (SIGMOD). 337--348","author":"Han Wook-Shin","year":"2013","unstructured":"Wook-Shin Han, Jinsoo Lee, and Jeong-Hoon Lee. 2013. Turboiso: Towards ultrafast and robust subgraph isomorphism search in large graph databases. In ACM International Conference on Management of Data (SIGMOD). 337--348."},{"key":"e_1_2_2_25_1","volume-title":"Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, NeurIPS Datasets and Benchmarks.","author":"Hu Weihua","year":"2021","unstructured":"Weihua Hu, Matthias Fey, Hongyu Ren, Maho Nakata, Yuxiao Dong, and Jure Leskovec. 2021. OGB-LSC: A large-scale challenge for machine learning on graphs. In Proceedings of the Neural Information Processing Systems Track on Datasets and Benchmarks 1, NeurIPS Datasets and Benchmarks."},{"key":"e_1_2_2_26_1","volume-title":"Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33","author":"Hu Weihua","year":"2020","unstructured":"Weihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong, Hongyu Ren, Bowen Liu, Michele Catasta, and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. Advances in neural information processing systems 33 (2020), 22118--22133."},{"key":"e_1_2_2_27_1","unstructured":"Weihua Hu Matthias Fey Marinka Zitnik Yuxiao Dong Hongyu Ren Bowen Liu Michele Catasta and Jure Leskovec. 2020. Open graph benchmark: Datasets for machine learning on graphs. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_2_2_28_1","volume-title":"Graphlime: Local interpretable model explanations for graph neural networks","author":"Huang Qiang","year":"2022","unstructured":"Qiang Huang, Makoto Yamada, Yuan Tian, Dinesh Singh, and Yi Chang. 2022. Graphlime: Local interpretable model explanations for graph neural networks. IEEE Transactions on Knowledge and Data Engineering (2022)."},{"key":"e_1_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/3539597.3570376"},{"key":"e_1_2_2_30_1","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Iyer Anand Padmanabha","year":"2018","unstructured":"Anand Padmanabha Iyer, Zaoxing Liu, Xin Jin, Shivaram Venkataraman, Vladimir Braverman, and Ion Stoica. 2018. ASAP: Fast, approximate graph pattern mining at scale. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18). 745--761."},{"key":"e_1_2_2_31_1","volume-title":"Drug--target affinity prediction using graph neural network and contact maps. RSC advances 10, 35","author":"Jiang Mingjian","year":"2020","unstructured":"Mingjian Jiang, Zhen Li, Shugang Zhang, Shuang Wang, Xiaofeng Wang, Qing Yuan, and Zhiqiang Wei. 2020. Drug--target affinity prediction using graph neural network and contact maps. RSC advances 10, 35 (2020), 20701--20712."},{"key":"e_1_2_2_32_1","first-page":"172","article-title":"Accelerating training and inference of graph neural networks with fast sampling and pipelining","volume":"4","author":"Kaler Tim","year":"2022","unstructured":"Tim Kaler, Nickolas Stathas, Anne Ouyang, Alexandros-Stavros Iliopoulos, Tao Schardl, Charles E Leiserson, and Jie Chen. 2022. Accelerating training and inference of graph neural networks with fast sampling and pipelining. Machine Learning and Systems (MLSys) 4 (2022), 172--189.","journal-title":"Machine Learning and Systems (MLSys)"},{"key":"e_1_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1021\/jm040835a"},{"key":"e_1_2_2_34_1","volume-title":"Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong.","author":"Kim Kyoungmin","year":"2018","unstructured":"Kyoungmin Kim, In Seo, Wook-Shin Han, Jeong-Hoon Lee, Sungpack Hong, Hassan Chafi, Hyungyu Shin, and Geonhwa Jeong. 2018. Turboflux: A fast continuous subgraph matching system for streaming graph data. In ACM International Conference on Management of Data (SIGMOD). 411--426."},{"key":"e_1_2_2_35_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Kingma Diederik P","year":"2015","unstructured":"Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_36_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Kipf Thomas N","year":"2017","unstructured":"Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_37_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Klicpera Johannes","year":"2019","unstructured":"Johannes Klicpera, Aleksandar Bojchevski, and Stephan G\u00fcnnemann. 2019. Predict then propagate: Graph neural networks meet personalized pageRank. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3286488"},{"key":"e_1_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407821"},{"key":"e_1_2_2_40_1","first-page":"19620","article-title":"Parameterized explainer for graph neural network","volume":"33","author":"Luo Dongsheng","year":"2020","unstructured":"Dongsheng Luo, Wei Cheng, Dongkuan Xu, Wenchao Yu, Bo Zong, Haifeng Chen, and Xiang Zhang. 2020. Parameterized explainer for graph neural network. Advances in Neural Information Processing Systems (NeurIPS) 33 (2020), 19620--19631.","journal-title":"Advances in Neural Information Processing Systems (NeurIPS)"},{"key":"e_1_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00278"},{"key":"e_1_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2206869.2206874"},{"key":"e_1_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.133"},{"key":"e_1_2_2_44_1","volume-title":"Completeness in the polynomial-time hierarchy: A compendium. SIGACT news 33, 3","author":"Schaefer Marcus","year":"2002","unstructured":"Marcus Schaefer and Christopher Umans. 2002. Completeness in the polynomial-time hierarchy: A compendium. SIGACT news 33, 3 (2002), 32--49."},{"key":"e_1_2_2_45_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Schlichtkrull Michael Sejr","year":"2021","unstructured":"Michael Sejr Schlichtkrull, Nicola De Cao, and Ivan Titov. 2021. Interpreting graph neural networks for nlp with differentiable edge masking. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-5308"},{"key":"e_1_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453899"},{"key":"e_1_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2018.2807442"},{"key":"e_1_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.5555\/1868843.1868844"},{"key":"e_1_2_2_50_1","volume-title":"Graph attention networks. arXiv preprint: 1710.10903","author":"Velickovic Petar","year":"2017","unstructured":"Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint: 1710.10903 (2017)."},{"key":"e_1_2_2_51_1","volume-title":"Counterfactual explanations for machine learning: Challenges revisited. arXiv preprint: 2106.07756","author":"Verma Sahil","year":"2021","unstructured":"Sahil Verma, John Dickerson, and Keegan Hines. 2021. Counterfactual explanations for machine learning: Challenges revisited. arXiv preprint: 2106.07756 (2021)."},{"key":"e_1_2_2_52_1","volume-title":"Neural architecture search for GNN-based graph classification. ACM Transactions on Information Systems","author":"Wei Lanning","year":"2023","unstructured":"Lanning Wei, Huan Zhao, Zhiqiang He, and Quanming Yao. 2023. Neural architecture search for GNN-based graph classification. ACM Transactions on Information Systems (2023)."},{"key":"e_1_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3494523"},{"key":"e_1_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.2978386"},{"key":"e_1_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.drudis.2021.02.011"},{"key":"e_1_2_2_56_1","volume-title":"International Conference on Learning Representations (ICLR).","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks?. In International Conference on Learning Representations (ICLR)."},{"key":"e_1_2_2_57_1","volume-title":"International Conference on Machine Learning (ICML). 5449--5458","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 International Conference on Machine Learning (ICML). 5449--5458."},{"key":"e_1_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v37i9.26267"},{"key":"e_1_2_2_59_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376662"},{"key":"e_1_2_2_60_1","volume-title":"IEEE International Conference on Data Mining (ICDM). 721--724","author":"Yan Xifeng","year":"2002","unstructured":"Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In IEEE International Conference on Data Mining (ICDM). 721--724."},{"key":"e_1_2_2_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783417"},{"key":"e_1_2_2_62_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33017370"},{"key":"e_1_2_2_63_1","volume-title":"Gnnexplainer: Generating explanations for graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 32","author":"Ying Zhitao","year":"2019","unstructured":"Zhitao Ying, Dylan Bourgeois, Jiaxuan You, Marinka Zitnik, and Jure Leskovec. 2019. Gnnexplainer: Generating explanations for graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 32 (2019)."},{"key":"e_1_2_2_64_1","volume-title":"Hierarchical graph representation learning with differentiable pooling. Advances in Neural Information Processing Systems (NeurIPS) 31","author":"Ying Zhitao","year":"2018","unstructured":"Zhitao Ying, Jiaxuan You, Christopher Morris, Xiang Ren, Will Hamilton, and Jure Leskovec. 2018. Hierarchical graph representation learning with differentiable pooling. Advances in Neural Information Processing Systems (NeurIPS) 31 (2018)."},{"key":"e_1_2_2_65_1","volume-title":"Graph convolutional policy network for goal-directed molecular graph generation. Advances in Neural Information Processing Systems (NeurIPS) 31","author":"You Jiaxuan","year":"2018","unstructured":"Jiaxuan You, Bowen Liu, Zhitao Ying, Vijay Pande, and Jure Leskovec. 2018. Graph convolutional policy network for goal-directed molecular graph generation. Advances in Neural Information Processing Systems (NeurIPS) 31 (2018)."},{"key":"e_1_2_2_66_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403085"},{"key":"e_1_2_2_67_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3204236"},{"key":"e_1_2_2_68_1","volume-title":"International Conference on Machine Learning (ICML). 12241--12252","author":"Yuan Hao","year":"2021","unstructured":"Hao Yuan, Haiyang Yu, Jie Wang, Kang Li, and Shuiwang Ji. 2021. On explainability of graph neural networks via subgraph explorations. In International Conference on Machine Learning (ICML). 12241--12252."},{"key":"e_1_2_2_69_1","doi-asserted-by":"crossref","unstructured":"Matthew D Zeiler and Rob Fergus. 2014. Visualizing and understanding convolutional networks. In Computer Vision (ECCV). 818--833.","DOI":"10.1007\/978-3-319-10590-1_53"},{"key":"e_1_2_2_70_1","doi-asserted-by":"publisher","DOI":"10.1145\/3468791.3468794"},{"key":"e_1_2_2_71_1","volume-title":"Link prediction based on graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 31","author":"Zhang Muhan","year":"2018","unstructured":"Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 31 (2018)."},{"key":"e_1_2_2_72_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11782"},{"key":"e_1_2_2_73_1","unstructured":"Shichang Zhang Yozen Liu Neil Shah and Yizhou Sun. 2022. GStarX: Explaining graph neural networks with structure-aware cooperative games. In Advances in Neural Information Processing Systems (NeurIPS)."},{"key":"e_1_2_2_74_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-019-00674-0"},{"key":"e_1_2_2_75_1","doi-asserted-by":"publisher","DOI":"10.14778\/3476249.3476295"},{"key":"e_1_2_2_76_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461547"},{"key":"e_1_2_2_77_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bty294"}],"container-title":["Proceedings of the ACM on Management of Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639295","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639295","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,21]],"date-time":"2025-08-21T15:17:55Z","timestamp":1755789475000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,12]]},"references-count":77,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,3,12]]}},"alternative-id":["10.1145\/3639295"],"URL":"https:\/\/doi.org\/10.1145\/3639295","relation":{},"ISSN":["2836-6573"],"issn-type":[{"value":"2836-6573","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,3,12]]}}}