Anomaly Detection and Classification in Knowledge Graphs

• URL: http://arxiv.org/abs/2412.04780v1
• Date: Fri, 06 Dec 2024 05:03:10 GMT
• Title: Anomaly Detection and Classification in Knowledge Graphs
• Authors: Asara Senaratne, Peter Christen, Pouya Omran, Graham Williams,
• Abstract summary: We propose SEKA (SEeking Knowledge graph Anomalies), an unsupervised approach for the detection of abnormal triples and entities in Knowledge Graphs. We also present TAXO, a taxonomy of possible anomaly types that can occur in a KG. We evaluate both approaches using the four real-world KGs YAGO-1, KBpedia, Wikidata, and DSKG.
• Score: 1.2599533416395767
• License:
• Abstract: Anomalies such as redundant, inconsistent, contradictory, and deficient values in a Knowledge Graph (KG) are unavoidable, as these graphs are often curated manually, or extracted using machine learning and natural language processing techniques. Therefore, anomaly detection is a task that can enhance the quality of KGs. In this paper, we propose SEKA (SEeking Knowledge graph Anomalies), an unsupervised approach for the detection of abnormal triples and entities in KGs. SEKA can help improve the correctness of a KG whilst retaining its coverage. We propose an adaption of the Path Rank Algorithm (PRA), named the Corroborative Path Rank Algorithm (CPRA), which is an efficient adaptation of PRA that is customized to detect anomalies in KGs. Furthermore, we also present TAXO (TAXOnomy of anomaly types in KGs), a taxonomy of possible anomaly types that can occur in a KG. This taxonomy provides a classification of the anomalies discovered by SEKA with an extensive discussion of possible data quality issues in a KG. We evaluate both approaches using the four real-world KGs YAGO-1, KBpedia, Wikidata, and DSKG to demonstrate the ability of SEKA and TAXO to outperform the baselines.

Related papers

• Ontology-grounded Automatic Knowledge Graph Construction by LLM under Wikidata schema [60.42231674887294]
  We propose an ontology-grounded approach to Knowledge Graph (KG) construction using Large Language Models (LLMs) on a knowledge base. We ground generation of KG with the authored ontology based on extracted relations to ensure consistency and interpretability. Our work presents a promising direction for scalable KG construction pipeline with minimal human intervention, that yields high quality and human-interpretable KGs.
  arXiv  Detail & Related papers  (2024-12-30T13:36:05Z)
• Learning Rules from KGs Guided by Language Models [48.858741745144044]
  Rule learning methods can be applied to predict potentially missing facts. Ranking of rules is especially challenging over highly incomplete or biased KGs. With the recent rise of Language Models (LMs) several works have claimed that LMs can be used as alternative means for KG completion.
  arXiv  Detail & Related papers  (2024-09-12T09:27:36Z)
• Online Detection of Anomalies in Temporal Knowledge Graphs with Interpretability [19.457465167667287]
  AnoT is an efficient TKG summarization method tailored for interpretable online anomaly detection in temporal knowledge graphs. Experimental results on four real-world datasets demonstrate that AnoT surpasses existing methods significantly in terms of accuracy and interoperability.
  arXiv  Detail & Related papers  (2024-08-01T18:46:05Z)
• Explainable Sparse Knowledge Graph Completion via High-order Graph Reasoning Network [111.67744771462873]
  This paper proposes a novel explainable model for sparse Knowledge Graphs (KGs) It combines high-order reasoning into a graph convolutional network, namely HoGRN. It can not only improve the generalization ability to mitigate the information insufficiency issue but also provide interpretability.
  arXiv  Detail & Related papers  (2022-07-14T10:16:56Z)
• DSKReG: Differentiable Sampling on Knowledge Graph for Recommendation with Relational GNN [59.160401038969795]
  We propose differentiable sampling on Knowledge Graph for Recommendation with GNN (DSKReG) We devise a differentiable sampling strategy, which enables the selection of relevant items to be jointly optimized with the model training procedure. The experimental results demonstrate that our model outperforms state-of-the-art KG-based recommender systems.
  arXiv  Detail & Related papers  (2021-08-26T16:19:59Z)
• Typing Errors in Factual Knowledge Graphs: Severity and Possible Ways Out [11.534085606272242]
  We propose an active typing error detection algorithm that maximizes the utilization of both gold and noisy labels. The outcomes of this study provide guidelines for researchers to use noisy factual KGs.
  arXiv  Detail & Related papers  (2021-02-03T21:47:37Z)
• Entity Type Prediction in Knowledge Graphs using Embeddings [2.7528170226206443]
  Open Knowledge Graphs (such as DBpedia, Wikidata, YAGO) have been recognized as the backbone of diverse applications in the field of data mining and information retrieval. Most of these KGs are mostly created either via an automated information extraction from snapshots or information accumulation provided by the users or using Wikipedias. It has been observed that the type information of these KGs is often noisy, incomplete, and incorrect. A multi-label classification approach is proposed in this work for entity typing using KG embeddings.
  arXiv  Detail & Related papers  (2020-04-28T17:57:08Z)
• Toward Subgraph-Guided Knowledge Graph Question Generation with Graph Neural Networks [53.58077686470096]
  Knowledge graph (KG) question generation (QG) aims to generate natural language questions from KGs and target answers. In this work, we focus on a more realistic setting where we aim to generate questions from a KG subgraph and target answers.
  arXiv  Detail & Related papers  (2020-04-13T15:43:22Z)
• What is Normal, What is Strange, and What is Missing in a Knowledge Graph: Unified Characterization via Inductive Summarization [34.3446695203147]
  We introduce a unified solution to KG characterization by formulating the problem as unsupervised KG summarization. KGist learns a summary of inductive rules that best compress the KG according to the Minimum Description Length principle. We show that KGist outperforms task-specific, supervised and unsupervised baselines in error detection and incompleteness identification.
  arXiv  Detail & Related papers  (2020-03-23T17:38:31Z)
• Unifying Graph Convolutional Neural Networks and Label Propagation [73.82013612939507]
  We study the relationship between LPA and GCN in terms of two aspects: feature/label smoothing and feature/label influence. Based on our theoretical analysis, we propose an end-to-end model that unifies GCN and LPA for node classification. Our model can also be seen as learning attention weights based on node labels, which is more task-oriented than existing feature-based attention models.
  arXiv  Detail & Related papers  (2020-02-17T03:23:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.