Abstract
In the last years, several research works have been proposed for the Knowledge Graph Completion task. However, like most Machine Learning models, most Knowledge Graph Completion models are opaque and lack interpretability. In order to achieve transparency, several interpretable and explainable models have been proposed. The Deterministic Local Interpretable Model-Agnostic Explanations (DLIME) was proposed to solve the lack of stability of the Local Interpretable Model-Agnostic Explanations (LIME), one of the most popular surrogate models. However, using DLIME to explain Machine Learning models in graphs becomes an issue due to its experiments being published only with tabular data. Therefore, this work aims to propose an interpretable method for graphs as an extension of DLIME named DLIME-Graphs. As a triple representation, DLIME-Graphs uses triple embeddings computed by SBERT which in turn, are reduced by the UMAP technique. Instead of using Hierarchical Clustering as DLIME, DLIME-Graphs uses HDB-SCAN to get clusters. To explain a test triple, DLIME-Graphs proposes to train two interpretable models: logistic regression and decision tree plus getting the most similar triples by a k-NN algorithm. The demonstration through a study case showed that DLIME-Graphs is able to give explanations for 100% of the triples in the test dataset through the former models offering transparency and interpretability.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
Notes
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
References
Bollacker, K., Evans, C., Paritosh, P., Sturge, T., Taylor, J.: Freebase: A collaboratively created graph database for structuring human knowledge. In: Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, pp. 1247–1250. SIGMOD 2008, Association for Computing Machinery, New York, NY, USA (2008). https://doi.org/10.1145/1376616.1376746. (event-place: Vancouver, Canada)
Bowman, S.R., Angeli, G., Potts, C., Manning, C.D.: A large annotated corpus for learning natural language inference. In: Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pp. 632–642. Association for Computational Linguistics, Lisbon, Portugal (2015). https://doi.org/10.18653/v1/D15-1075, https://aclanthology.org/D15-1075
Campello, R.J.G.B., Moulavi, D., Sander, J.: Density-based clustering based on hierarchical density estimates. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) Advances in Knowledge Discovery and Data Mining, LNAI, vol. 7819, pp. 160–172. Springer, Berlin (2013). https://doi.org/10.1007/978-3-642-37456-2_14
Chatzakis, M., Mountantonakis, M., Tzitzikas, Y.: RDFSIM: similarity-based browsing over dbpedia using embeddings. Information 12(11), 440 (2021)
Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol. 1 (Long and Short Papers). pp. 4171–4186. Association for Computational Linguistics, Minneapolis, Minnesota (2019). https://doi.org/10.18653/v1/N19-1423, https://aclanthology.org/N19-1423
Erhan, D., Bengio, Y., Courville, A., Vincent, P.: Visualizing higher-layer features of a deep network. Univ. Montreal 1341(3), 1 (2009)
Fionda, V., PirrÚ, G.: Learning triple embeddings from knowledge graphs. Proc. AAAI Conf. Artif. Intell. 34(04), 3874–3881 ( 2020). https://doi.org/10.1609/aaai.v34i04.5800, https://ojs.aaai.org/index.php/AAAI/article/view/5800
Ji, S., Pan, S., Cambria, E., Marttinen, P., Yu, P.S.: A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans. Neural Networks Learn. Syst. 33(2), 494–514 (2022). https://doi.org/10.1109/TNNLS.2021.3070843
Lakkaraju, H., Kamar, E., Caruana, R., Leskovec, J.: Interpretable & Explorable Approximations of Black Box Models. CoRR abs/1707.01154 (2017)
McInnes, L., Healy, J., Melville, J.: UMAP: Uniform Manifold Approximation and Projection for Dimension Reduction (2018). https://doi.org/10.48550/ARXIV.1802.03426
Miller, G.A.: WordNet: a lexical database for English. Commun. ACM 38(11), 39–41 (1995). https://doi.org/10.1145/219717.219748. (New York, NY, USA Publisher: Association for Computing Machinery)
Molnar, C.: Interpretable Machine Learning (2022)
Pedregosa, F., et al.: Scikit-learn: machine learning in python. J. Mach. Learn. Res. 12(85), 2825–2830 (2011). http://jmlr.org/papers/v12/pedregosa11a.html
Pezeshkpour, P., Tian, Y., Singh, S.: Investigating Robustness and Interpretability of Link Prediction via Adversarial Modifications. CoRR abs/1905.00563 (2019).
Rehman Zafar, M., Mefraz Khan, N.: Dlime: a deterministic local interpretable model-agnostic explanations approach for computer-aided diagnosis systems. arXiv e-prints arXiv-1906 (2019)
Reimers, N., Gurevych, I.: Sentence-BERT: sentence embeddings using siamese BERT-networks. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP). pp. 3982–3992. Association for Computational Linguistics, Hong Kong, China (2019). https://doi.org/10.18653/v1/D19-1410, https://aclanthology.org/D19-1410
Ribeiro, M.T., Singh, S., Guestrin, C.: “Why Should I Trust You?”: explaining the predictions of any classifier. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. pp. 1135–1144. KDD 2016. Association for Computing Machinery, New York, NY, USA (2016). https://doi.org/10.1145/2939672.2939778 (event-place: San Francisco, California, USA)
Suchanek, F.M., Kasneci, G., Weikum, G.: Yago: a core of semantic knowledge. In: Proceedings of the 16th International Conference on World Wide Web, pp. 697–706. WWW 2007. Association for Computing Machinery, New York, NY, USA (2007). https://doi.org/10.1145/1242572.1242667 (event-place: Banff, Alberta, Canada)
Vaswani, A., et al.: Attention is all you need. In: Proceedings of the 31st International Conference on Neural Information Processing Systems, pp. 6000–6010. NIPS 2017, Curran Associates Inc., Red Hook, NY, USA (2017) (event-place: Long Beach, California, USA)
Wang, K., Reimers, N., Gurevych, I.: TSDAE: using transformer-based sequential denoising auto-encoder for unsupervised sentence embedding learning. In: Findings of the Association for Computational Linguistics: EMNLP 2021, pp. 671–688. Association for Computational Linguistics, Punta Cana, Dominican Re-public (2021). https://doi.org/10.18653/v1/2021.findings-emnlp.59, https://aclanthology.org/2021.findings-emnlp.59
Wang, Q., et al.: CoKE: Contextualized Knowledge Graph Embedding. CoRR abs/1911.02168 (2019)
Williams, A., Nangia, N., Bowman, S.: A broad-coverage challenge corpus for sentence understanding through inference. In: Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol. 1 (Long Papers), pp. 1112–1122. Association for Computational Linguistics, New Orleans, Louisiana (2018). https://doi.org/10.18653/v1/N18-1101, https://aclanthology.org/N18-1101
Yao, L., Mao, C., Luo, Y.: KG-BERT: BERT for Knowledge Graph Completion. CoRR abs/1909.03193 (2019)
Ying, R., Bourgeois, D., You, J., Zitnik, M., Leskovec, J.: GNN Explainer: A Tool for Post-hoc Explanation of Graph Neural Networks. CoRR abs/1903.03894 (2019)
Zhang, W., Paudel, B., Zhang, W., Bernstein, A., Chen, H.: Interaction embeddings for prediction and explanation in knowledge graphs. In: Proceedings of the Twelfth ACM International Conference on Web Search and Data Mining, pp. 96–104. WSDM 2019. Association for Computing Machinery, New York, NY, USA (2019). https://doi.org/10.1145/3289600.3291014, (event-place: Melbourne VIC, Australia)
Acknowledgments
This research has been partially sponsored by VLIR-UOS Network University Cooperation Programme-Cuba.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
López, Y.A., Diez, H.R.G., Toledano-López, O.G., Hidalgo-Delgado, Y., Mannens, E., Demeester, T. (2022). DLIME-Graphs: A DLIME Extension Based on Triple Embedding for Graphs. In: Villazón-Terrazas, B., Ortiz-Rodriguez, F., Tiwari, S., Sicilia, MA., Martín-Moncunill, D. (eds) Knowledge Graphs and Semantic Web . KGSWC 2022. Communications in Computer and Information Science, vol 1686. Springer, Cham. https://doi.org/10.1007/978-3-031-21422-6_6
Download citation
DOI: https://doi.org/10.1007/978-3-031-21422-6_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-21421-9
Online ISBN: 978-3-031-21422-6
eBook Packages: Computer ScienceComputer Science (R0)