检索结果-南通市图书馆

A Joint Entity relation extraction Model Based on relation Semantic Template Automatically Constructed

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第1期78卷 975-997页

作者： Wei Liu Meijuan Yin Jialong Zhang Lunchong Cui Key Laboratory of Cyberspace Situation Awareness of Henan Province Zhengzhou450001China

The joint entity relation extraction model which integrates the semantic information of relation is favored by relevant researchers because of its effectiveness in solving the overlapping of entities,and the method of defining the semantic template of relation manually is particularly prominent in the extraction effect because it can obtain the deep semantic information of relation.However,this method has some problems,such as relying on expert experience and poor portability.Inspired by the rule-based entity relation extraction method,this paper proposes a joint entity relation extraction model based on a relation semantic template automatically constructed,which is abbreviated as RSTAC.This model refines the extraction rules of relation semantic templates from relation corpus through dependency parsing and realizes the automatic construction of relation semantic templates.Based on the relation semantic template,the process of relation classification and triplet extraction is constrained,and finally,the entity relation triplet is obtained.The experimental results on the three major Chinese datasets of DuIE,SanWen,and FinRE showthat the RSTAC model successfully obtains rich deep semantics of relation,improves the extraction effect of entity relation triples,and the F1 scores are increased by an average of 0.96% compared with classical joint extraction models such as CasRel,TPLinker,and RFBFN.

关键词： Natural language processing deep learning information extraction relation extraction relation semantic template

Graph Convolutional Networks Embedding Textual Structure Information for relation extraction

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第5期79卷 3299-3314页

作者： Chuyuan Wei Jinzhe Li Zhiyuan Wang Shanshan Wan Maozu Guo School of Electrical and Information Engineering Beijing University of Civil Engineering and ArchitectureBeijing102616China

Deep neural network-based relational extraction research has made significant progress in recent years,andit provides data support for many natural language processing downstream tasks such as building knowledgegraph,sentiment analysis and question-answering systems.However,previous studies ignored much unusedstructural information in sentences that could enhance the performance of the relation extraction task.Moreover,most existing dependency-based models utilize self-attention to distinguish the importance of context,whichhardly deals withmultiple-structure information.To efficiently leverage multiple structure information,this paperproposes a dynamic structure attention mechanism model based on textual structure information,which deeplyintegrates word embedding,named entity recognition labels,part of speech,dependency tree and dependency typeinto a graph convolutional network.Specifically,our model extracts text features of different structures from theinput sentence.Textual Structure information Graph Convolutional Networks employs the dynamic structureattention mechanism to learn multi-structure attention,effectively distinguishing important contextual features invarious structural information.In addition,multi-structure weights are carefully designed as amergingmechanismin the different structure attention to dynamically adjust the final attention.This paper combines these featuresand trains a graph convolutional network for relation extraction.We experiment on supervised relation extractiondatasets including SemEval 2010 Task 8,TACRED,TACREV,and Re-TACED,the result significantly outperformsthe previous.

关键词： relation extraction graph convolutional neural networks dependency tree dynamic structure attention

A Survey of Knowledge Graph Construction Using Machine Learning

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computer Modeling in Engineering & Sciences 2024年第4期139卷 225-257页

作者： Zhigang Zhao Xiong Luo Maojian Chen Ling Ma School of Computer and Communication Engineering University of Science and Technology BeijingBeijing100083China Shunde Innovation School University of Science and Technology BeijingFoshan528399China Beijing Key Laboratory of Knowledge Engineering for Materials Science Beijing100083China

Knowledge graph(KG)serves as a specialized semantic network that encapsulates intricate relationships among real-world entities within a structured framework.This framework facilitates a transformation in information retrieval,transitioning it from mere string matching to far more sophisticated entity matching.In this transformative process,the advancement of artificial intelligence and intelligent information services is invigorated.Meanwhile,the role ofmachine learningmethod in the construction of KG is important,and these techniques have already achieved initial success.This article embarks on a comprehensive journey through the last strides in the field of KG via machine learning.With a profound amalgamation of cutting-edge research in machine learning,this article undertakes a systematical exploration of KG construction methods in three distinct phases:entity learning,ontology learning,and knowledge reasoning.Especially,a meticulous dissection of machine learningdriven algorithms is conducted,spotlighting their contributions to critical facets such as entity extraction,relation extraction,entity linking,and link prediction.Moreover,this article also provides an analysis of the unresolved challenges and emerging trajectories that beckon within the expansive application of machine learning-fueled,large-scale KG construction.

