scholarly journals Engineering Knowledge Graph from Patent Database

2021 ◽  
pp. 1-36
Author(s):  
L Siddharth ◽  
Lucienne Blessing ◽  
Kristin L. Wood ◽  
Jianxi Luo
Keyword(s):  
Knowledge Base ◽  
Engineering Design ◽  
Real World ◽  
Knowledge Bases ◽  
Knowledge Graph ◽  
Patent Document ◽  
Engineering Knowledge ◽  
Design Perspective ◽  
Entity Relationship ◽  
Integrated Knowledge

Abstract We propose a large scalable engineering knowledge base as an integrated knowledge graph, comprising sets of (entity, relationship, entity) triples that are real-world engineering ‘facts’ found in the patent database. We apply a set of rules based on the syntactic and lexical properties of claims in a patent document to extract entities and their associated relationships that are supposedly meaningful from an engineering design perspective. Such a knowledge base is expected to support inferencing, reasoning, recalling in various engineering design tasks. The knowledge base has a greater size and coverage in comparison with the previously used knowledge bases in the engineering design literature.

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 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 A Method of Ontology Integration for Designing Intelligent Problem Solvers

2019 ◽  
Vol 9 (18) ◽  
pp. 3793 ◽  
Author(s):  
Do ◽  
Nguyen ◽  
Mai
Keyword(s):  
Real World ◽  
Knowledge Integration ◽  
Knowledge Bases ◽  
World Knowledge ◽  
Knowledge Domain ◽  
Ontology Integration ◽  
Knowledge Based ◽  
Ontology Model ◽  
Problem Solvers ◽  
Integrated Knowledge

Nowadays, designing knowledge-based systems which involve knowledge from different domains requires deep research of methods and techniques for knowledge integration, and ontology integration has become the foundation for many recent knowledge integration methods. To meet the requirements of real-world applications, methods of ontology integration need to be studied and developed. In this paper, an ontology model used as the knowledge kernel is presented, consisting of concepts, relationships between concepts, and inference rules. Additionally, this kernel is also added to other knowledge, such as knowledge of operators and functions, to form an integrated knowledge-based system. The mechanism of this integration method works upon the integration of the knowledge components in the ontology structure. Besides this, problems and the reasoning method to solve them on the integrated knowledge domain are also studied. Many related problems in the integrated knowledge domain and the reasoning method for solving them are also studied. Such an integrated model can represent the real-world knowledge domain about operators and functions with high accuracy and effectiveness. The ontology model can also be applied to build knowledge bases for intelligent problem solvers (IPS) in many mathematical courses in college, such as linear algebra and graph theory. These IPSs have great potential in helping students perform better in those college courses.

scholarly journals LENA: Locality-Expanded Neural Embedding for Knowledge Base Completion

2019 ◽  
Vol 33 ◽  
pp. 2895-2902
Author(s):  
Fanshuang Kong ◽  
Richong Zhang ◽  
Yongyi Mao ◽  
Ting Deng
Keyword(s):  
Knowledge Base ◽  
Structural Information ◽  
Relevant Information ◽  
Knowledge Bases ◽  
Loss Functions ◽  
Knowledge Graph ◽  
Global Information ◽  
Sufficient Statistic ◽  
Proposed Model ◽  
Significant Research

Embedding based models for knowledge base completion have demonstrated great successes and attracted significant research interest. In this work, we observe that existing embedding models all have their loss functions decomposed into atomic loss functions, each on a triple or an postulated edge in the knowledge graph. Such an approach essentially implies that conditioned on the embeddings of the triple, whether the triple is factual is independent of the structure of the knowledge graph. Although arguably the embeddings of the entities and relation in the triple contain certain structural information of the knowledge base, we believe that the global information contained in the embeddings of the triple can be insufficient and such an assumption is overly optimistic in heterogeneous knowledge bases. Motivated by this understanding, in this work we propose a new embedding model in which we discard the assumption that the embeddings of the entities and relation in a triple is a sufficient statistic for the triple’s factual existence. More specifically, the proposed model assumes that whether a triple is factual depends not only on the embedding of the triple but also on the embeddings of the entities and relations in a larger graph neighbourhood. In this model, attention mechanisms are constructed to select the relevant information in the graph neighbourhood so that irrelevant signals in the neighbourhood are suppressed. Termed locality-expanded neural embedding with attention (LENA), this model is tested on four standard datasets and compared with several stateof-the-art models for knowledge base completion. Extensive experiments suggest that LENA outperforms the existing models in virtually every metric.

scholarly journals Multilingual Knowledge Graph Embeddings for Cross-lingual Knowledge Alignment

2017 ◽  
Author(s):  
Muhao Chen ◽  
Yingtao Tian ◽  
Mohan Yang ◽  
Carlo Zaniolo
Keyword(s):  
Knowledge Base ◽  
Knowledge Bases ◽  
Loss Functions ◽  
Knowledge Graph ◽  
Graph Embeddings ◽  
Linear Transformations ◽  
Human Labor ◽  
Knowledge Graphs ◽  
Cross Lingual ◽  
Entity Relationships

