scholarly journals Encoding Knowledge Graph Entity Aliases in Attentive Neural Network for Wikidata Entity Linking

2020 ◽  
pp. 328-342 ◽  
Author(s):  
Isaiah Onando Mulang’ ◽  
Kuldeep Singh ◽  
Akhilesh Vyas ◽  
Saeedeh Shekarpour ◽  
Maria-Esther Vidal ◽  
...  
Keyword(s):  
Neural Network ◽  
Knowledge Graph ◽  
Entity Linking

scholarly journals Entity Linking via Symmetrical Attention-Based Neural Network and Entity Structural Features

Symmetry ◽  
2019 ◽  
Vol 11 (4) ◽  
pp. 453 ◽  
Author(s):  
Shengze Hu ◽  
Zhen Tan ◽  
Weixin Zeng ◽  
Bin Ge ◽  
Weidong Xiao
Keyword(s):  
Neural Network ◽  
Feature Extraction ◽  
Prior Probability ◽  
Structural Features ◽  
Similarity Score ◽  
Knowledge Graph ◽  
Entity Linking ◽  
Latent Features ◽  
Context Features ◽  
Individual Information

In the process of knowledge graph construction, entity linking is a pivotal step, which maps mentions in text to a knowledge base. Existing models only utilize individual information to represent their latent features and ignore the correlation between entities and their mentions. Besides, in the process of entity feature extraction, only partial latent features, i.e., context features, are leveraged to extract latent features, and the pivotal entity structural features are ignored. In this paper, we propose SA-ESF, which leverages the symmetrical Bi-LSTM neural network with the double attention mechanism to calculate the correlation between mentions and entities in two aspects: (1) entity embeddings and mention context features; (2) mention embeddings and entity description features; furthermore, the context features, structural features, and entity ID feature are integrated to represent entity embeddings jointly. Finally, we leverage (1) the similarity score between each mention and its candidate entities and (2) the prior probability to calculate the final ranking results. The experimental results on nine benchmark dataset validate the performance of SA-ESF where the average F1 score is up to 0.866.

scholarly journals Correction to: Encoding Knowledge Graph Entity Aliases in Attentive Neural Network for Wikidata Entity Linking

2020 ◽  
pp. C1-C1
Author(s):  
Isaiah Onando Mulang’ ◽  
Kuldeep Singh ◽  
Akhilesh Vyas ◽  
Saeedeh Shekarpour ◽  
Maria-Esther Vidal ◽  
...  
Keyword(s):  
Neural Network ◽  
Knowledge Graph ◽  
Entity Linking

scholarly journals Research of Personalized Recommendation Technology Based on Knowledge Graphs

2021 ◽  
Vol 11 (15) ◽  
pp. 7104
Author(s):  
Xu Yang ◽  
Ziyi Huan ◽  
Yisong Zhai ◽  
Ting Lin
Keyword(s):  
Neural Network ◽  
Hot Spot ◽  
Experimental Results ◽  
Graph Representation ◽  
Personalized Recommendation ◽  
Knowledge Graph ◽  
Learning Technology ◽  
Data Set ◽  
Model Based ◽  
Knowledge Graphs

Nowadays, personalized recommendation based on knowledge graphs has become a hot spot for researchers due to its good recommendation effect. In this paper, we researched personalized recommendation based on knowledge graphs. First of all, we study the knowledge graphs’ construction method and complete the construction of the movie knowledge graphs. Furthermore, we use Neo4j graph database to store the movie data and vividly display it. Then, the classical translation model TransE algorithm in knowledge graph representation learning technology is studied in this paper, and we improved the algorithm through a cross-training method by using the information of the neighboring feature structures of the entities in the knowledge graph. Furthermore, the negative sampling process of TransE algorithm is improved. The experimental results show that the improved TransE model can more accurately vectorize entities and relations. Finally, this paper constructs a recommendation model by combining knowledge graphs with ranking learning and neural network. We propose the Bayesian personalized recommendation model based on knowledge graphs (KG-BPR) and the neural network recommendation model based on knowledge graphs(KG-NN). The semantic information of entities and relations in knowledge graphs is embedded into vector space by using improved TransE method, and we compare the results. The item entity vectors containing external knowledge information are integrated into the BPR model and neural network, respectively, which make up for the lack of knowledge information of the item itself. Finally, the experimental analysis is carried out on MovieLens-1M data set. The experimental results show that the two recommendation models proposed in this paper can effectively improve the accuracy, recall, F1 value and MAP value of recommendation.

