Home / Advanced Search

  • Title/Keywords

  • Author/Affliations

  • Journal

  • Article Type

  • Start Year

  • End Year

Update SearchingClear
  • Articles
  • Online
Search Results (22)
  • Open Access

    ARTICLE

    Qualia Role-Based Quantity Relation Extraction for Solving Algebra Story Problems

    Bin He, Hao Meng, Zhejin Zhang, Rui Liu, Ting Zhang*

    CMES-Computer Modeling in Engineering & Sciences, Vol.136, No.1, pp. 403-419, 2023, DOI:10.32604/cmes.2023.023242 - 05 January 2023

    Abstract A qualia role-based entity-dependency graph (EDG) is proposed to represent and extract quantity relations for solving algebra story problems stated in Chinese. Traditional neural solvers use end-to-end models to translate problem texts into math expressions, which lack quantity relation acquisition in sophisticated scenarios. To address the problem, the proposed method leverages EDG to represent quantity relations hidden in qualia roles of math objects. Algorithms were designed for EDG generation and quantity relation extraction for solving algebra story problems. Experimental result shows that the proposed method achieved an average accuracy of 82.2% on quantity relation extraction More >

  • Open Access

    ARTICLE

    A Two-Phase Paradigm for Joint Entity-Relation Extraction

    Bin Ji1, Hao Xu1, Jie Yu1, Shasha Li1, Jun Ma1, Yuke Ji2,*, Huijun Liu1

    CMC-Computers, Materials & Continua, Vol.74, No.1, pp. 1303-1318, 2023, DOI:10.32604/cmc.2023.032168 - 22 September 2022

    Abstract An exhaustive study has been conducted to investigate span-based models for the joint entity and relation extraction task. However, these models sample a large number of negative entities and negative relations during the model training, which are essential but result in grossly imbalanced data distributions and in turn cause suboptimal model performance. In order to address the above issues, we propose a two-phase paradigm for the span-based joint entity and relation extraction, which involves classifying the entities and relations in the first phase, and predicting the types of these entities and relations in the second… More >

  • Open Access

    ARTICLE

    Employing Lexicalized Dependency Paths for Active Learning of Relation Extraction

    Huiyu Sun*, Ralph Grishman

    Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1415-1423, 2022, DOI:10.32604/iasc.2022.030794 - 25 May 2022

    Abstract Active learning methods which present selected examples from the corpus for annotation provide more efficient learning of supervised relation extraction models, but they leave the developer in the unenviable role of a passive informant. To restore the developer’s proper role as a partner with the system, we must give the developer an ability to inspect the extraction model during development. We propose to make this possible through a representation based on lexicalized dependency paths (LDPs) coupled with an active learner for LDPs. We apply LDPs to both simulated and real active learning with ACE as evaluation More >

  • Open Access

    ARTICLE

    Attention Weight is Indispensable in Joint Entity and Relation Extraction

    Jianquan Ouyang1,*, Jing Zhang1, Tianming Liu2

    Intelligent Automation & Soft Computing, Vol.34, No.3, pp. 1707-1723, 2022, DOI:10.32604/iasc.2022.028352 - 25 May 2022

    Abstract Joint entity and relation extraction (JERE) is an important foundation for unstructured knowledge extraction in natural language processing (NLP). Thus, designing efficient algorithms for it has become a vital task. Although existing methods can efficiently extract entities and relations, their performance should be improved. In this paper, we propose a novel model called Attention and Span-based Entity and Relation Transformer (ASpERT) for JERE. First, differing from the traditional approach that only considers the last hidden layer as the feature embedding, ASpERT concatenates the attention head information of each layer with the information of the last… More >

  • Open Access

    ARTICLE

    Lexicalized Dependency Paths Based Supervised Learning for Relation Extraction

    Huiyu Sun*, Ralph Grishman

    Computer Systems Science and Engineering, Vol.43, No.3, pp. 861-870, 2022, DOI:10.32604/csse.2022.030759 - 09 May 2022

    Abstract Log-linear models and more recently neural network models used for supervised relation extraction requires substantial amounts of training data and time, limiting the portability to new relations and domains. To this end, we propose a training representation based on the dependency paths between entities in a dependency tree which we call lexicalized dependency paths (LDPs). We show that this representation is fast, efficient and transparent. We further propose representations utilizing entity types and its subtypes to refine our model and alleviate the data sparsity problem. We apply lexicalized dependency paths to supervised learning using the More >

  • Open Access

    ARTICLE

    A Knowledge-Enriched and Span-Based Network for Joint Entity and Relation Extraction

    Kun Ding1, Shanshan Liu1, Yuhao Zhang2, Hui Zhang1, Xiaoxiong Zhang1,*, Tongtong Wu2,3, Xiaolei Zhou1

    CMC-Computers, Materials & Continua, Vol.68, No.1, pp. 377-389, 2021, DOI:10.32604/cmc.2021.016301 - 22 March 2021

    Abstract The joint extraction of entities and their relations from certain texts plays a significant role in most natural language processes. For entity and relation extraction in a specific domain, we propose a hybrid neural framework consisting of two parts: a span-based model and a graph-based model. The span-based model can tackle overlapping problems compared with BILOU methods, whereas the graph-based model treats relation prediction as graph classification. Our main contribution is to incorporate external lexical and syntactic knowledge of a specific domain, such as domain dictionaries and dependency structures from texts, into end-to-end neural models. More >

  • Open Access

    ARTICLE

    Chinese Relation Extraction on Forestry Knowledge Graph Construction

    Qi Yue, Xiang Li, Dan Li*

    Computer Systems Science and Engineering, Vol.37, No.3, pp. 423-442, 2021, DOI:10.32604/csse.2021.014448 - 08 March 2021

    Abstract Forestry work has long been weak in data integration; its initial state will inevitably affect the forestry project development and decision-quality. Knowledge Graph (KG) can provide better abilities to organize, manage, and understand forestry knowledge. Relation Extraction (RE) is a crucial task of KG construction and information retrieval. Previous researches on relation extraction have proved the performance of using the attention mechanism. However, these methods focused on the representation of the entire sentence and ignored the loss of information. The lack of analysis of words and syntactic features contributes to sentences, especially in Chinese relation… More >

  • Open Access

    ARTICLE

    Joint Self-Attention Based Neural Networks for Semantic Relation Extraction

    Jun Sun1, Yan Li1, Yatian Shen1,*, Wenke Ding1, Xianjin Shi1, Lei Zhang1, Xiajiong Shen1, Jing He2

    Journal of Information Hiding and Privacy Protection, Vol.1, No.2, pp. 69-75, 2019, DOI:10.32604/jihpp.2019.06357

    Abstract Relation extraction is an important task in NLP community. However, some models often fail in capturing Long-distance dependence on semantics, and the interaction between semantics of two entities is ignored. In this paper, we propose a novel neural network model for semantic relation classification called joint self-attention bi-LSTM (SA-Bi-LSTM) to model the internal structure of the sentence to obtain the importance of each word of the sentence without relying on additional information, and capture Long-distance dependence on semantics. We conduct experiments using the SemEval-2010 Task 8 dataset. Extensive experiments and the results demonstrated that the More >

  • Open Access

    ARTICLE

    Relation Extraction for Massive News Texts

    Libo Yin1, Xiang Meng2, Jianxun Li3, Jianguo Sun2,*

    CMC-Computers, Materials & Continua, Vol.60, No.1, pp. 275-285, 2019, DOI:10.32604/cmc.2019.05556

    Abstract With the development of information technology including Internet technologies, the amount of textual information that people need to process daily is increasing. In order to automatically obtain valuable and user-informed information from massive amounts of textual data, many researchers have conducted in-depth research in the area of entity relation extraction. Based on the existing research of word vector and the method of entity relation extraction, this paper designs and implements an method based on support vector machine (SVM) for extracting English entity relationships from massive news texts. The method converts sentences in natural language into More >

  • Open Access

    ARTICLE

    Distant Supervised Relation Extraction with Cost-Sensitive Loss

    Daojian Zeng1,2, Yao Xiao1,2, Jin Wang2,*, Yuan Dai1,2, Arun Kumar Sangaiah3

    CMC-Computers, Materials & Continua, Vol.60, No.3, pp. 1251-1261, 2019, DOI:10.32604/cmc.2019.06100

    Abstract Recently, many researchers have concentrated on distant supervision relation extraction (DSRE). DSRE has solved the problem of the lack of data for supervised learning, however, the data automatically labeled by DSRE has a serious problem, which is class imbalance. The data from the majority class obviously dominates the dataset, in this case, most neural network classifiers will have a strong bias towards the majority class, so they cannot correctly classify the minority class. Studies have shown that the degree of separability between classes greatly determines the performance of imbalanced data. Therefore, in this paper we More >

Displaying 11-20 on page 2 of 22. Per Page