Skip to main content

2023 | OriginalPaper | Buchkapitel

Effects of Locality and Rule Language on Explanations for Knowledge Graph Embeddings

verfasst von : Luis Galárraga

Erschienen in: Advances in Intelligent Data Analysis XXI

Verlag: Springer Nature Switzerland

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

Knowledge graphs (KGs) are key tools in many AI-related tasks such as reasoning or question answering. This has, in turn, propelled research in link prediction in KGs, the task of predicting missing relationships from the available knowledge. Solutions based on KG embeddings have shown promising results in this matter. On the downside, these approaches are usually unable to explain their predictions. While some works have proposed to compute post-hoc rule explanations for embedding-based link predictors, these efforts have mostly resorted to rules with unbounded atoms, e.g., \(\textit{bornIn}(x,y) \Rightarrow \textit{residence}(x,y)\), learned on a global scope, i.e., the entire KG. None of these works has considered the impact of rules with bounded atoms such as \(\textit{nationality}(x,\textit{England}) \Rightarrow \textit{speaks}(x, \textit{English})\), or the impact of learning from regions of the KG, i.e., local scopes. We therefore study the effects of these factors on the quality of rule-based explanations for embedding-based link predictors. Our results suggest that more specific rules and local scopes can improve the accuracy of the explanations. Moreover, these rules can provide further insights about the inner-workings of KG embeddings for link prediction.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
Most methods embed the entities in real spaces, i.e., in \(\mathbb {R}^k\), but a few, e.g.,[31] resort to vectors of complex numbers.
 
2
\(\oplus \) denotes concatenation; sub-contexts are corrupted to obtain counter-examples.
 
3
These are safe rules where each variable occurs in at least 2 atoms.
 
4
Rule (8), on the other hand, refers to a women’s football team.
 
