期刊文献+
共找到10篇文章
< 1 >
每页显示 20 50 100
Syntax-Enhanced Entity Relation Extraction with Complex Knowledge
1
作者 Mingwen Bi Hefei Chen Zhenghong Yang 《Computers, Materials & Continua》 2025年第4期861-876,共16页
Entity relation extraction,a fundamental and essential task in natural language processing(NLP),has garnered significant attention over an extended period.,aiming to extract the core of semantic knowledge from unstruc... Entity relation extraction,a fundamental and essential task in natural language processing(NLP),has garnered significant attention over an extended period.,aiming to extract the core of semantic knowledge from unstructured text,i.e.,entities and the relations between them.At present,the main dilemma of Chinese entity relation extraction research lies in nested entities,relation overlap,and lack of entity relation interaction.This dilemma is particularly prominent in complex knowledge extraction tasks with high-density knowledge,imprecise syntactic structure,and lack of semantic roles.To address these challenges,this paper presents an innovative“character-level”Chinese part-of-speech(CN-POS)tagging approach and incorporates part-of-speech(POS)information into the pre-trained model,aiming to improve its semantic understanding and syntactic information processing capabilities.Additionally,A relation reference filling mechanism(RF)is proposed to enhance the semantic interaction between relations and entities,utilize relations to guide entity modeling,improve the boundary prediction ability of entity models for nested entity phenomena,and increase the cascading accuracy of entity-relation triples.Meanwhile,the“Queue”sub-task connection strategy is adopted to alleviate triplet cascading errors caused by overlapping relations,and a Syntax-enhanced entity relation extraction model(SE-RE)is constructed.The model showed excellent performance on the self-constructed E-commerce Product Information dataset(EPI)in this article.The results demonstrate that integrating POS enhancement into the pre-trained encoding model significantly boosts the performance of entity relation extraction models compared to baseline methods.Specifically,the F1-score fluctuation in subtasks caused by error accumulation was reduced by 3.21%,while the F1-score for entity-relation triplet extraction improved by 1.91%. 展开更多
关键词 entity relation extraction complex knowledge syntax-enhanced semantic interaction pre-trained BERT
在线阅读 下载PDF
Language Adaptation for Entity Relation Classification via Adversarial Neural Networks 被引量:1
2
作者 Bo-Wei Zou Rong-Tao Huang +2 位作者 Zeng-Zhuang Xu Yu Hong Guo-Dong Zhou 《Journal of Computer Science & Technology》 SCIE EI CSCD 2021年第1期207-220,共14页
Entity relation classification aims to classify the semantic relationship between two marked entities in a given sentence,and plays a vital role in various natural language processing applications.However,existing stu... Entity relation classification aims to classify the semantic relationship between two marked entities in a given sentence,and plays a vital role in various natural language processing applications.However,existing studies focus on exploiting mono-lingual data in English,due to the lack of labeled data in other languages.How to effectively benefit from a richly-labeled language to help a poorly-labeled language is still an open problem.In this paper,we come up with a language adaptation framework for cross-lingual entity relation classification.The basic idea is to employ adversarial neural networks(AdvNN)to transfer feature representations from one language to another.Especially,such a language adaptation framework enables feature imitation via the competition between a sentence encoder and a rival language discriminator to generate effective representations.To verify the effectiveness of AdvNN,we introduce two kinds of adversarial structures,dual-channel AdvNN and single-channel AdvNN.Experimental results on the ACE 2005 multilingual training corpus show that our single-channel AdvNN achieves the best performance on both unsupervised and semi-supervised scenarios,yielding an improvement of 6.61%and 2.98%over the state-of-the-art,respectively.Compared with baselines which directly adopt a machine translation module,we find that both dual-channel and single-channel AdvNN significantly improve the performances(F1)of cross-lingual entity relation classification.Moreover,extensive analysis and discussion demonstrate the appropriateness and effectiveness of different parameter settings in our language adaptation framework. 展开更多
关键词 adversarial neural network entity relation classification language adaptation
原文传递
Targeted BERT Pre-training and Fine-Tuning Approach for Entity Relation Extraction
3
作者 Chao Li Zhao Qiu 《国际计算机前沿大会会议论文集》 2021年第2期116-125,共10页
Entity relation extraction(ERE)is an important task in the field of information extraction.With the wide application of pre-training language model(PLM)in natural language processing(NLP),using PLM has become a brand ... Entity relation extraction(ERE)is an important task in the field of information extraction.With the wide application of pre-training language model(PLM)in natural language processing(NLP),using PLM has become a brand new research direction of ERE.In this paper,BERT is used to extracting entityrelations,and a separated pipeline architecture is proposed.ERE was decomposed into entity-relation classification sub-task and entity-pair annotation sub-task.Both sub-tasks conduct the pre-training and fine-tuning independently.Combining dynamic and static masking,newVerb-MLM and Entity-MLM BERT pre-training tasks were put forward to enhance the correlation between BERT pre-training and TargetedNLPdownstream task-ERE.Inter-layer sharing attentionmechanismwas added to the model,sharing the attention parameters according to the similarity of the attention matrix.Contrast experiment on the SemEavl 2010 Task8 dataset demonstrates that the new MLM task and inter-layer sharing attention mechanism improve the performance of BERT on the entity relation extraction effectively. 展开更多
关键词 entity relation extraction BERT Verb-MLM entity-MLM Inter-layer sharing attention mechanism
原文传递
Entity and Relationship Extraction with High-quality Spans and Enhanced Marker Strategies
4
作者 Qibin Li Nianmin Yao Nai Zhou 《Machine Intelligence Research》 2025年第2期289-303,共15页
Entity and relation extraction is a critical task in information extraction.Recent approaches have emphasized obtaining improved span representations.However,existing work suffers from two major drawbacks.First,there ... Entity and relation extraction is a critical task in information extraction.Recent approaches have emphasized obtaining improved span representations.However,existing work suffers from two major drawbacks.First,there is an overabundance of low-quality candidate spans,which hinders the effective extraction of information from high-quality candidate spans.Second,the information encoded by existing marker strategies is often too simple to fully capture the nuances of the span,resulting in the loss of potentially valuable information.To address these issues,we propose an enhancing entity and relation extraction with high-quality spans and enhanced marker(HSEM)strategies,it assigns adaptive weights to different spans in order to make the model more focused on high quality spans.Specifically,the HSEM model enriches marker representation to incorporate more span information and enhance entity categorization.Additionally,we design a span scoring framework that assesses span quality based on the fusion of internal information and focuses the model on training high-quality samples to improve performance.Experimental results on six benchmark datasets demonstrate that our model achieves state-of-the-art results after discriminating span quality. 展开更多
关键词 High-quality spans enhanced marker span scoring framework span representations entity and relation extraction
原文传递
Efficient Parameterization for Knowledge Graph Embedding Using Hierarchical Attention Network
5
作者 Zhen-Yu Chen Feng-Chi Liu +2 位作者 Xin Wang Cheng-Hsiung Lee Ching-Sheng Lin 《Computers, Materials & Continua》 2025年第3期4287-4300,共14页
In the domain of knowledge graph embedding,conventional approaches typically transform entities and relations into continuous vector spaces.However,parameter efficiency becomes increasingly crucial when dealing with l... In the domain of knowledge graph embedding,conventional approaches typically transform entities and relations into continuous vector spaces.However,parameter efficiency becomes increasingly crucial when dealing with large-scale knowledge graphs that contain vast numbers of entities and relations.In particular,resource-intensive embeddings often lead to increased computational costs,and may limit scalability and adaptability in practical environ-ments,such as in low-resource settings or real-world applications.This paper explores an approach to knowledge graph representation learning that leverages small,reserved entities and relation sets for parameter-efficient embedding.We introduce a hierarchical attention network designed to refine and maximize the representational quality of embeddings by selectively focusing on these reserved sets,thereby reducing model complexity.Empirical assessments validate that our model achieves high performance on the benchmark dataset with fewer parameters and smaller embedding dimensions.The ablation studies further highlight the impact and contribution of each component in the proposed hierarchical attention structure. 展开更多
关键词 Knowledge graph embedding parameter efficiency representation learning reserved entity and relation sets hierarchical attention network
在线阅读 下载PDF
Relation Enhanced Neural Model for Type Classification of EntityMentions with a Fine-Grained Taxonomy
6
作者 Kai-Yuan Cui Peng-Jie Ren +2 位作者 Zhu-Min Chen Tao Lian Jun Ma 《Journal of Computer Science & Technology》 SCIE EI CSCD 2017年第4期814-827,共14页
Inferring semantic types of the entity mentions in a sentence is a necessary yet challenging task. Most of existing methods employ a very coarse-grained type taxonomy, which is too general and not exact enough for man... Inferring semantic types of the entity mentions in a sentence is a necessary yet challenging task. Most of existing methods employ a very coarse-grained type taxonomy, which is too general and not exact enough for many tasks. However, the performances of the methods drop sharply when we extend the type taxonomy to a fine-grained one with several hundreds of types. In this paper, we introduce a hybrid neural network model for type classification of entity mentions with a fine-grained taxonomy. There are four components in our model, namely, the entity mention component, the context component, the relation component, the already known type component, which are used to extract features from the target entity mention, context, relations and already known types of the entity mentions in surrounding context respectively. The learned features by the four components are concatenated and fed into a softmax layer to predict the type distribution. We carried out extensive experiments to evaluate our proposed model. Experimental results demonstrate that our model achieves state-of-the-art performance on the FIGER dataset. Moreover, we extracted larger datasets from Wikipedia and DBpedia. On the larger datasets, our model achieves the comparable performance to the state-of-the-art methods with the coarse-grained type taxonomy, but performs much better than those methods with the fine-grained type taxonomy in terms of micro-F1, macro-F1 and weighted-F1. 展开更多
关键词 entity mention classification entity mention relation fine-grained taxonomy
原文传递
IndRT-GCNets: Knowledge Reasoning with Independent Recurrent Temporal Graph Convolutional Representations
7
作者 Yajing Ma Gulila Altenbek Yingxia Yu 《Computers, Materials & Continua》 SCIE EI 2024年第1期695-712,共18页
Due to the structural dependencies among concurrent events in the knowledge graph and the substantial amount of sequential correlation information carried by temporally adjacent events,we propose an Independent Recurr... Due to the structural dependencies among concurrent events in the knowledge graph and the substantial amount of sequential correlation information carried by temporally adjacent events,we propose an Independent Recurrent Temporal Graph Convolution Networks(IndRT-GCNets)framework to efficiently and accurately capture event attribute information.The framework models the knowledge graph sequences to learn the evolutionary represen-tations of entities and relations within each period.Firstly,by utilizing the temporal graph convolution module in the evolutionary representation unit,the framework captures the structural dependency relationships within the knowledge graph in each period.Meanwhile,to achieve better event representation and establish effective correlations,an independent recurrent neural network is employed to implement auto-regressive modeling.Furthermore,static attributes of entities in the entity-relation events are constrained andmerged using a static graph constraint to obtain optimal entity representations.Finally,the evolution of entity and relation representations is utilized to predict events in the next subsequent step.On multiple real-world datasets such as Freebase13(FB13),Freebase 15k(FB15K),WordNet11(WN11),WordNet18(WN18),FB15K-237,WN18RR,YAGO3-10,and Nell-995,the results of multiple evaluation indicators show that our proposed IndRT-GCNets framework outperforms most existing models on knowledge reasoning tasks,which validates the effectiveness and robustness. 展开更多
关键词 Knowledge reasoning entity and relation representation structural dependency relationship evolutionary representation temporal graph convolution
在线阅读 下载PDF
Entity-related paths modeling for knowledge base completion 被引量:3
8
作者 Fangfang Liu Yan Shen +1 位作者 Tienan Zhang Honghao Gao 《Frontiers of Computer Science》 SCIE EI CSCD 2020年第5期89-97,共9页
Knowledge bases(KBs)are far from complete,necessitating a demand for KB completion.Among various methods,embedding has received increasing attention in recent years.PTransE,an important approach using embedding method... Knowledge bases(KBs)are far from complete,necessitating a demand for KB completion.Among various methods,embedding has received increasing attention in recent years.PTransE,an important approach using embedding method in KB completion,considers multiple-step relation paths based on TransE,but ignores the association between entity and their related entities with the same direct relationships.In this paper,we propose an approach called EP-TransE,which considers this kind of association.As a matter of fact,the dissimilarity of these related entities should be taken into consideration and it should not exceed a certain threshold.EPTransE adjusts the embedding vector of an entity by comparing it with its related entities which are connected by the same direct relationship.EPTransE further makes the euclidean distance between them less than a certain threshold.Therefore,the embedding vectors of entities are able to contain rich semantic information,which is valuable for KB completion.In experiments,we evaluated our approach on two tasks,including entity prediction and relation prediction.Experimental results show that our idea of considering the dissimilarity of related entities with the same direct relationships is effective. 展开更多
关键词 KB completion related entity embedding representation relation path translation operation
原文传递
Annotation and Joint Extraction of Scientific Entities and Relationships in NSFC Project Texts
9
作者 Zhiyuan GE Xiaoxi QI +5 位作者 Fei WANG Tingli LIU Jun GUAN Xiaohong HUANG Yong SHAO Yingmin WU 《Journal of Systems Science and Information》 CSCD 2023年第4期466-487,共22页
Aiming at the lack of classification and good standard corpus in the task of joint entity and relationship extraction in the current Chinese academic field, this paper builds a dataset in management science that can b... Aiming at the lack of classification and good standard corpus in the task of joint entity and relationship extraction in the current Chinese academic field, this paper builds a dataset in management science that can be used for joint entity and relationship extraction, and establishes a deep learning model to extract entity and relationship information from scientific texts. With the definition of entity and relation classification, we build a Chinese scientific text corpus dataset based on the abstract texts of projects funded by the National Natural Science Foundation of China(NSFC) in 2018–2019. By combining the word2vec features with the clue word feature which is a kind of special style in scientific documents, we establish a joint entity relationship extraction model based on the Bi LSTM-CNN-CRF model for scientific information extraction. The dataset we constructed contains 13060 entities(not duplicated) and 9728 entity relation labels. In terms of entity prediction effect, the accuracy rate of the constructed model reaches 69.15%, the recall rate reaches 61.03%, and the F1 value reaches 64.83%. In terms of relationship prediction effect, the accuracy rate is higher than that of entity prediction, which reflects the effectiveness of the input mixed features and the integration of local features with CNN layer in the model. 展开更多
关键词 joint extraction of entities and relations deep learning Chinese scientific information extraction
原文传递
Automatic Construction of Knowledge Graphs from Scientific Literature for Copper-based Composites
10
作者 Zixuan Hu Jinguo You +3 位作者 Xingrui Huang Huaze Huang Jingmei Tao Jianhong Yi 《Data Intelligence》 2024年第4期1168-1189,共22页
Providing knowledge graphs for materials science facilitates understanding of the key data such as materials structure,property,etc.and their relations.However,very little work has been devoted to it.Meanwhile,immedia... Providing knowledge graphs for materials science facilitates understanding of the key data such as materials structure,property,etc.and their relations.However,very little work has been devoted to it.Meanwhile,immediately applying machine learning to materials computation still suffers from the lack of data and costly acquiring.To tackle these problems,we propose literature-aid automatic entity and relation extraction by deliberatively designed matching rules,especially for copper-based composites.Next,we fuse the knowledge by calculating the semantics similarity.Finally,the materials knowledge graphs are constructed and visualized on the Neo4j graph database.The experimental results show a total of 6,154 entities and 15,561 pairs of relations are extracted on the 69,600 open-accessed documents of copper-based composites,with their precision and accuracy rates over 80%.Further,we exemplify the effectiveness by building materials structure-property-value meta-paths and analyzing their impacts. 展开更多
关键词 Knowledge graph entity relation extraction Scientific literature data Automatic construction Copperbased composites
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部