scholarly journals GREG: A Global Level Relation Extraction with Knowledge Graph Embedding

2020 ◽  
Vol 10 (3) ◽  
pp. 1181 ◽  
Author(s):  
Kuekyeng Kim ◽  
Yuna Hur ◽  
Gyeongmin Kim ◽  
Heuiseok Lim
Keyword(s):  
Local Level ◽  
Relation Extraction ◽  
Graph Embedding ◽  
Structured Data ◽  
Unstructured Data ◽  
Knowledge Graph ◽  
Global Level ◽  
Proposed Model ◽  
Vector Representations ◽  
Document Level

In an age overflowing with information, the task of converting unstructured data into structured data are a vital task of great need. Currently, most relation extraction modules are more focused on the extraction of local mention-level relations—usually from short volumes of text. However, in most cases, the most vital and important relations are those that are described in length and detail. In this research, we propose GREG: A Global level Relation Extractor model using knowledge graph embeddings for document-level inputs. The model uses vector representations of mention-level ‘local’ relation’s to construct knowledge graphs that can represent the input document. The knowledge graph is then used to predict global level relations from documents or large bodies of text. The proposed model is largely divided into two modules which are synchronized during their training. Thus, each of the model’s modules is designed to deal with local relations and global relations separately. This allows the model to avoid the problem of struggling against loss of information due to too much information crunched into smaller sized representations when attempting global level relation extraction. Through evaluation, we have shown that the proposed model yields high performances in both predicting global level relations and local level relations consistently.

scholarly journals Entity Alignment between Knowledge Graphs Using Attribute Embeddings

2019 ◽  
Vol 33 ◽  
pp. 297-304 ◽  
Author(s):  
Bayu Distiawan Trisedya ◽  
Jianzhong Qi ◽  
Rui Zhang
Keyword(s):  
Real World ◽  
Graph Embedding ◽  
Knowledge Bases ◽  
Knowledge Graph ◽  
World Knowledge ◽  
Large Numbers ◽  
Proposed Model ◽  
Alignment Task ◽  
Transitivity Rule ◽  
Knowledge Graphs

The task of entity alignment between knowledge graphs aims to find entities in two knowledge graphs that represent the same real-world entity. Recently, embedding-based models are proposed for this task. Such models are built on top of a knowledge graph embedding model that learns entity embeddings to capture the semantic similarity between entities in the same knowledge graph. We propose to learn embeddings that can capture the similarity between entities in different knowledge graphs. Our proposed model helps align entities from different knowledge graphs, and hence enables the integration of multiple knowledge graphs. Our model exploits large numbers of attribute triples existing in the knowledge graphs and generates attribute character embeddings. The attribute character embedding shifts the entity embeddings from two knowledge graphs into the same space by computing the similarity between entities based on their attributes. We use a transitivity rule to further enrich the number of attributes of an entity to enhance the attribute character embedding. Experiments using real-world knowledge bases show that our proposed model achieves consistent improvements over the baseline models by over 50% in terms of hits@1 on the entity alignment task.

scholarly journals Relation extraction in structured and unstructured data: a comparative investigation on smartphone titles in the e-commerce domain

2021 ◽  
Author(s):  
João Gabriel Melo Barbirato ◽  
Livy Real ◽  
Helena de Medeiros Caseli
Keyword(s):  
Relation Extraction ◽  
Comparative Investigation ◽  
Structured Data ◽  
Unstructured Data ◽  
Relational Information ◽  
Textual Data

As large amounts of unstructured data are generated on a regular basis, expressing or storing knowledge in a way that is useful remains a challenge. In this context, Relation Extraction (RE) is the task of automatically identifying relationships in unstructured textual data. Thus, we investigated the relation extraction on unstructured e-commerce data from the smartphone domain, using a BERT model fine-tuned for this task. We conducted two experiments to acknowledge how much relational information it is possible to extract from product sheets (structured data) and product titles (unstructured data), and a third experiment to compare both. Analysis shows that extracting relations within a title can retrieve correct relations that are not evident on the related sheet.

scholarly journals Unsupervised Embedding Enhancements of Knowledge Graphs using Textual Associations

2019 ◽  
Author(s):  
Neil Veira ◽  
Brian Keng ◽  
Kanchana Padmanabhan ◽  
Andreas Veneris
Keyword(s):  
Link Prediction ◽  
Graph Embedding ◽  
Structured Data ◽  
Knowledge Graph ◽  
Sources Of Information ◽  
Textual Information ◽  
Text Document ◽  
First Case ◽  
Textual Data ◽  
Unsupervised Approach

Knowledge graph embeddings are instrumental for representing and learning from multi-relational data, with recent embedding models showing high effectiveness for inferring new facts from existing databases. However, such precisely structured data is usually limited in quantity and in scope. Therefore, to fully optimize the embeddings it is important to also consider more widely available sources of information such as text. This paper describes an unsupervised approach to incorporate textual information by augmenting entity embeddings with embeddings of associated words. The approach does not modify the optimization objective for the knowledge graph embedding, which allows it to be integrated with existing embedding models. Two distinct forms of textual data are considered, with different embedding enhancements proposed for each case. In the first case, each entity has an associated text document that describes it. In the second case, a text document is not available, and instead entities occur as words or phrases in an unstructured corpus of text fragments. Experiments show that both methods can offer improvement on the link prediction task when applied to many different knowledge graph embedding models.