Literatur
1.
Zurück zum Zitat UniKER: a unified framework for combining embedding and horn rules for knowledge graph inference. In: ICML Workshop on Graph Representation Learning and Beyond (GRL+) (2020) UniKER: a unified framework for combining embedding and horn rules for knowledge graph inference. In: ICML Workshop on Graph Representation Learning and Beyond (GRL+) (2020)
2.
Zurück zum Zitat Ahmadi, N., Huynh, V.-P., Meduri, V., Ortona, S., Papotti, P.: Mining expressive rules in knowledge graphs. J. Data Inf. Qual. 1(1) (2019) Ahmadi, N., Huynh, V.-P., Meduri, V., Ortona, S., Papotti, P.: Mining expressive rules in knowledge graphs. J. Data Inf. Qual. 1(1) (2019)
3.
Zurück zum Zitat Akrami, F., Saeef, M.S., Zhang, Q., Hu, W., Li, C.: Realistic re-evaluation of knowledge graph completion methods: an experimental study. In: ACM SIGMOD Conference (2020) Akrami, F., Saeef, M.S., Zhang, Q., Hu, W., Li, C.: Realistic re-evaluation of knowledge graph completion methods: an experimental study. In: ACM SIGMOD Conference (2020)
4.
Zurück zum Zitat Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, vol. 26 (2013) Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, vol. 26 (2013)
5.
Zurück zum Zitat Boschin, A: TorchKGE: knowledge graph embedding in Python and PyTorch. In: International Workshop on Knowledge Graphs (2020) Boschin, A: TorchKGE: knowledge graph embedding in Python and PyTorch. In: International Workshop on Knowledge Graphs (2020)
6.
Zurück zum Zitat Boschin, A., Jain, N., Keretchashvili, G., Suchanek, F.: Combining embeddings and rules for fact prediction. In: International Research School in AI in Bergen, Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022) Boschin, A., Jain, N., Keretchashvili, G., Suchanek, F.: Combining embeddings and rules for fact prediction. In: International Research School in AI in Bergen, Schloss Dagstuhl-Leibniz-Zentrum für Informatik (2022)
7.
Zurück zum Zitat Carmona, I.S., Riedel, S.: Extracting interpretable models from matrix factorization models. In: International Conference on Cognitive Computation (2015) Carmona, I.S., Riedel, S.: Extracting interpretable models from matrix factorization models. In: International Conference on Cognitive Computation (2015)
8.
Zurück zum Zitat Chen, Y., Wang, D.Z., Goldberg, S.: ScaLeKB: scalable learning and inference over large knowledge bases. VLDB J. 25(6) (2016) Chen, Y., Wang, D.Z., Goldberg, S.: ScaLeKB: scalable learning and inference over large knowledge bases. VLDB J. 25(6) (2016)
10.
Zurück zum Zitat Galárraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE+. VLDB J. 24(6) (2015) Galárraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE+. VLDB J. 24(6) (2015)
11.
Zurück zum Zitat Guo, S., et al.: Knowledge graph embedding preserving soft logical regularity. In: International Conference on Knowledge Management (2020) Guo, S., et al.: Knowledge graph embedding preserving soft logical regularity. In: International Conference on Knowledge Management (2020)
12.
Zurück zum Zitat Hou, Z., Jin, X., Li, Z., Bai, L.: Rule-aware reinforcement learning for knowledge graph reasoning. In: ACL/IJCNLP (Findings) (2021) Hou, Z., Jin, X., Li, Z., Bai, L.: Rule-aware reinforcement learning for knowledge graph reasoning. In: ACL/IJCNLP (Findings) (2021)
14.
Zurück zum Zitat Ji, S., Pan, S., Cambria, E., Marttinen, P., Yu, P.S.: A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans. Neural Netw. Learn. Syst. 33(2) (2022) Ji, S., Pan, S., Cambria, E., Marttinen, P., Yu, P.S.: A survey on knowledge graphs: representation, acquisition, and applications. IEEE Trans. Neural Netw. Learn. Syst. 33(2) (2022)
16.
Zurück zum Zitat Lao, N., Mitchell, T., Cohen, W.W.: Random walk inference and learning in a large scale knowledge base. In: Conference on Empirical Methods in Natural Language Processing (2011) Lao, N., Mitchell, T., Cohen, W.W.: Random walk inference and learning in a large scale knowledge base. In: Conference on Empirical Methods in Natural Language Processing (2011)
17.
Zurück zum Zitat Meilicke, C., Betz, P., Stuckenschmidt, H.: Why a Naive way to combine symbolic and latent knowledge base completion works surprisingly well. In: 3rd Conference on Automated Knowledge Base Construction (2021) Meilicke, C., Betz, P., Stuckenschmidt, H.: Why a Naive way to combine symbolic and latent knowledge base completion works surprisingly well. In: 3rd Conference on Automated Knowledge Base Construction (2021)
18.
19.
Zurück zum Zitat Meng, C., Cheng, R., Maniu, S., Senellart, P., Zhang, W.: Discovering meta-paths in large heterogeneous information networks. In: The Web Conference (2015) Meng, C., Cheng, R., Maniu, S., Senellart, P., Zhang, W.: Discovering meta-paths in large heterogeneous information networks. In: The Web Conference (2015)
20.
Zurück zum Zitat Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. In: Conference of the North American Chapter of the Association for Computational Linguistics (2018) Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. In: Conference of the North American Chapter of the Association for Computational Linguistics (2018)
21.
Zurück zum Zitat Nickel, M., Rosasco, L., Poggio, T.: Holographic embeddings of knowledge graphs. In: AAAI Conference on Artificial Intelligence (2016) Nickel, M., Rosasco, L., Poggio, T.: Holographic embeddings of knowledge graphs. In: AAAI Conference on Artificial Intelligence (2016)
23.
Zurück zum Zitat Peake, G., Wang, J.: Explanation mining: post hoc interpretability of latent factor models for recommendation systems. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2018) Peake, G., Wang, J.: Explanation mining: post hoc interpretability of latent factor models for recommendation systems. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2018)
24.
Zurück zum Zitat Ribeiro, M.T., Singh, S., Guestrin, C.: Why should I trust you?: explaining the predictions of any classifier. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2016) Ribeiro, M.T., Singh, S., Guestrin, C.: Why should I trust you?: explaining the predictions of any classifier. In: ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (2016)
25.
Zurück zum Zitat Rocktäschel, T., Riedel, S.: End-to-end differentiable proving. In: Conference on Neural Information Processing Systems (2017) Rocktäschel, T., Riedel, S.: End-to-end differentiable proving. In: Conference on Neural Information Processing Systems (2017)
27.
Zurück zum Zitat Sanchez, I., Rocktaschel, T., Riedel, S., Singh, S.: Towards extracting faithful and descriptive representations of latent variable models. In: AAAI Spring Symposium on Knowledge Representation and Reasoning (2015) Sanchez, I., Rocktaschel, T., Riedel, S., Singh, S.: Towards extracting faithful and descriptive representations of latent variable models. In: AAAI Spring Symposium on Knowledge Representation and Reasoning (2015)
28.
Zurück zum Zitat Shang, C., Tang, Y., Huang, J., Bi, J., He, X., Zhou, B.: End-to-end structure-aware convolutional networks for knowledge base completion. In: AAAI Conference on Artificial Intelligence (2019) Shang, C., Tang, Y., Huang, J., Bi, J., He, X., Zhou, B.: End-to-end structure-aware convolutional networks for knowledge base completion. In: AAAI Conference on Artificial Intelligence (2019)
29.
Zurück zum Zitat Socher, R., Chen, D., Manning, C.D., Ng, A.Y.: Reasoning with neural tensor networks for knowledge base completion. In: Conference on Neural Information Processing Systems (2013) Socher, R., Chen, D., Manning, C.D., Ng, A.Y.: Reasoning with neural tensor networks for knowledge base completion. In: Conference on Neural Information Processing Systems (2013)
30.
Zurück zum Zitat Sun, Z., Deng, Z.-H., Nie, J.-Y., Tang, J.: RotatE: knowledge graph embedding by relational rotation in complex space. In: International Conference on Learning Representations (2019) Sun, Z., Deng, Z.-H., Nie, J.-Y., Tang, J.: RotatE: knowledge graph embedding by relational rotation in complex space. In: International Conference on Learning Representations (2019)
31.
Zurück zum Zitat Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., Bouchard, G.: Complex embeddings for simple link prediction. In: International Conference on Machine Learning (2016) Trouillon, T., Welbl, J., Riedel, S., Gaussier, É., Bouchard, G.: Complex embeddings for simple link prediction. In: International Conference on Machine Learning (2016)
32.
Zurück zum Zitat Wagner, C., Graells-Garrido, E., Garcia, D., Menczer, F.: Women through the glass ceiling: gender asymmetries in Wikipedia. EPJ Data Sci. 5, 1–24 (2016)CrossRef Wagner, C., Graells-Garrido, E., Garcia, D., Menczer, F.: Women through the glass ceiling: gender asymmetries in Wikipedia. EPJ Data Sci. 5, 1–24 (2016)CrossRef
33.
Zurück zum Zitat Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: AAAI Conference on Artificial Intelligence, vol. 28, no. 1 (2014) Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: AAAI Conference on Artificial Intelligence, vol. 28, no. 1 (2014)
34.
Zurück zum Zitat Yang, B., Yih, S.W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: International Conference on Learning Representations (2015) Yang, B., Yih, S.W., He, X., Gao, J., Deng, L.: Embedding entities and relations for learning and inference in knowledge bases. In: International Conference on Learning Representations (2015)
35.
Zurück zum Zitat Zhang, W., et al.: Iteratively learning embeddings and rules for knowledge graph reasoning. In: The Web Conference (2019) Zhang, W., et al.: Iteratively learning embeddings and rules for knowledge graph reasoning. In: The Web Conference (2019)
36.
Zurück zum Zitat Zhang, Y., Yao, Q., Chen, L.: Efficient, Simple and Automated Negative Sampling for Knowledge Graph Embedding (2020) Zhang, Y., Yao, Q., Chen, L.: Efficient, Simple and Automated Negative Sampling for Knowledge Graph Embedding (2020)
Metadaten
Titel
Effects of Locality and Rule Language on Explanations for Knowledge Graph Embeddings
verfasst von
Luis Galárraga
Copyright-Jahr
2023
DOI
https://doi.org/10.1007/978-3-031-30047-9_12

Premium Partner