Nothing Special   »   [go: up one dir, main page]

skip to main content
research-article

View-based Explanations for Graph Neural Networks

Published: 26 March 2024 Publication History

Abstract

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 Σ2P-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.

Supplemental Material

MP4 File
Slides; Presentation video; Poster
PDF File
Slides; Presentation video; Poster
PPTX File
Slides; Presentation video; Poster

References

[1]
2024. Code and datasets. Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, and Yunjun Gao. https://github.com/ZJU-DAILY/GVEX.
[2]
Zahi Ajami and Sara Cohen. 2019. Enumerating minimal weight set covers. In IEEE International Conference on Data Engineering (ICDE). 518--529.
[3]
Konstantin Avrachenkov, Nelly Litvak, Danil Nemirovsky, and Natalia Osipova. 2007. Monte Carlo methods in PageRank computation: When one iteration is sufficient. SIAM J. Numer. Anal. 45, 2 (2007), 890--904.
[4]
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.
[5]
Karsten M Borgwardt, Cheng Soon Ong, Stefan Schönauer, SVN Vishwanathan, Alex J Smola, and Hans-Peter Kriegel. 2005. Protein function prediction via graph kernels. Bioinformatics 21, suppl_1 (2005), i47--i56.
[6]
Carrie J Cai, Jonas Jongejan, and Jess Holbrook. 2019. The effects of example-based explanations in a machine learning interface. In Proceedings of the 24th International Conference on Intelligent User Interfaces. 258--262.
[7]
Gruia Calinescu, Chandra Chekuri, Martin Pal, and Jan Vondrák. 2011. Maximizing a monotone submodular function subject to a matroid constraint. SIAM J. Comput. 40, 6 (2011), 1740--1766.
[8]
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.
[9]
Amit Chakrabarti and Sagar Kale. 2015. Submodular maximization meets streaming: matchings, matroids, and more. Mathematical Programming 154 (2015), 225--247.
[10]
Chen Chen, Ye Yuan, Zhenyu Went, Guoren Wang, and Anteng Li. 2022. GQP: A framework for scalable and effective graph query-based pricing. In IEEE International Conference on Data Engineering (ICDE). 1573--1585.
[11]
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).
[12]
Eunjoon Cho, Seth A Myers, and Jure Leskovec. 2011. Friendship and mobility: user movement in location-based social networks. In ACM International Conference on Knowledge Discovery and Data Mining (KDD). 1082--1090.
[13]
Edith Cohen and David D Lewis. 1999. Approximating matrix multiplication for pattern recognition tasks. Journal of Algorithms 30, 2 (1999), 211--252.
[14]
Enyan Dai and Suhang Wang. 2022. Towards prototype-based self-explainable graph neural network. arXiv preprint: 2210.01974 (2022).
[15]
Marwa El Halabi, Slobodan Mitrovi´c, 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.
[16]
Wenfei Fan, Xin Wang, and Yinghui Wu. 2013. Incremental graph pattern matching. ACM Transactions on Database Systems (TODS) 38, 3 (2013), 1--47.
[17]
Wenfei Fan, Xin Wang, and Yinghui Wu. 2014. Answering graph pattern queries using views. In IEEE International Conference on Data Engineering (ICDE). 184--195.
[18]
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, and Eva-Marta Lundell. 2015. Induced subgraph isomorphism: Are some patterns substantially easier than others? Theoretical Computer Science 605 (2015), 119--128.
[19]
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.
[20]
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).
[21]
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).
[22]
Stephan Günnemann. 2022. Graph neural networks: Adversarial robustness. Graph Neural Networks: Foundations, Frontiers, and Applications (2022), 149--176.
[23]
Will Hamilton, Zhitao Ying, and Jure Leskovec. 2017. Inductive representation learning on large graphs. In Advances in Neural Information Processing Systems (NeurIPS). 1024--1034.
[24]
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.
[25]
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.
[26]
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.
[27]
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).
[28]
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).
[29]
Zexi Huang, Mert Kosan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2023. Global counterfactual explainer for graph neural networks. In ACM International Conference on Web Search and Data Mining (WSDM). 141--149.
[30]
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.
[31]
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.
[32]
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.
[33]
Jeroen Kazius, Ross McGuire, and Roberta Bursi. 2005. Derivation and validation of toxicophores for mutagenicity prediction. Journal of Medicinal Chemistry 48, 1 (2005), 312--320.
[34]
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.
[35]
Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In International Conference on Learning Representations (ICLR).
[36]
Thomas N Kipf and Max Welling. 2017. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations (ICLR).
[37]
Johannes Klicpera, Aleksandar Bojchevski, and Stephan Günnemann. 2019. Predict then propagate: Graph neural networks meet personalized pageRank. In International Conference on Learning Representations (ICLR).
[38]
Peng Lin, Qi Song, Yinghui Wu, and Jiaxing Pi. 2019. Discovering patterns for fact checking in knowledge graphs. Journal of Data and Information Quality (JDIQ) 11, 3 (2019), 1--27.
[39]
Yin Lin, Yifan Guan, Abolfazl Asudeh, and HV Jagadish. 2020. Identifying insufficient data coverage in databases with multiple relations. Proc. VLDB Endow. 13, 11 (2020).
[40]
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.
[41]
Hanchao Ma, Sheng Guan, Mengying Wang, Yen-shuo Chang, and Yinghui Wu. 2022. Subgraph query generation with fairness and diversity constraints. In IEEE International Conference on Data Engineering (ICDE). 3106--3118.
[42]
Imene Mami and Zohra Bellahsene. 2012. A survey of view selection methods. ACM SIGMOD Record 41, 1 (2012), 20--29.
[43]
Sayan Ranu and Ambuj K Singh. 2009. Graphsig: A scalable approach to mining significant subgraphs in large graph databases. In 2009 IEEE 25th International Conference on Data Engineering. IEEE, 844--855.
[44]
Marcus Schaefer and Christopher Umans. 2002. Completeness in the polynomial-time hierarchy: A compendium. SIGACT news 33, 3 (2002), 32--49.
[45]
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).
[46]
Robert Schwarzenberg, Marc Hübner, David Harbecke, Christoph Alt, and Leonhard Hennig. 2019. Layerwise relevance visualization in convolutional text graph classifiers. In Workshop on Graph-Based Methods for Natural Language Processing (TextGraphs@EMNLP). 58--62.
[47]
Haichuan Shang, Ying Zhang, Xuemin Lin, and Jeffrey Xu Yu. 2008. Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1, 1 (2008), 364--375.
[48]
Qi Song, Yinghui Wu, Peng Lin, Luna Xin Dong, and Hui Sun. 2018. Mining summaries for knowledge graph search. IEEE Transactions on Knowledge and Data Engineering 30, 10 (2018), 1887--1900.
[49]
Marisa Thoma, Hong Cheng, Arthur Gretton, Jiawei Han, Hans-Peter Kriegel, Alex Smola, Le Song, Philip S Yu, Xifeng Yan, and Karsten M Borgwardt. 2010. Discriminative frequent subgraph mining with optimality guarantees. Statistical Analysis and Data Mining: The ASA Data Science Journal 3, 5 (2010), 302--318.
[50]
Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. arXiv preprint: 1710.10903 (2017).
[51]
Sahil Verma, John Dickerson, and Keegan Hines. 2021. Counterfactual explanations for machine learning: Challenges revisited. arXiv preprint: 2106.07756 (2021).
[52]
Lanning Wei, Huan Zhao, Zhiqiang He, and Quanming Yao. 2023. Neural architecture search for GNN-based graph classification. ACM Transactions on Information Systems (2023).
[53]
Shiwen Wu, Fei Sun, Wentao Zhang, Xu Xie, and Bin Cui. 2022. Graph neural networks in recommender systems: a survey. Comput. Surveys 55, 5 (2022), 1--37.
[54]
Zonghan Wu, Shirui Pan, Fengwen Chen, Guodong Long, Chengqi Zhang, and S Yu Philip. 2020. A comprehensive survey on graph neural networks. IEEE Transactions on Neural Networks and Learning Systems 32, 1 (2020), 4--24.
[55]
Jiacheng Xiong, Zhaoping Xiong, Kaixian Chen, Hualiang Jiang, and Mingyue Zheng. 2021. Graph neural networks for automated de novo drug design. Drug Discovery Today 26, 6 (2021), 1382--1393.
[56]
Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. 2019. How powerful are graph neural networks?. In International Conference on Learning Representations (ICLR).
[57]
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.
[58]
Han Xuanyuan, Pietro Barbiero, Dobrik Georgiev, Lucie Charlotte Magister, and Pietro Lio. 2023. Global concept-based interpretability for graph neural networks via neuron analysis. In Proceedings of the AAAI Conference on Artificial Intelligence, Vol. 37. 10675--10683.
[59]
Xifeng Yan, Hong Cheng, Jiawei Han, and Philip S Yu. 2008. Mining significant graph patterns by leap search. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data. 433--444.
[60]
Xifeng Yan and Jiawei Han. 2002. gspan: Graph-based substructure pattern mining. In IEEE International Conference on Data Mining (ICDM). 721--724.
[61]
Pinar Yanardag and SVN Vishwanathan. 2015. Deep graph kernels. In ACM International Conference on Knowledge Discovery and Data Mining (KDD). 1365--1374.
[62]
Liang Yao, Chengsheng Mao, and Yuan Luo. 2019. Graph convolutional networks for text classification. In AAAI Conference on Artificial Intelligence, Vol. 33. 7370--7377.
[63]
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).
[64]
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).
[65]
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).
[66]
Hao Yuan, Jiliang Tang, Xia Hu, and Shuiwang Ji. 2020. Xgnn: Towards model-level explanations of graph neural networks. In ACM international conference on knowledge discovery and data mining (KDD). 430--438.
[67]
Hao Yuan, Haiyang Yu, Shurui Gui, and Shuiwang Ji. 2023. Explainability in graph neural networks: A taxonomic survey. IEEE Transactions on Pattern Analysis and Machine Intelligence 45, 5 (2023), 5782--5799.
[68]
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.
[69]
Matthew D Zeiler and Rob Fergus. 2014. Visualizing and understanding convolutional networks. In Computer Vision (ECCV). 818--833.
[70]
Chao Zhang, Jiaheng Lu, Qingsong Guo, Xinyong Zhang, Xiaochun Han, and Minqi Zhou. 2021. Automatic view selection in graph databases. In International Conference on Scientific and Statistical Database Management (SSDBM). 197--202.
[71]
Muhan Zhang and Yixin Chen. 2018. Link prediction based on graph neural networks. Advances in Neural Information Processing Systems (NeurIPS) 31 (2018).
[72]
Muhan Zhang, Zhicheng Cui, Marion Neumann, and Yixin Chen. 2018. An end-to-end deep learning architecture for graph classification. In AAAI Conference on Artificial Intelligence, Vol. 32.
[73]
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).
[74]
Tianming Zhang, Yunjun Gao, Linshan Qiu, Lu Chen, Qingyuan Linghu, and Shiliang Pu. 2020. Distributed time-respecting flow graph pattern matching on temporal graphs. World Wide Web 23 (2020), 609--630.
[75]
Wentao Zhang, Zhi Yang, Yexin Wang, Yu Shen, Yang Li, Liang Wang, and Bin Cui. 2021. Grain: Improving data efficiency of graph neural networks via diversified influence maximization. Proc. VLDB Endow. 14, 11 (2021), 2473--2482.
[76]
Hongkuan Zhou, Ajitesh Srivastava, Hanqing Zeng, Rajgopal Kannan, and Viktor Prasanna. 2021. Accelerating large scale real-time GNN inference using channel pruning. Proc. VLDB Endow. 14, 9 (2021).
[77]
Marinka Zitnik, Monica Agrawal, and Jure Leskovec. 2018. Modeling polypharmacy side effects with graph convolutional networks. Bioinformatics 34, 13 (2018), i457--i466.