Many recent works have demonstrated the benefits of knowledge graph embeddings in completing monolingual knowledge graphs. Inasmuch as related knowledge bases are built in several different languages, achieving cross-lingual knowledge alignment will help people in constructing a coherent knowledge base, and assist machines in dealing with different expressions of entity relationships across diverse human languages. Unfortunately, achieving this highly desirable cross-lingual alignment by human labor is very costly and error-prone. Thus, we propose MTransE, a translation-based model for multilingual knowledge graph embeddings, to provide a simple and automated solution. By encoding entities and relations of each language in a separated embedding space, MTransE provides transitions for each embedding vector to its cross-lingual counterparts in other spaces, while preserving the functionalities of monolingual embeddings. We deploy three different techniques to represent cross-lingual transitions, namely axis calibration, translation vectors, and linear transformations, and derive five variants for MTransE using different loss functions. Our models can be trained on partially aligned graphs, where just a small portion of triples are aligned with their cross-lingual counterparts. The experiments on cross-lingual entity matching and triple-wise alignment verification show promising results, with some variants consistently outperforming others on different tasks. We also explore how MTransE preserves the key properties of its monolingual counterpart.

scholarly journals Lexical Sememe Prediction via Word Embeddings and Matrix Factorization

2017 ◽  
Author(s):  
Ruobing Xie ◽  
Xingchi Yuan ◽  
Zhiyuan Liu ◽  
Maosong Sun
Keyword(s):  
Knowledge Base ◽  
Real World ◽  
Matrix Factorization ◽  
Knowledge Bases ◽  
Semantic Relations ◽  
Linguistic Knowledge ◽  
Word Embeddings ◽  
New Words ◽  
First Time

Sememes are defined as the minimum semantic units of human languages. People have manually annotated lexical sememes for words and form linguistic knowledge bases. However, manual construction is time-consuming and labor-intensive, with significant annotation inconsistency and noise. In this paper, we for the first time explore to automatically predict lexical sememes based on semantic meanings of words encoded by word embeddings. Moreover, we apply matrix factorization to learn semantic relations between sememes and words. In experiments, we take a real-world sememe knowledge base HowNet for training and evaluation, and the results reveal the effectiveness of our method for lexical sememe prediction. Our method will be of great use for annotation verification of existing noisy sememe knowledge bases and annotation suggestion of new words and phrases.

scholarly journals Using Semantics and Statistics to Turn Data into Knowledge

AI Magazine ◽  
2015 ◽  
Vol 36 (1) ◽  
pp. 65-74 ◽  
Author(s):  
Jay Pujara ◽  
Hui Miao ◽  
Lise Getoor ◽  
William W. Cohen
Keyword(s):  
Knowledge Base ◽  
State Of The Art ◽  
Relational Learning ◽  
Statistical Relational Learning ◽  
Knowledge Bases ◽  
Knowledge Graph ◽  
Learning Framework ◽  
Knowledge Base Construction ◽  
Order Of Magnitude ◽  
Soft Logic

Many information extraction and knowledge base construction systems are addressing the challenge of deriving knowledge from text. A key problem in constructing these knowledge bases from sources like the web is overcoming the erroneous and incomplete information found in millions of candidate extractions. To solve this problem, we turn to semantics — using ontological constraints between candidate facts to eliminate errors. In this article, we represent the desired knowledge base as a knowledge graph and introduce the problem of knowledge graph identification, collectively resolving the entities, labels, and relations present in the knowledge graph. Knowledge graph identification requires reasoning jointly over millions of extractions simultaneously, posing a scalability challenge to many approaches. We use probabilistic soft logic (PSL), a recently-introduced statistical relational learning framework, to implement an efficient solution to knowledge graph identification and present state-of-the-art results for knowledge graph construction while performing an order of magnitude faster than competing methods.

scholarly journals Error Detection in a Large-Scale Lexical Taxonomy

Information ◽  
2020 ◽  
Vol 11 (2) ◽  
pp. 97 ◽  
Author(s):  
Yinan An ◽  
Sifan Liu ◽  
Hongzhi Wang
Keyword(s):  
Artificial Intelligence ◽  
Knowledge Base ◽  
Error Detection ◽  
Large Scale ◽  
Knowledge Bases ◽  
Experimental Results ◽  
Knowledge Graph ◽  
Significant Challenge

Knowledge base (KB) is an important aspect in artificial intelligence. One significant challenge faced by KB construction is that it contains many noises, which prevent its effective usage. Even though some KB cleansing algorithms have been proposed, they focus on the structure of the knowledge graph and neglect the relation between the concepts, which could be helpful to discover wrong relations in KB. Motived by this, we measure the relation of two concepts by the distance between their corresponding instances and detect errors within the intersection of the conflicting concept sets. For efficient and effective knowledge base cleansing, we first apply a distance-based model to determine the conflicting concept sets using two different methods. Then, we propose and analyze several algorithms on how to detect and repair the errors based on our model, where we use a hash method for an efficient way to calculate distance. Experimental results demonstrate that the proposed approaches could cleanse the knowledge bases efficiently and effectively.

Sign in / Sign up

Export Citation Format

Share Document