Mining Knowledge Graphs From Incident Reports

• URL: http://arxiv.org/abs/2101.05961v1
• Date: Fri, 15 Jan 2021 04:15:26 GMT
• Title: Mining Knowledge Graphs From Incident Reports
• Authors: Manish Shetty, Chetan Bansal
• Abstract summary: Incident reports filed by customers are largely unstructured making diagnosis or mitigation non-trivial. We present an approach to mine and score binary entity relations from co-occurring entity pairs. We construct knowledge graphs automatically and show that the implicit knowledge in the graph can be used to rank relevant entities for distinct incidents.
• Score: 3.3395585414528663
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Incident management is a critical part of the DevOps processes for developing and operating large-scale services in the cloud. Incident reports filed by customers are largely unstructured making any automated diagnosis or mitigation non-trivial. It requires on-call engineers to parse verbose reports to understand the issue and locate key information. Prior work has looked into extraction of key attributes or entities like error codes, tenant Ids, stack traces, etc. from incident and bug reports. Although a flat list of entities is informative, to unlock the full potential of knowledge extraction, it is necessary to provide context to these entities. For instance, the relations between the real-world concepts or objects that these entities represent in otherwise unstructured data is useful for downstream tasks like incident linking, triaging and mitigation. With this additional context, entities are transformed from "Strings" to "Things". In this work, we present an approach to mine and score binary entity relations from co-occurring entity pairs. We evaluate binary relations extracted and show that our approach has a high precision of 0.9. Further, we construct knowledge graphs automatically and show that the implicit knowledge in the graph can be used to mine and rank relevant entities for distinct incidents, by mapping entities to clusters of incident titles.

Related papers

• Web-Scale Visual Entity Recognition: An LLM-Driven Data Approach [56.55633052479446]
  Web-scale visual entity recognition presents significant challenges due to the lack of clean, large-scale training data. We propose a novel methodology to curate such a dataset, leveraging a multimodal large language model (LLM) for label verification, metadata generation, and rationale explanation. Experiments demonstrate that models trained on this automatically curated data achieve state-of-the-art performance on web-scale visual entity recognition tasks.
  arXiv  Detail & Related papers  (2024-10-31T06:55:24Z)
• EnriCo: Enriched Representation and Globally Constrained Inference for Entity and Relation Extraction [3.579132482505273]
  Joint entity and relation extraction plays a pivotal role in various applications, notably in the construction of knowledge graphs. Existing approaches often fall short of two key aspects: richness of representation and coherence in output structure. In our work, we introduce EnriCo, which mitigates these shortcomings.
  arXiv  Detail & Related papers  (2024-04-18T20:15:48Z)
• GE-Blender: Graph-Based Knowledge Enhancement for Blender [3.8841367260456487]
  Unseen entities can have a large impact on the dialogue generation task. We construct a graph by extracting entity nodes in them, enhancing the representation of the context. We add the named entity tag prediction task to apply the problem that the unseen entity does not exist in the graph.
  arXiv  Detail & Related papers  (2023-01-30T13:00:20Z)
• V-Coder: Adaptive AutoEncoder for Semantic Disclosure in Knowledge Graphs [4.493174773769076]
  We propose a new adaptive AutoEncoder, called V-Coder, to identify relations inherently connecting entities from different domains. The evaluation on real-world datasets shows that the V-Coder is able to recover links from corrupted data.
  arXiv  Detail & Related papers  (2022-07-22T14:51:46Z)
• One-shot Scene Graph Generation [130.57405850346836]
  We propose Multiple Structured Knowledge (Relational Knowledgesense Knowledge) for the one-shot scene graph generation task. Our method significantly outperforms existing state-of-the-art methods by a large margin.
  arXiv  Detail & Related papers  (2022-02-22T11:32:59Z)
• Context-Enhanced Entity and Relation Embedding for Knowledge Graph Completion [2.580765958706854]
  We propose a model named AggrE, which conducts efficient aggregations on entity context and relation context in multi-hops. Experiment results show that AggrE is competitive to existing models.
  arXiv  Detail & Related papers  (2020-12-13T09:20:42Z)
• Autoregressive Entity Retrieval [55.38027440347138]
  Entities are at the center of how we represent and aggregate knowledge. The ability to retrieve such entities given a query is fundamental for knowledge-intensive tasks such as entity linking and open-domain question answering. We propose GENRE, the first system that retrieves entities by generating their unique names, left to right, token-by-token in an autoregressive fashion.
  arXiv  Detail & Related papers  (2020-10-02T10:13:31Z)
• HittER: Hierarchical Transformers for Knowledge Graph Embeddings [85.93509934018499]
  We propose Hitt to learn representations of entities and relations in a complex knowledge graph. Experimental results show that Hitt achieves new state-of-the-art results on multiple link prediction. We additionally propose a simple approach to integrate Hitt into BERT and demonstrate its effectiveness on two Freebase factoid answering datasets.
  arXiv  Detail & Related papers  (2020-08-28T18:58:15Z)
• Probing Linguistic Features of Sentence-Level Representations in Neural Relation Extraction [80.38130122127882]
  We introduce 14 probing tasks targeting linguistic properties relevant to neural relation extraction (RE) We use them to study representations learned by more than 40 different encoder architecture and linguistic feature combinations trained on two datasets. We find that the bias induced by the architecture and the inclusion of linguistic features are clearly expressed in the probing task performance.
  arXiv  Detail & Related papers  (2020-04-17T09:17:40Z)
• Relational Message Passing for Knowledge Graph Completion [78.47976646383222]
  We propose a relational message passing method for knowledge graph completion. It passes relational messages among edges iteratively to aggregate neighborhood information. Results show our method outperforms stateof-the-art knowledge completion methods by a large margin.
  arXiv  Detail & Related papers  (2020-02-17T03:33:41Z)

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.