scholarly journals MOVIE RECOMMENDATION USING KNOWLEDGE GRAPH

2020 ◽  
pp. 99-103
Author(s):  
Navin Tatyaba Gopal ◽  
Anish Raj Khobragade
Keyword(s):  
Neural Network ◽  
Recommender Systems ◽  
Weighted Graph ◽  
Cold Start ◽  
Structured Data ◽  
Label Propagation ◽  
Knowledge Graph ◽  
Movie Recommendation ◽  
Knowledge Graphs ◽  
Prior Application

The Knowledge graphs (KGs) catches structured data and relationships among a bunch of entities and items. Generally, constitute an attractive origin of information that can advance the recommender systems. But, present methodologies of this area depend on manual element thus don’t permit for start to end training. This article proposes, Knowledge Graph along with Label Smoothness (KG-LS) to offer better suggestions for the recommender Systems. Our methodology processes user-specific entities by prior application of a function capability that recognizes key KG-relationships for a specific user. In this manner, we change the KG in a specific-user weighted graph followed by application of a graph neural network to process customized entity embedding. To give better preliminary predisposition, label smoothness comes into picture, which places items in the KG which probably going to have identical user significant names/scores. Use of, label smoothness gives regularization above the edge weights thus; we demonstrate that it is comparable to a label propagation plan on the graph. Additionally building-up a productive usage that symbolizes solid adaptability concerning the size of knowledge graph. Experimentation on 4 datasets shows that our strategy beats best in class baselines. This process likewise accomplishes solid execution in cold start situations where user-entity communications remain meager.

scholarly journals Aspect-level sentiment analysis merged with knowledge graph and graph convolutional neural network

2021 ◽  
Vol 2083 (4) ◽  
pp. 042044
Author(s):  
Zuhua Dai ◽  
Yuanyuan Liu ◽  
Shilong Di ◽  
Qi Fan
Keyword(s):  
Neural Network ◽  
Sentiment Analysis ◽  
Structural Information ◽  
Knowledge Graph ◽  
Convolutional Network ◽  
Text Data ◽  
Short Text ◽  
Fine Grained ◽  
Syntactic Information ◽  
Text Information

Abstract Aspect level sentiment analysis belongs to fine-grained sentiment analysis, w hich has caused extensive research in academic circles in recent years. For this task, th e recurrent neural network (RNN) model is usually used for feature extraction, but the model cannot effectively obtain the structural information of the text. Recent studies h ave begun to use the graph convolutional network (GCN) to model the syntactic depen dency tree of the text to solve this problem. For short text data, the text information is not enough to accurately determine the emotional polarity of the aspect words, and the knowledge graph is not effectively used as external knowledge that can enrich the sem antic information. In order to solve the above problems, this paper proposes a graph co nvolutional neural network (GCN) model that can process syntactic information, know ledge graphs and text semantic information. The model works on the “syntax-knowled ge” graph to extract syntactic information and common sense information at the same t ime. Compared with the latest model, the model in this paper can effectively improve t he accuracy of aspect-level sentiment classification on two datasets.

scholarly journals Relational Graph Neural Network with Hierarchical Attention for Knowledge Graph Completion

