Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2404.03893 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914742005661696 |
|---|---|
| author | Ma, Tengfei song, Xiang Tao, Wen Li, Mufei Zhang, Jiani Pan, Xiaoqin Lin, Jianxin Song, Bosheng Zeng, xiangxiang |
| author_facet | Ma, Tengfei song, Xiang Tao, Wen Li, Mufei Zhang, Jiani Pan, Xiaoqin Lin, Jianxin Song, Bosheng Zeng, xiangxiang |
| contents | Knowledge graph completion (KGC) aims to alleviate the inherent incompleteness of knowledge graphs (KGs), which is a critical task for various applications, such as recommendations on the web. Although knowledge graph embedding (KGE) models have demonstrated superior predictive performance on KGC tasks, these models infer missing links in a black-box manner that lacks transparency and accountability, preventing researchers from developing accountable models. Existing KGE-based explanation methods focus on exploring key paths or isolated edges as explanations, which is information-less to reason target prediction. Additionally, the missing ground truth leads to these explanation methods being ineffective in quantitatively evaluating explored explanations. To overcome these limitations, we propose KGExplainer, a model-agnostic method that identifies connected subgraph explanations and distills an evaluator to assess them quantitatively. KGExplainer employs a perturbation-based greedy search algorithm to find key connected subgraphs as explanations within the local structure of target predictions. To evaluate the quality of the explored explanations, KGExplainer distills an evaluator from the target KGE model. By forwarding the explanations to the evaluator, our method can examine the fidelity of them. Extensive experiments on benchmark datasets demonstrate that KGExplainer yields promising improvement and achieves an optimal ratio of 83.3% in human evaluation. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_03893 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | KGExplainer: Towards Exploring Connected Subgraph Explanations for Knowledge Graph Completion Ma, Tengfei song, Xiang Tao, Wen Li, Mufei Zhang, Jiani Pan, Xiaoqin Lin, Jianxin Song, Bosheng Zeng, xiangxiang Artificial Intelligence Knowledge graph completion (KGC) aims to alleviate the inherent incompleteness of knowledge graphs (KGs), which is a critical task for various applications, such as recommendations on the web. Although knowledge graph embedding (KGE) models have demonstrated superior predictive performance on KGC tasks, these models infer missing links in a black-box manner that lacks transparency and accountability, preventing researchers from developing accountable models. Existing KGE-based explanation methods focus on exploring key paths or isolated edges as explanations, which is information-less to reason target prediction. Additionally, the missing ground truth leads to these explanation methods being ineffective in quantitatively evaluating explored explanations. To overcome these limitations, we propose KGExplainer, a model-agnostic method that identifies connected subgraph explanations and distills an evaluator to assess them quantitatively. KGExplainer employs a perturbation-based greedy search algorithm to find key connected subgraphs as explanations within the local structure of target predictions. To evaluate the quality of the explored explanations, KGExplainer distills an evaluator from the target KGE model. By forwarding the explanations to the evaluator, our method can examine the fidelity of them. Extensive experiments on benchmark datasets demonstrate that KGExplainer yields promising improvement and achieves an optimal ratio of 83.3% in human evaluation. |
| title | KGExplainer: Towards Exploring Connected Subgraph Explanations for Knowledge Graph Completion |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2404.03893 |