scholarly journals Software Knowledge Entity Relation Extraction with Entity-Aware and Syntactic Dependency Structure Information

2021 ◽  
Vol 2021 ◽  
pp. 1-13
Author(s):  
Mingjing Tang ◽  
Tong Li ◽  
Wei Wang ◽  
Rui Zhu ◽  
Zifei Ma ◽  
...  
Keyword(s):  
Large Scale ◽  
Complex Structure ◽  
Relation Extraction ◽  
Knowledge Graph ◽  
Knowledge Domain ◽  
Convolutional Network ◽  
Knowledge Community ◽  
Structure Information ◽  
Entity Relation Extraction ◽  
Syntactic Dependency

Software knowledge community contains a large scale of software knowledge entities with complex structure and rich semantic relations. Semantic relation extraction of software knowledge entities is a critical task for software knowledge graph construction, which has an important impact on knowledge graph based tasks such as software document generation and software expert recommendation. Due to the problems of entity sparsity, relation ambiguity, and the lack of annotated dataset in user-generated content of software knowledge community, it is difficult to apply existing methods of relation extraction in the software knowledge domain. To address these issues, we propose a novel software knowledge entity relation extraction model which incorporates entity-aware information with syntactic dependency information. Bidirectional Gated Recurrent Unit (Bi-GRU) and Graph Convolutional Networks (GCN) are used to learn the features of contextual semantic representation and syntactic dependency representation, respectively. To obtain more syntactic dependency information, a weight graph convolutional network based on Newton’s cooling law is constructed by calculating a weight adjacency matrix. Specifically, an entity-aware attention mechanism is proposed to integrate the entity information and syntactic dependency information to improve the prediction performance of the model. Experiments are conducted on a dataset which is constructed based on texts of the StackOverflow and show that the proposed model has better performance than the benchmark models.

CyberEyes: Cybersecurity Entity Recognition Model Based on Graph Convolutional Network

2020 ◽  
Author(s):  
Yong Fang ◽  
Yuchi Zhang ◽  
Cheng Huang
Keyword(s):  
Complex Structure ◽  
Named Entity Recognition ◽  
Internet Technology ◽  
Entity Recognition ◽  
Local Context ◽  
Knowledge Graph ◽  
Convolutional Network ◽  
Evaluation Standard ◽  
Recognition Model ◽  
Non Local

Abstract Cybersecurity has gradually become the public focus between common people and countries with the high development of Internet technology in daily life. The cybersecurity knowledge analysis methods have achieved high evolution with the help of knowledge graph technology, especially a lot of threat intelligence information could be extracted with fine granularity. But named entity recognition (NER) is the primary task for constructing security knowledge graph. Traditional NER models are difficult to determine entities that have a complex structure in the field of cybersecurity, and it is difficult to capture non-local and non-sequential dependencies. In this paper, we propose a cybersecurity entity recognition model CyberEyes that uses non-local dependencies extracted by graph convolutional neural networks. The model can capture both local context and graph-level non-local dependencies. In the evaluation experiments, our model reached an F1 score of 90.28% on the cybersecurity corpus under the gold evaluation standard for NER, which performed better than the 86.49% obtained by the classic CNN-BiLSTM-CRF model.

Embodying the Number of an Entity’s Relations for Knowledge Representation Learning

2021 ◽  
Vol 31 (10) ◽  
pp. 1495-1515
Author(s):  
Xinhua Suo ◽  
Bing Guo ◽  
Yan Shen ◽  
Wei Wang ◽  
Yaosen Chen ◽  
...  
Keyword(s):  
Knowledge Representation ◽  
Visual Information ◽  
Large Scale ◽  
Critical Role ◽  
Representation Learning ◽  
Knowledge Graph ◽  
Source Information ◽  
Structure Information ◽  
Common Information ◽  
Additional Information

Knowledge representation learning (knowledge graph embedding) plays a critical role in the application of knowledge graph construction. The multi-source information knowledge representation learning, which is one class of the most promising knowledge representation learning at present, mainly focuses on learning a large number of useful additional information of entities and relations in the knowledge graph into their embeddings, such as the text description information, entity type information, visual information, graph structure information, etc. However, there is a kind of simple but very common information — the number of an entity’s relations which means the number of an entity’s semantic types has been ignored. This work proposes a multi-source knowledge representation learning model KRL-NER, which embodies information of the number of an entity’s relations between entities into the entities’ embeddings through the attention mechanism. Specifically, first of all, we design and construct a submodel of the KRL-NER LearnNER which learns an embedding including the information on the number of an entity’s relations; then, we obtain a new embedding by exerting attention onto the embedding learned by the models such as TransE with this embedding; finally, we translate based onto the new embedding. Experiments, such as related tasks on knowledge graph: entity prediction, entity prediction under different relation types, and triple classification, are carried out to verify our model. The results show that our model is effective on the large-scale knowledge graphs, e.g. FB15K.

End-to-end Relation-Enhanced Learnable Graph Self-attention Network for Knowledge Graphs Embedding

