Markov Process-Based Graph Convolutional Networks for Entity Classification in Knowledge Graphs
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910764166545408 |
|---|---|
| author | Mäkelburg, Johannes Peng, Yiwen Alam, Mehwish Weller, Tobias Acosta, Maribel |
| author_facet | Mäkelburg, Johannes Peng, Yiwen Alam, Mehwish Weller, Tobias Acosta, Maribel |
| contents | Despite the vast amount of information encoded in Knowledge Graphs (KGs), information about the class affiliation of entities remains often incomplete. Graph Convolutional Networks (GCNs) have been shown to be effective predictors of complete information about the class affiliation of entities in KGs. However, these models do not learn the class affiliation of entities in KGs incorporating the complexity of the task, which negatively affects the models prediction capabilities. To address this problem, we introduce a Markov process-based architecture into well-known GCN architectures. This end-to-end network learns the prediction of class affiliation of entities in KGs within a Markov process. The number of computational steps is learned during training using a geometric distribution. At the same time, the loss function combines insights from the field of evidential learning. The experiments show a performance improvement over existing models in several studied architectures and datasets. Based on the chosen hyperparameters for the geometric distribution, the expected number of computation steps can be adjusted to improve efficiency and accuracy during training. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_17438 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Markov Process-Based Graph Convolutional Networks for Entity Classification in Knowledge Graphs Mäkelburg, Johannes Peng, Yiwen Alam, Mehwish Weller, Tobias Acosta, Maribel Artificial Intelligence Machine Learning Despite the vast amount of information encoded in Knowledge Graphs (KGs), information about the class affiliation of entities remains often incomplete. Graph Convolutional Networks (GCNs) have been shown to be effective predictors of complete information about the class affiliation of entities in KGs. However, these models do not learn the class affiliation of entities in KGs incorporating the complexity of the task, which negatively affects the models prediction capabilities. To address this problem, we introduce a Markov process-based architecture into well-known GCN architectures. This end-to-end network learns the prediction of class affiliation of entities in KGs within a Markov process. The number of computational steps is learned during training using a geometric distribution. At the same time, the loss function combines insights from the field of evidential learning. The experiments show a performance improvement over existing models in several studied architectures and datasets. Based on the chosen hyperparameters for the geometric distribution, the expected number of computation steps can be adjusted to improve efficiency and accuracy during training. |
| title | Markov Process-Based Graph Convolutional Networks for Entity Classification in Knowledge Graphs |
| topic | Artificial Intelligence Machine Learning |
| url | https://arxiv.org/abs/2412.17438 |