scholarly journals An Approach to Knowledge Base Completion by a Committee-Based Knowledge Graph Embedding

2020 ◽  
Vol 10 (8) ◽  
pp. 2651
Author(s):  
Su Jeong Choi ◽  
Hyun-Je Song ◽  
Seong-Bae Park
Keyword(s):  
Knowledge Base ◽  
Language Processing ◽  
Graph Embedding ◽  
Knowledge Bases ◽  
Knowledge Graph ◽  
Data Sets ◽  
Complete Knowledge ◽  
Proposed Model ◽  
Ranking Task ◽  
Low Dimensional

Knowledge bases such as Freebase, YAGO, DBPedia, and Nell contain a number of facts with various entities and relations. Since they store many facts, they are regarded as core resources for many natural language processing tasks. Nevertheless, they are not normally complete and have many missing facts. Such missing facts keep them from being used in diverse applications in spite of their usefulness. Therefore, it is significant to complete knowledge bases. Knowledge graph embedding is one of the promising approaches to completing a knowledge base and thus many variants of knowledge graph embedding have been proposed. It maps all entities and relations in knowledge base onto a low dimensional vector space. Then, candidate facts that are plausible in the space are determined as missing facts. However, any single knowledge graph embedding is insufficient to complete a knowledge base. As a solution to this problem, this paper defines knowledge base completion as a ranking task and proposes a committee-based knowledge graph embedding model for improving the performance of knowledge base completion. Since each knowledge graph embedding has its own idiosyncrasy, we make up a committee of various knowledge graph embeddings to reflect various perspectives. After ranking all candidate facts according to their plausibility computed by the committee, the top-k facts are chosen as missing facts. Our experimental results on two data sets show that the proposed model achieves higher performance than any single knowledge graph embedding and shows robust performances regardless of k. These results prove that the proposed model considers various perspectives in measuring the plausibility of candidate facts.

scholarly journals Construction and Recommendation of a Water Affair Knowledge Graph

2018 ◽  
Vol 10 (10) ◽  
pp. 3429 ◽  
Author(s):  
Jianzhuo Yan ◽  
Tiantian Lv ◽  
Yongchuan Yu
Keyword(s):  
Information Integration ◽  
Information Search ◽  
Recommendation System ◽  
Latent Dirichlet Allocation ◽  
Edit Distance ◽  
Semantic Distance ◽  
Recall Rate ◽  
Structured Data ◽  
Unstructured Data ◽  
Knowledge Graph

Water affair data mainly consists of structured data and unstructured data, and the storage methods of data are diverse and heterogeneous. To meet the needs of water affair information integration, a method of constructing a knowledge graph using a combination of water affair structured and unstructured data is proposed. To meet the needs of a water information search, an information recommendation system for constructing a water affair knowledge graph is proposed. In this paper, the edit distance algorithm and latent Dirichlet allocation (LDA) algorithm are used to construct a water affair structured data and unstructured data combination knowledge graph, and this graph is validated based on the semantic distance algorithm. Finally, this paper uses the recall rate, accuracy rate, and F comprehensive results to compare the algorithms. The evaluation results of the edit distance algorithm and the LDA algorithm exceed 90%, which is greater than the comparison algorithm, thus confirming the validity and accuracy of the construction of a water affair knowledge graph. Furthermore, a set of water affair verification sets is used to verify the recommendation method, which proves the effectiveness of the recommended method.

scholarly journals Biological applications of knowledge graph embedding models

2020 ◽  
Author(s):  
Sameh K Mohamed ◽  
Aayah Nounu ◽  
Vít Nováček
Keyword(s):  
Predictive Accuracy ◽  
Biological Systems ◽  
Graph Embedding ◽  
Low Rank ◽  
Superior Performance ◽  
Knowledge Graph ◽  
Biological Knowledge ◽  
Knowledge Graphs ◽  
Vector Representations ◽  
Biological Entities

Abstract Complex biological systems are traditionally modelled as graphs of interconnected biological entities. These graphs, i.e. biological knowledge graphs, are then processed using graph exploratory approaches to perform different types of analytical and predictive tasks. Despite the high predictive accuracy of these approaches, they have limited scalability due to their dependency on time-consuming path exploratory procedures. In recent years, owing to the rapid advances of computational technologies, new approaches for modelling graphs and mining them with high accuracy and scalability have emerged. These approaches, i.e. knowledge graph embedding (KGE) models, operate by learning low-rank vector representations of graph nodes and edges that preserve the graph’s inherent structure. These approaches were used to analyse knowledge graphs from different domains where they showed superior performance and accuracy compared to previous graph exploratory approaches. In this work, we study this class of models in the context of biological knowledge graphs and their different applications. We then show how KGE models can be a natural fit for representing complex biological knowledge modelled as graphs. We also discuss their predictive and analytical capabilities in different biology applications. In this regard, we present two example case studies that demonstrate the capabilities of KGE models: prediction of drug–target interactions and polypharmacy side effects. Finally, we analyse different practical considerations for KGEs, and we discuss possible opportunities and challenges related to adopting them for modelling biological systems.