2021 ◽  
Author(s):  
Shengchen Jiang ◽  
Hongbin Wang ◽  
Xiang Hou
Keyword(s):  
Large Scale ◽  
Structural Characteristics ◽  
Graph Embedding ◽  
Knowledge Graph ◽  
Data Sets ◽  
Relevance Ranking ◽  
Convolutional Network ◽  
Attention Network ◽  
Knowledge Graphs ◽  
End To End

Abstract The existing methods ignore the adverse effect of knowledge graph incompleteness on knowledge graph embedding. In addition, the complexity and large-scale of knowledge information hinder knowledge graph embedding performance of the classic graph convolutional network. In this paper, we analyzed the structural characteristics of knowledge graph and the imbalance of knowledge information. Complex knowledge information requires that the model should have better learnability, rather than linearly weighted qualitative constraints, so the method of end-to-end relation-enhanced learnable graph self-attention network for knowledge graphs embedding is proposed. Firstly, we construct the relation-enhanced adjacency matrix to consider the incompleteness of the knowledge graph. Secondly, the graph self-attention network is employed to obtain the global encoding and relevance ranking of entity node information. Thirdly, we propose the concept of convolutional knowledge subgraph, it is constructed according to the entity relevance ranking. Finally, we improve the training effect of the convKB model by changing the construction of negative samples to obtain a better reliability score in the decoder. The experimental results based on the data sets FB15k-237 and WN18RR show that the proposed method facilitates more comprehensive representation of knowledge information than the existing methods, in terms of Hits@10 and MRR.

scholarly journals Relation Extraction with Convolutional Network over Learnable Syntax-Transport Graph

2020 ◽  
Vol 34 (05) ◽  
pp. 8928-8935
Author(s):  
Kai Sun ◽  
Richong Zhang ◽  
Yongyi Mao ◽  
Samuel Mensah ◽  
Xudong Liu
Keyword(s):  
Relation Extraction ◽  
Weighted Graph ◽  
Relevant Information ◽  
Irrelevant Information ◽  
Classification Task ◽  
Convolutional Network ◽  
Structure Information ◽  
Convolutional Networks ◽  
Dependency Tree ◽  
Relation Classification

A large majority of approaches have been proposed to leverage the dependency tree in the relation classification task. Recent works have focused on pruning irrelevant information from the dependency tree. The state-of-the-art Attention Guided Graph Convolutional Networks (AGGCNs) transforms the dependency tree into a weighted-graph to distinguish the relevance of nodes and edges for relation classification. However, in their approach, the graph is fully connected, which destroys the structure information of the original dependency tree. How to effectively make use of relevant information while ignoring irrelevant information from the dependency trees remains a challenge in the relation classification task. In this work, we learn to transform the dependency tree into a weighted graph by considering the syntax dependencies of the connected nodes and persisting the structure of the original dependency tree. We refer to this graph as a syntax-transport graph. We further propose a learnable syntax-transport attention graph convolutional network (LST-AGCN) which operates on the syntax-transport graph directly to distill the final representation which is sufficient for classification. Experiments on Semeval-2010 Task 8 and Tacred show our approach outperforms previous methods.

scholarly journals KGGCN: Knowledge-Guided Graph Convolutional Networks for Distantly Supervised Relation Extraction

2021 ◽  
Vol 11 (16) ◽  
pp. 7734
Author(s):  
Ningyi Mao ◽  
Wenti Huang ◽  
Hai Zhong
Keyword(s):  
Prior Knowledge ◽  
Structural Information ◽  
Relation Extraction ◽  
Attention Mechanism ◽  
Knowledge Graph ◽  
Convolutional Network ◽  
Convolutional Networks ◽  
Lexical Resource ◽  
Sentence Level ◽  
The Impact

Distantly supervised relation extraction is the most popular technique for identifying semantic relation between two entities. Most prior models only focus on the supervision information present in training sentences. In addition to training sentences, external lexical resource and knowledge graphs often contain other relevant prior knowledge. However, relation extraction models usually ignore such readily available information. Moreover, previous works only utilize a selective attention mechanism over sentences to alleviate the impact of noise, they lack the consideration of the implicit interaction between sentences with relation facts. In this paper, (1) a knowledge-guided graph convolutional network is proposed based on the word-level attention mechanism to encode the sentences. It can capture the key words and cue phrases to generate expressive sentence-level features by attending to the relation indicators obtained from the external lexical resource. (2) A knowledge-guided sentence selector is proposed, which explores the semantic and structural information of triples from knowledge graph as sentence-level knowledge attention to distinguish the importance of each individual sentence. Experimental results on two widely used datasets, NYT-FB and GDS, show that our approach is able to efficiently use the prior knowledge from the external lexical resource and knowledge graph to enhance the performance of distantly supervised relation extraction.

Research on Pattern Representation Based on Keyword and Word Embedding in Chinese Entity Relation Extraction