Cited By

View all
  • (2024)Knowledge Graphs for Responsible AIProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679085(5596-5598)Online publication date: 21-Oct-2024
  • (2024)Synergies Between Graph Data Management and Machine Learning in Graph Data Pipeline2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00457(5655-5656)Online publication date: 13-May-2024
  • (2024)Generating Robust Counterfactual Witnesses for Graph Neural Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00259(3351-3363)Online publication date: 13-May-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Management of Data
Proceedings of the ACM on Management of Data  Volume 2, Issue 1
SIGMOD
February 2024
1874 pages
EISSN:2836-6573
DOI:10.1145/3654807
Issue’s Table of Contents
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than the author(s) must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2024
Published in PACMMOD Volume 2, Issue 1

Permissions

Request permissions for this article.

Author Tags

  1. approximation algorithm
  2. data mining
  3. deep learning
  4. explainable ai
  5. graph neural networks
  6. graph views

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)258
  • Downloads (Last 6 weeks)61
Reflects downloads up to 18 Nov 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Knowledge Graphs for Responsible AIProceedings of the 33rd ACM International Conference on Information and Knowledge Management10.1145/3627673.3679085(5596-5598)Online publication date: 21-Oct-2024
  • (2024)Synergies Between Graph Data Management and Machine Learning in Graph Data Pipeline2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00457(5655-5656)Online publication date: 13-May-2024
  • (2024)Generating Robust Counterfactual Witnesses for Graph Neural Networks2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00259(3351-3363)Online publication date: 13-May-2024
  • (2024)GL-GNN: Graph learning via the network of graphsKnowledge-Based Systems10.1016/j.knosys.2024.112107299(112107)Online publication date: Sep-2024
  • (2024)A review of sentiment analysis: tasks, applications, and deep learning techniquesInternational Journal of Data Science and Analytics10.1007/s41060-024-00594-xOnline publication date: 1-Jul-2024

View Options

Login options

Full Access

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media