scholarly journals On Training Knowledge Graph Embedding Models

Information ◽  
2021 ◽  
Vol 12 (4) ◽  
pp. 147
Author(s):  
Sameh K. Mohamed ◽  
Emir Muñoz ◽  
Vit Novacek
Keyword(s):  
Rapid Development ◽  
Graph Embedding ◽  
Low Rank ◽  
Knowledge Graph ◽  
Scoring Functions ◽  
Substantial Impact ◽  
Model Efficiency ◽  
Rank Vector ◽  
Rdf Graphs ◽  
Vector Representations

Knowledge graph embedding (KGE) models have become popular means for making discoveries in knowledge graphs (e.g., RDF graphs) in an efficient and scalable manner. The key to success of these models is their ability to learn low-rank vector representations for knowledge graph entities and relations. Despite the rapid development of KGE models, state-of-the-art approaches have mostly focused on new ways to represent embeddings interaction functions (i.e., scoring functions). In this paper, we argue that the choice of other training components such as the loss function, hyperparameters and negative sampling strategies can also have substantial impact on the model efficiency. This area has been rather neglected by previous works so far and our contribution is towards closing this gap by a thorough analysis of possible choices of training loss functions, hyperparameters and negative sampling techniques. We finally investigate the effects of specific choices on the scalability and accuracy of knowledge graph embedding models.

scholarly journals Label-Free Distant Supervision for Relation Extraction via Knowledge Graph Embedding

2018 ◽  
Author(s):  
Guanying Wang ◽  
Wen Zhang ◽  
Ruoxu Wang ◽  
Yalin Zhou ◽  
Xi Chen ◽  
...  
Keyword(s):  
Relation Extraction ◽  
Graph Embedding ◽  
Knowledge Graph ◽  
Label Free ◽  
Distant Supervision

scholarly journals A Novel Negative Sampling Based on Frequency of Relational Association Entities for Knowledge Graph Embedding

2021 ◽  
Author(s):  
Wanhua Cao ◽  
Yi Zhang ◽  
Juntao Liu ◽  
Ziyun Rao
Keyword(s):  
Link Prediction ◽  
State Of The Art ◽  
Evaluation Criteria ◽  
Relation Extraction ◽  
Graph Embedding ◽  
Semantic Space ◽  
Knowledge Graph ◽  
Knowledge Reasoning ◽  
Relation Prediction ◽  
Low Dimensional

Knowledge graph embedding improves the performance of relation extraction and knowledge reasoning by encoding entities and relationships in low-dimensional semantic space. During training, negative samples are usually constructed by replacing the head/tail entity. And the different replacing relationships lead to different accuracy of the prediction results. This paper develops a negative triplets construction framework according to the frequency of relational association entities. The proposed construction framework can fully consider the quantitative of relations and entities in the dataset to assign the proportion of relation and entity replacement and the frequency of the entities associated with each relationship to set reasonable proportions for different relations. To verify the validity of the proposed construction framework, it is integrated into the state-of-the-art knowledge graph embedding models, such as TransE, TransH, DistMult, ComplEx, and Analogy. And both the evaluation criteria of relation prediction and entity prediction are used to evaluate the performance of link prediction more comprehensively. The experimental results on two commonly used datasets, WN18 and FB15K, show that the proposed method improves entity link and triplet classification accuracy, especially the accuracy of relational link prediction.

Do You Want to See the Tree? Ignore the Forest

2014 ◽  
Vol 61 (3) ◽  
pp. 205-214 ◽  
Author(s):  
Nicolas Poirel ◽  
Claire Sara Krakowski ◽  
Sabrina Sayah ◽  
Arlette Pineau ◽  
Olivier Houdé ◽  
...  
Keyword(s):  
Visual Recognition ◽  
Local Level ◽  
Local Information ◽  
Visual Environment ◽  
Global Information ◽  
Focus Attention ◽  
Global Level ◽  
Hierarchical Stimuli ◽  
Priming Paradigm ◽  
The One

The visual environment consists of global structures (e.g., a forest) made up of local parts (e.g., trees). When compound stimuli are presented (e.g., large global letters composed of arrangements of small local letters), the global unattended information slows responses to local targets. Using a negative priming paradigm, we investigated whether inhibition is required to process hierarchical stimuli when information at the local level is in conflict with the one at the global level. The results show that when local and global information is in conflict, global information must be inhibited to process local information, but that the reverse is not true. This finding has potential direct implications for brain models of visual recognition, by suggesting that when local information is conflicting with global information, inhibitory control reduces feedback activity from global information (e.g., inhibits the forest) which allows the visual system to process local information (e.g., to focus attention on a particular tree).

Sign in / Sign up

Export Citation Format

Share Document