Generating $SROI^-$ Ontologies via Knowledge Graph Query Embedding Learning
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866910577604952064 |
|---|---|
| author | He, Yunjie Hernandez, Daniel Nayyeri, Mojtaba Xiong, Bo Zhu, Yuqicheng Kharlamov, Evgeny Staab, Steffen |
| author_facet | He, Yunjie Hernandez, Daniel Nayyeri, Mojtaba Xiong, Bo Zhu, Yuqicheng Kharlamov, Evgeny Staab, Steffen |
| contents | Query embedding approaches answer complex logical queries over incomplete knowledge graphs (KGs) by computing and operating on low-dimensional vector representations of entities, relations, and queries. However, current query embedding models heavily rely on excessively parameterized neural networks and cannot explain the knowledge learned from the graph. We propose a novel query embedding method, AConE, which explains the knowledge learned from the graph in the form of $SROI^-$ description logic axioms while being more parameter-efficient than most existing approaches. AConE associates queries to a $SROI^-$ description logic concept. Every $SROI^-$ concept is embedded as a cone in complex vector space, and each $SROI^-$ relation is embedded as a transformation that rotates and scales cones. We show theoretically that AConE can learn $SROI^-$ axioms, and defines an algebra whose operations correspond one to one to $SROI^-$ description logic concept constructs. Our empirical study on multiple query datasets shows that AConE achieves superior results over previous baselines with fewer parameters. Notably on the WN18RR dataset, AConE achieves significant improvement over baseline models. We provide comprehensive analyses showing that the capability to represent axioms positively impacts the results of query answering. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_09212 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Generating $SROI^-$ Ontologies via Knowledge Graph Query Embedding Learning He, Yunjie Hernandez, Daniel Nayyeri, Mojtaba Xiong, Bo Zhu, Yuqicheng Kharlamov, Evgeny Staab, Steffen Artificial Intelligence Databases Machine Learning Logic in Computer Science Query embedding approaches answer complex logical queries over incomplete knowledge graphs (KGs) by computing and operating on low-dimensional vector representations of entities, relations, and queries. However, current query embedding models heavily rely on excessively parameterized neural networks and cannot explain the knowledge learned from the graph. We propose a novel query embedding method, AConE, which explains the knowledge learned from the graph in the form of $SROI^-$ description logic axioms while being more parameter-efficient than most existing approaches. AConE associates queries to a $SROI^-$ description logic concept. Every $SROI^-$ concept is embedded as a cone in complex vector space, and each $SROI^-$ relation is embedded as a transformation that rotates and scales cones. We show theoretically that AConE can learn $SROI^-$ axioms, and defines an algebra whose operations correspond one to one to $SROI^-$ description logic concept constructs. Our empirical study on multiple query datasets shows that AConE achieves superior results over previous baselines with fewer parameters. Notably on the WN18RR dataset, AConE achieves significant improvement over baseline models. We provide comprehensive analyses showing that the capability to represent axioms positively impacts the results of query answering. |
| title | Generating $SROI^-$ Ontologies via Knowledge Graph Query Embedding Learning |
| topic | Artificial Intelligence Databases Machine Learning Logic in Computer Science |
| url | https://arxiv.org/abs/2407.09212 |