2018 ◽  
Vol 22 (4) ◽  
pp. 475-482
Author(s):  
Feiyue Ye ◽  
◽  
Zhentao Qin
Keyword(s):  
Large Scale ◽  
Rapid Development ◽  
Relation Extraction ◽  
High Accuracy ◽  
Word Embedding ◽  
Context Information ◽  
Extraction Technology ◽  
Entity Relation Extraction ◽  
The Relationship

With the rapid development of the Internet, it is becoming more and more important to extract the relationship between the entity from the massive network text and then to build the knowledge graph or the knowledge base. In this paper, we focus on the research of the pattern representation in relation extraction, and extract the high accuracy Chinese entity pairs from large scale web texts. Past relation patterns only consider shallow lexical and syntax, not accurately and deeply express pattern context information, and do not consider keywords information. According to the new entity relation extraction technology and the characteristics of Chinese corpora, we define pattern representation based on keywords and word embedding information, extract deep semantic feature of context information, and strengthen keywords information effect for relation extraction. In addition, we propose a method for obtaining sentence keyword based on word embedding. In the experiment, we use ChineseHudongEncyclopedia corpus to implement the character relation extraction system, and test the character relation extraction effect. The experimental results show that this method effectively improves the quality of the pattern, and obtains a favorable relation extraction performance.

scholarly journals NPU RGB+D Dataset and a Feature-Enhanced LSTM-DGCN Method for Action Recognition of Basketball Players

2021 ◽  
Vol 11 (10) ◽  
pp. 4426
Author(s):  
Chunyan Ma ◽  
Ji Fan ◽  
Jinghao Yao ◽  
Tao Zhang
Keyword(s):  
Action Recognition ◽  
Large Scale ◽  
Short Term Memory ◽  
Evaluation Criteria ◽  
Image Data ◽  
Basketball Player ◽  
Basketball Players ◽  
Convolutional Network ◽  
Atomic Actions ◽  
New Feature

Computer vision-based action recognition of basketball players in basketball training and competition has gradually become a research hotspot. However, owing to the complex technical action, diverse background, and limb occlusion, it remains a challenging task without effective solutions or public dataset benchmarks. In this study, we defined 32 kinds of atomic actions covering most of the complex actions for basketball players and built the dataset NPU RGB+D (a large scale dataset of basketball action recognition with RGB image data and Depth data captured in Northwestern Polytechnical University) for 12 kinds of actions of 10 professional basketball players with 2169 RGB+D videos and 75 thousand frames, including RGB frame sequences, depth maps, and skeleton coordinates. Through extracting the spatial features of the distances and angles between the joint points of basketball players, we created a new feature-enhanced skeleton-based method called LSTM-DGCN for basketball player action recognition based on the deep graph convolutional network (DGCN) and long short-term memory (LSTM) methods. Many advanced action recognition methods were evaluated on our dataset and compared with our proposed method. The experimental results show that the NPU RGB+D dataset is very competitive with the current action recognition algorithms and that our LSTM-DGCN outperforms the state-of-the-art action recognition methods in various evaluation criteria on our dataset. Our action classifications and this NPU RGB+D dataset are valuable for basketball player action recognition techniques. The feature-enhanced LSTM-DGCN has a more accurate action recognition effect, which improves the motion expression ability of the skeleton data.

scholarly journals A Novel Method to Predict Drug-Target Interactions Based on Large-Scale Graph Representation Learning

Cancers ◽  
2021 ◽  
Vol 13 (9) ◽  
pp. 2111
Author(s):  
Bo-Wei Zhao ◽  
Zhu-Hong You ◽  
Lun Hu ◽  
Zhen-Hao Guo ◽  
Lei Wang ◽  
...  
Keyword(s):  
Drug Target ◽  
Large Scale ◽  
Computational Models ◽  
Structural Information ◽  
Characteristic Curve ◽  
Representation Learning ◽  
Graph Representation ◽  
Convolutional Network ◽  
Novel Method

Identification of drug-target interactions (DTIs) is a significant step in the drug discovery or repositioning process. Compared with the time-consuming and labor-intensive in vivo experimental methods, the computational models can provide high-quality DTI candidates in an instant. In this study, we propose a novel method called LGDTI to predict DTIs based on large-scale graph representation learning. LGDTI can capture the local and global structural information of the graph. Specifically, the first-order neighbor information of nodes can be aggregated by the graph convolutional network (GCN); on the other hand, the high-order neighbor information of nodes can be learned by the graph embedding method called DeepWalk. Finally, the two kinds of feature are fed into the random forest classifier to train and predict potential DTIs. The results show that our method obtained area under the receiver operating characteristic curve (AUROC) of 0.9455 and area under the precision-recall curve (AUPR) of 0.9491 under 5-fold cross-validation. Moreover, we compare the presented method with some existing state-of-the-art methods. These results imply that LGDTI can efficiently and robustly capture undiscovered DTIs. Moreover, the proposed model is expected to bring new inspiration and provide novel perspectives to relevant researchers.

Sign in / Sign up

Export Citation Format

Share Document