关键词： Knowledge graph(KG) semantic network relation extraction entity linking knowledge reasoning

relation extraction Based on Prompt Information and Feature Reuse

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Data Intelligence 2023年第3期5卷 824-840页

作者： Ping Feng Xin Zhang Jian Zhao Yingying Wang Biao Huang Jilin University Changchun Jilin 130012China Changchun Universiy Changchun Jilin 130022China Jilin Provincial Key Laboratory of Human Health State Identification and Function Enhancement Changchun Jjilin 130022China

To alleviate the problem of under-utilization features of sentence-level relation extraction,which leads to insufficient performance of the pre-trained language model and underutilization of the feature vector,a sentence-level relation extraction method based on adding prompt information and feature reuse is proposed.At first,in addition to the pair of nominals and sentence information,a piece of prompt information is added,and the overall feature information consists of sentence information,entity pair information,and prompt information,and then the features are encoded by the pre-trained language model ROBERTA.Moreover,in the pre-trained language model,BIGRU is also introduced in the composition of the neural network to extract information,and the feature information is passed through the neural network to form several sets of feature vectors.After that,these feature vectors are reused in different combinations to form multiple outputs,and the outputs are aggregated using ensemble-learning soft voting to perform relation classification.In addition to this,the sum of cross-entropy,KL divergence,and negative log-likelihood loss is used as the final loss function in this paper.In the comparison experiments,the model based on adding prompt information and feature reuse achieved higher results of the SemEval-2010 task 8 relational dataset.

关键词： relation extraction language model prompt information feature reuse loss function

relational Turkish Text Classification Using Distant Supervised Entities and relations

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Computers, Materials & Continua 2024年第5期79卷 2209-2228页

作者： Halil Ibrahim Okur Kadir Tohma Ahmet Sertbas Department of Computer Engineering Faculty of Engineering and Natural SciencesIskenderun Technical UniversityHatay31200Turkey Department of Computer Engineering Faculty of EngineeringIstanbul University-CerrahpasaIstanbul34310Turkey

Text classification,by automatically categorizing texts,is one of the foundational elements of natural language processing applications.This study investigates how text classification performance can be improved through the integration of entity-relation information obtained from the Wikidata(Wikipedia database)database and BERTbased pre-trained Named Entity Recognition(NER)models.Focusing on a significant challenge in the field of natural language processing(NLP),the research evaluates the potential of using entity and relational information to extract deeper meaning from texts.The adopted methodology encompasses a comprehensive approach that includes text preprocessing,entity detection,and the integration of relational information.Experiments conducted on text datasets in both Turkish and English assess the performance of various classification algorithms,such as Support Vector Machine,Logistic Regression,Deep Neural Network,and Convolutional Neural Network.The results indicate that the integration of entity-relation information can significantly enhance algorithmperformance in text classification tasks and offer new perspectives for information extraction and semantic analysis in NLP applications.Contributions of this work include the utilization of distant supervised entity-relation information in Turkish text classification,the development of a Turkish relational text classification approach,and the creation of a relational database.By demonstrating potential performance improvements through the integration of distant supervised entity-relation information into Turkish text classification,this research aims to support the effectiveness of text-based artificial intelligence(AI)tools.Additionally,it makes significant contributions to the development ofmultilingual text classification systems by adding deeper meaning to text content,thereby providing a valuable addition to current NLP studies and setting an important reference point for future research.

关键词： Text classification relation extraction NER distant supervision deep learning machine learning

Combining Deep Learning with Knowledge Graph for Design Knowledge Acquisition in Conceptual Product Design

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

工程与科学中的计算机建模(英文) 2024年第1期138卷 167-200页

作者： Yuexin Huang Suihuai Yu Jianjie Chu Zhaojing Su Yangfan Cong Hanyu Wang Hao Fan Key Laboratory of Industrial Design and Ergonomics Ministry of Industry and Information TechnologyNorthwestern Polytechnical UniversityXi’an710072China School of Industrial Design Engineering Delft University of TechnologyDelft2628 CEThe Netherlands Department of Industrial Design College of ArtsShandong University of Science and TechnologyTsingtao266590China College of Computer Science and Technology Zhejiang UniversityHangzhou310027China

