The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
GraphLIME: Local Interpretable Model Explanations for Graph Neural Networks
Open accessAbstract
Graph structured data has wide applicability in various domains such as physics, chemistry, biology, computer vision, and social networks, to name a few. Recently, graph neural networks (GNN) were shown to be successful in effectively representing graph structured data because of their good performance and generalization ability. However, explaining the effectiveness of GNN models is a challenging task because of the complex nonlinear transformations made over the iterations. In this paper, we propose GraphLIME, a local interpretable model explanation for graphs using the Hilbert-Schmidt Independence Criterion (HSIC) Lasso, which is a nonlinear feature selection method. GraphLIME is a generic GNN-model explanation framework that learns a nonlinear interpretable model locally in the subgraph of the node being explained. Through experiments on two real-world datasets, the explanations of GraphLIME are found to be of extraordinary degree and more descriptive in comparison to the existing explanation methods.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Unified Approach to Interpreting Model Predictions
Lundberg, S., & Lee, S.-I. (2017) · arXiv · doi:10.48550/arxiv.1705.07874 · Cited by 23,707
"Why Should I Trust You?": Explaining the Predictions of Any Classifier
Ribeiro, M. T., Singh, S., & Guestrin, C. (2016) · Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2939672.2939778 · Cited by 17,555
Visualizing and understanding convolutional networks
Zeiler, M. D., & Fergus, R. (2014) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-10590-1_53 · Cited by 15,839
Gauriat, C.-M., Pencolé, Y., Ribot, P., & Brouillet, G. (2024) · HAL (Le Centre pour la Communication Scientifique Directe) · doi:10.4230/oasics.dx.2024.27 · Cited by 12,586
Veličković, P., Cucurull, G., Casanova, A., Romero, A., Liò, P., & Bengio, Y. (2017) · arXiv · doi:10.48550/arxiv.1710.10903 · Cited by 12,107
Inductive Representation Learning on Large Graphs
Hamilton, W. L., Ying, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1706.02216 · Cited by 10,639
Peng, H., Long, F., & Ding, C. (2005) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2005.159 · Cited by 10,544
The graph neural network model
Scarselli, F., Gori, M., Tsoi, A. C., Hagenbuchner, M., & Monfardini, G. (2009) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2008.2005605 · Cited by 9,582
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
“Why Should I Trust You?”: Explaining the Predictions of Any Classifier
Ribeiro, M., Singh, S., & Guestrin, C. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Demonstrations · doi:10.18653/v1/n16-3020 · Cited by 6,682
Axiomatic attribution for deep networks
Sundararajan, M., Taly, A., & Yan, Q. (2017) · arXiv · doi:10.48550/arxiv.1703.01365 · Cited by 4,087
A survey of deep neural network architectures and their applications
Liu, W., Wang, Z., Liu, X., Zeng, N., Liu, Y., & Alsaadi, F. E. (2017) · Neurocomputing · doi:10.1016/j.neucom.2016.12.038 · Cited by 3,239
Learning Important Features Through Propagating Activation Differences
Shrikumar, A., Greenside, P., & Kundaje, A. (2017) · arXiv · doi:10.48550/arxiv.1704.02685 · Cited by 2,761
Measuring Statistical Dependence with Hilbert-Schmidt Norms
Gretton, A., Bousquet, O., Smola, A., & Schölkopf, B. (2005) · Lecture Notes in Computer Science · doi:10.1007/11564089_7 · Cited by 1,560
Understanding Black-box Predictions via Influence Functions
Koh, P. W., & Liang, P. (2017) · arXiv · doi:10.48550/arxiv.1703.04730 · Cited by 1,514
Sanity Checks for Saliency Maps
Adebayo, J., Gilmer, J., Muelly, M., Goodfellow, I., Hardt, M., & Kim, B. (2018) · arXiv · doi:10.48550/arxiv.1810.03292 · Cited by 1,294
GNNExplainer: Generating Explanations for Graph Neural Networks
Ying, R., Bourgeois, D., You, J., Zitnik, M., & Leskovec, J. (2019) · arXiv · doi:10.48550/arxiv.1903.03894 · Cited by 850
OGB-LSC: A Large-Scale Challenge for Machine Learning on GraphsPreprint
Hu, W., Fey, M., Ren, H., Nakata, M., Dong, Y., & Leskovec, J. (2021) · arXiv (Cornell University) · doi:10.48550/arxiv.2103.09430 · Cited by 443
Parameterized Explainer for Graph Neural Network
Luo, D., Cheng, W., Xu, D., Yu, W., Zong, B., Chen, H., & Zhang, X. (2020) · arXiv · doi:10.48550/arxiv.2011.04573 · Cited by 355
Representer Point Selection for Explaining Deep Neural NetworksPreprint
Yeh, C., Kim, J. S., Yen, I. E.-H., & Ravikumar, P. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1811.09720 · Cited by 311
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
Yamada, M., Jitkrittum, W., Sigal, L., Xing, E. P., & Sugiyama, M. (2014) · Neural Computation · doi:10.1162/neco_a_00537 · Cited by 304
Self-citationGraph Classification using Structural Attention
Lee, J. B., Rossi, R., & Kong, X. (2018) · Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining · doi:10.1145/3219819.3219980 · Cited by 280
Explaining Data-Driven Document Classifications1
Martens, D., & Provost, F. (2014) · MIS Quarterly · doi:10.25300/misq/2014/38.1.04 · Cited by 264
GaAN: Gated Attention Networks for Learning on Large and Spatiotemporal Graphs
Zhang, J., Shi, X., Xie, J., Ma, H., King, I., & Yeung, D. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1803.07294 · Cited by 235
DeepRED – Rule Extraction from Deep Neural Networks
Zilke, J. R., Loza Mencía, E., & Janssen, F. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-46307-0_29 · Cited by 228
Stability Properties of Graph Neural Networks
Gama, F., Bruna, J., & Ribeiro, A. (2020) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2020.3026980 · Cited by 204
GraphSVX: Shapley Value Explanations for Graph Neural Networks
Duval, A., & Malliaros, F. D. (2021) · Lecture notes in computer science · doi:10.1007/978-3-030-86520-7_19 · Cited by 187
ANN-DT: an algorithm for extraction of decision trees from artificial neural networks
Schmitz, G. P. J., Aldrich, C., & Gouws, F. S. (1999) · IEEE Transactions on Neural Networks · doi:10.1109/72.809084 · Cited by 170
High-Dimensional Feature Selection by Feature-Wise Kernelized Lasso
Yamada, M., Jitkrittum, W., Sigal, L., Xing, E. P., & Sugiyama, M. (2018) · doi:10.1184/r1/6475769.v1 · Cited by 166
Self-citationRelEx: A Model-Agnostic Relational Model Explainer
Zhang, Y., DeFazio, D., & Ramesh, A. (2021) · Proceedings of the AAAI/ACM Conference on AI Ethics and Society · doi:10.1145/3461702.3462562 · Cited by 146
Stochastic Training of Graph Convolutional Networks with Variance Reduction
Chen, J., Zhu, J., & Song, L. (2018) · International Conference on Machine Learning · Cited by 142
Ultra High-Dimensional Nonlinear Feature Selection for Big Biological Data
Yamada, M., Tang, J., Lugo-Martinez, J., Hodzic, E., Shrestha, R., Saha, A., Ouyang, H. J., Yin, D., Mamitsuka, H., Şahinalp, S. C., et al. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2789451 · Cited by 94
Self-citationBlock HSIC Lasso: model-free biomarker detection for ultra-high dimensional data
Climente-González, H., Azencott, C., Samuel Kaski, A., & Yamada, M. (2019) · Bioinformatics · doi:10.1093/bioinformatics/btz333 · Cited by 83
Self-citationInterpretable & Explorable Approximations of Black Box Models
Lakkaraju, H., Kamar, E., Caruana, R., & Leskovec, J. (2017) · arXiv · doi:10.48550/arxiv.1707.01154 · Cited by 23
Cited by
A Perspective on Explainable Artificial Intelligence Methods: SHAP and LIME
Salih, A. M., Raisi‐Estabragh, Z., Galazzo, I. B., Radeva, P., Petersen, S. E., Lekadir, K., & Menegaz, G. (2025) · Advanced Intelligent Systems · doi:10.1002/aisy.202400304 · Cited by 897
Albahri, A. S., Duhaim, A. M., Fadhel, M. A., Alnoor, A., Baqer, N. S., Alzubaidi, L., Albahri, O. S., Alamoodi, A. H., Bai, J., Salhi, A., et al. (2023) · Information Fusion · doi:10.1016/j.inffus.2023.03.008 · Cited by 716
Survey of Explainable AI Techniques in Healthcare
Chaddad, A., Peng, J., Xu, J., & Bouridane, A. (2023) · Sensors · doi:10.3390/s23020634 · Cited by 591
Explainability in Graph Neural Networks: A Taxonomic Survey
Yuan, H., Yu, H., Gui, S., & Ji, S. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2022.3204236 · Cited by 583
Machine Learning Methods for Small Data Challenges in Molecular Science
Dou, B., Zhu, Z., Merkurjev, E., Ke, L., Chen, L., Jiang, J., Zhu, Y., Liu, J., Zhang, B., & Wei, G.-W. (2023) · Chemical Reviews · doi:10.1021/acs.chemrev.3c00189 · Cited by 499
Metadata
- Authors
- Huang, Q., Yamada, M., Tian, Y., Singh, D., & Chang, Y.
- Venue
- IEEE Transactions on Knowledge and Data Engineering
- Published
- 2023-07-01
- Volume
- 35
- Issue
- 7
- Pages
- 6968-6972
- ISSN
- 1041-4347 (ISSN-L)
- 1558-2191
- 2326-3865
- OpenAlex
- W3000120900
- Cited by
- 424
- References
- 34
- FWCI
- 24.80
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.