Entity Profiling in Knowledge Graphs
- URL: http://arxiv.org/abs/2003.00172v1
- Date: Sat, 29 Feb 2020 03:44:24 GMT
- Title: Entity Profiling in Knowledge Graphs
- Authors: Xiang Zhang, Qingqing Yang, Jinru Ding and Ziyue Wang
- Abstract summary: We present a novel profiling approach to identify distinctive entity features.
The distinctiveness of features is carefully measured by a HAS model.
We fully evaluate the quality of entity profiles generated from real Knowledge Graphs.
- Score: 5.582713124168685
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Knowledge Graphs (KGs) are graph-structured knowledge bases storing factual
information about real-world entities. Understanding the uniqueness of each
entity is crucial to the analyzing, sharing, and reusing of KGs. Traditional
profiling technologies encompass a vast array of methods to find distinctive
features in various applications, which can help to differentiate entities in
the process of human understanding of KGs. In this work, we present a novel
profiling approach to identify distinctive entity features. The distinctiveness
of features is carefully measured by a HAS model, which is a scalable
representation learning model to produce a multi-pattern entity embedding. We
fully evaluate the quality of entity profiles generated from real KGs. The
results show that our approach facilitates human understanding of entities in
KGs.
Related papers
- KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge [63.19837262782962]
Knowledge Graph Embedding (KGE) techniques are crucial in learning compact representations of entities and relations within a knowledge graph.
This study introduces KG-FIT, which builds a semantically coherent hierarchical structure of entity clusters.
Experiments on the benchmark datasets FB15K-237, YAGO3-10, and PrimeKG demonstrate the superiority of KG-FIT over state-of-the-art pre-trained language model-based methods.
arXiv Detail & Related papers (2024-05-26T03:04:26Z) - Rethinking Language Models as Symbolic Knowledge Graphs [7.192286645674803]
Symbolic knowledge graphs (KGs) play a pivotal role in knowledge-centric applications such as search, question answering and recommendation.
We construct nine qualitative benchmarks that encompass a spectrum of attributes including symmetry, asymmetry, hierarchy, bidirectionality, compositionality, paths, entity-centricity, bias and ambiguity.
arXiv Detail & Related papers (2023-08-25T21:25:08Z) - Recognizing Unseen Objects via Multimodal Intensive Knowledge Graph
Propagation [68.13453771001522]
We propose a multimodal intensive ZSL framework that matches regions of images with corresponding semantic embeddings.
We conduct extensive experiments and evaluate our model on large-scale real-world data.
arXiv Detail & Related papers (2023-06-14T13:07:48Z) - BertNet: Harvesting Knowledge Graphs with Arbitrary Relations from
Pretrained Language Models [65.51390418485207]
We propose a new approach of harvesting massive KGs of arbitrary relations from pretrained LMs.
With minimal input of a relation definition, the approach efficiently searches in the vast entity pair space to extract diverse accurate knowledge.
We deploy the approach to harvest KGs of over 400 new relations from different LMs.
arXiv Detail & Related papers (2022-06-28T19:46:29Z) - Exploiting Global Semantic Similarities in Knowledge Graphs by
Relational Prototype Entities [55.952077365016066]
An empirical observation is that the head and tail entities connected by the same relation often share similar semantic attributes.
We propose a novel approach, which introduces a set of virtual nodes called textittextbfrelational prototype entities.
By enforcing the entities' embeddings close to their associated prototypes' embeddings, our approach can effectively encourage the global semantic similarities of entities.
arXiv Detail & Related papers (2022-06-16T09:25:33Z) - Knowledge Graph Embedding Methods for Entity Alignment: An Experimental
Review [7.241438112282638]
We conduct the first meta-level analysis of popular embedding methods for entity alignment.
Our analysis reveals statistically significant correlations of different embedding methods with various meta-features extracted by KGs.
We rank them in a statistically significant way according to their effectiveness across all real-world KGs of our testbed.
arXiv Detail & Related papers (2022-03-17T12:11:58Z) - Knowledge Graph Augmented Network Towards Multiview Representation
Learning for Aspect-based Sentiment Analysis [96.53859361560505]
We propose a knowledge graph augmented network (KGAN) to incorporate external knowledge with explicitly syntactic and contextual information.
KGAN captures the sentiment feature representations from multiple perspectives, i.e., context-, syntax- and knowledge-based.
Experiments on three popular ABSA benchmarks demonstrate the effectiveness and robustness of our KGAN.
arXiv Detail & Related papers (2022-01-13T08:25:53Z) - Relational Learning Analysis of Social Politics using Knowledge Graph
Embedding [11.978556412301975]
This paper presents a novel credibility domain-based KG Embedding framework.
It involves capturing a fusion of data obtained from heterogeneous resources into a formal KG representation depicted by a domain.
The framework also embodies a credibility module to ensure data quality and trustworthiness.
arXiv Detail & Related papers (2020-06-02T14:10:28Z) - KACC: A Multi-task Benchmark for Knowledge Abstraction, Concretization
and Completion [99.47414073164656]
A comprehensive knowledge graph (KG) contains an instance-level entity graph and an ontology-level concept graph.
The two-view KG provides a testbed for models to "simulate" human's abilities on knowledge abstraction, concretization, and completion.
We propose a unified KG benchmark by improving existing benchmarks in terms of dataset scale, task coverage, and difficulty.
arXiv Detail & Related papers (2020-04-28T16:21:57Z)
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.