The acquisition of valuable design knowledge from massive fragmentary data is challenging for designers in conceptual product design.This study proposes a novel method for acquiring design knowledge by combining deep learning with knowledge graph.Specifically,the design knowledge acquisition method utilises the knowledge extraction model to extract design-related entities and relations from fragmentary data,and further constructs the knowledge graph to support design knowledge acquisition for conceptual product design.Moreover,the knowledge extraction model introduces ALBERT to solve memory limitation and communication overhead in the entity extraction module,and uses multi-granularity information to overcome segmentation errors and polysemy ambiguity in the relation extraction module.Experimental comparison verified the effectiveness and accuracy of the proposed knowledge extraction model.The case study demonstrated the feasibility of the knowledge graph construction with real fragmentary porcelain data and showed the capability to provide designers with interconnected and visualised design knowledge.

关键词： Conceptual product design design knowledge acquisition knowledge graph entity extraction relation extraction

Neural Attentional relation extraction with Dual Dependency Trees

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2022年第6期37卷 1369-1381页

作者：李冬雷智磊宋宝燕纪婉婷寇月 School of Information Liaoning UniversityShenyang 110036China School of Computer Science and Engineering Northeastern UniversityShenyang 110004China

relation extraction has been widely used to find semantic relations between entities from plain text.Dependency trees provide deeper semantic information for relation extraction.However,existing dependency tree based models adopt pruning strategies that are too aggressive or conservative,leading to insufficient semantic information or excessive noise in relation extraction models.To overcome this issue,we propose the Neural Attentional relation extraction Model with Dual Dependency Trees(called DDT-REM),which takes advantage of both the syntactic dependency tree and the semantic dependency tree to well capture syntactic features and semantic features,respectively.Specifically,we first propose novel representation learning to capture the dependency relations from both syntax and semantics.Second,for the syntactic dependency tree,we propose a local-global attention mechanism to solve semantic deficits.We design an extension of graph convolutional networks(GCNs)to perform relation extraction,which effectively improves the extraction accuracy.We conduct experimental studies based on three real-world datasets.Compared with the traditional methods,our method improves the F 1 scores by 0.3,0.1 and 1.6 on three real-world datasets,respectively.

关键词： relation extraction graph convolutional network(GCN) syntactic dependency tree semantic dependency tree

Adversarial Training for Supervised relation extraction

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Tsinghua Science and Technology 2022年第3期27卷 610-618页

作者： Yanhua Yu Kanghao He Jie Li School of Computer Science(National Pilot Software Engineering School) Beijing University of Posts and TelecommunicationsBeijing 100876China

Most supervised methods for relation extraction(RE) involve time-consuming human annotation. Distant supervision for RE is an efficient method to obtain large corpora that contains thousands of instances and various relations. However, the existing approaches rely heavily on knowledge bases(e.g., Freebase), thereby introducing data noise. Various relations and noisy labeling instances make the issue difficult to solve. In this study, we propose a model based on a piecewise convolution neural network with adversarial training. Inspired by generative adversarial networks, we adopt a heuristic algorithm to identify noisy datasets and apply adversarial training to RE. Experiments on the extended dataset of SemEval-2010 Task 8 show that our model can obtain more accurate training data for RE and significantly outperforms several competitive baseline models. Our model has an F1 score of 89.61%.

关键词： relation extraction piecewise convolution neural network adversarial training generative adversarial network

Lexicalized Dependency Paths Based Supervised Learning for relation extraction

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Computer Systems Science & Engineering 2022年第12期43卷 861-870页

作者： Huiyu Sun Ralph Grishman New York University New York10012USA

Log-linear models and more recently neural network models used forsupervised relation extraction requires substantial amounts of training data andtime, limiting the portability to new relations and domains. To this end, we propose a training representation based on the dependency paths between entities in adependency tree which we call lexicalized dependency paths (LDPs). We showthat this representation is fast, efficient and transparent. We further propose representations utilizing entity types and its subtypes to refine our model and alleviatethe data sparsity problem. We apply lexicalized dependency paths to supervisedlearning using the ACE corpus and show that it can achieve similar performancelevel to other state-of-the-art methods and even surpass them on severalcategories.

关键词： relation extraction dependency paths lexicalized dependency paths supervised learning rule-based models