2020 ◽  
Vol 34 (05) ◽  
pp. 9612-9619
Author(s):  
Zhao Zhang ◽  
Fuzhen Zhuang ◽  
Hengshu Zhu ◽  
Zhiping Shi ◽  
Hui Xiong ◽  
...  
Keyword(s):  
Neural Network ◽  
Missing Values ◽  
State Of The Art ◽  
Attention Mechanism ◽  
Knowledge Graph ◽  
Incomplete Knowledge ◽  
Neighborhood Information ◽  
Local Neighborhood ◽  
Proposed Model ◽  
Knowledge Graphs

The rapid proliferation of knowledge graphs (KGs) has changed the paradigm for various AI-related applications. Despite their large sizes, modern KGs are far from complete and comprehensive. This has motivated the research in knowledge graph completion (KGC), which aims to infer missing values in incomplete knowledge triples. However, most existing KGC models treat the triples in KGs independently without leveraging the inherent and valuable information from the local neighborhood surrounding an entity. To this end, we propose a Relational Graph neural network with Hierarchical ATtention (RGHAT) for the KGC task. The proposed model is equipped with a two-level attention mechanism: (i) the first level is the relation-level attention, which is inspired by the intuition that different relations have different weights for indicating an entity; (ii) the second level is the entity-level attention, which enables our model to highlight the importance of different neighboring entities under the same relation. The hierarchical attention mechanism makes our model more effective to utilize the neighborhood information of an entity. Finally, we extensively validate the superiority of RGHAT against various state-of-the-art baselines.

scholarly journals Deep Semantic Match Model for Entity Linking Using Knowledge Graph and Text

2018 ◽  
Vol 129 ◽  
pp. 110-114 ◽  
Author(s):  
Angen Luo ◽  
Sheng Gao ◽  
Yajing Xu
Keyword(s):  
Knowledge Graph ◽  
Entity Linking ◽  
Semantic Match ◽  
Match Model

scholarly journals Metastatic Site Prediction in Breast Cancer using Omics Knowledge Graph and Pattern Mining with Kirchhoff’s Law Traversal

2020 ◽  
Author(s):  
Alokkumar Jha ◽  
Yasar Khan ◽  
Ratnesh Sahay ◽  
Mathieu d’Aquin
Keyword(s):  
Breast Cancer ◽  
Neural Network ◽  
Pattern Mining ◽  
Knowledge Graph ◽  
Omics Data ◽  
Metastatic Site ◽  
Decision Network ◽  
Knowledge Graphs ◽  
Metastatic Sites ◽  
Kirchhoff's Law

AbstractPrediction of metastatic sites from the primary site of origin is a impugn task in breast cancer (BRCA). Multi-dimensionality of such metastatic sites - bone, lung, kidney, and brain, using large-scale multi-dimensional Poly-Omics (Transcriptomics, Proteomics and Metabolomics) data of various type, for example, CNV (Copy number variation), GE (Gene expression), DNA methylation, path-ways, and drugs with clinical associations makes classification of metastasis a multi-faceted challenge. In this paper, we have approached the above problem in three steps; 1) Applied Linked data and semantic web to build Poly-Omics data as knowledge graphs and termed them as cancer decision network; 2) Reduced the dimensionality of data using Graph Pattern Mining and explained gene rewiring in cancer decision network by first time using Kirchhoff’s law for knowledge or any graph traversal; 3) Established ruled based modeling to understand the essential -Omics data from poly-Omics for breast cancer progression 4) Predicted the disease’s metastatic site using Kirchhoff’s knowledge graphs as a hidden layer in the graph convolution neural network(GCNN). The features (genes) extracted by applying Kirchhoff’s law on knowledge graphs are used to predict disease relapse site with 91.9% AUC (Area Under Curve) and performed detailed evaluation against the state-of-the-art approaches. The novelty of our approach is in the creation of RDF knowledge graphs from the poly-omics, such as the drug, disease, target(gene/protein), pathways and application of Kirchhoff’s law on knowledge graph to and the first approach to predict metastatic site from the primary tumor. Further, we have applied the rule-based knowledge graph using graph convolution neural network for metastasis site prediction makes the even classification novel.

Sign in / Sign up

Export Citation Format

Share Document