Relation Extraction with Proactive Domain Adaptation Strategy

被引:0
作者
Zhong, Lingfeng [1 ,2 ]
Zhu, Yi [1 ,2 ,3 ]
机构
[1] Heifei Univ Technol, Key Lab Knowledge Engn Big Data, Minist Educ, Hefei, Peoples R China
[2] Heifei Univ Technol, Sch Comp Sci & Informat Engn, Hefei, Peoples R China
[3] Yangzhou Univ, Sch Comp Sci & Technol, Yangzhou, Jiangsu, Peoples R China
来源
11TH IEEE INTERNATIONAL CONFERENCE ON KNOWLEDGE GRAPH (ICKG 2020) | 2020年
关键词
Knowledge Graph; Relation Extraction; Domain Adaptation;
D O I
10.1109/ICBK50248.2020.00069
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Relation extraction is an important information extraction task in many Natural Language Processing (NLP) applications, such as automatic knowledge graph construction, question answering, sentiment analysis, etc. However, relation extraction suffers from inappropriate associations between entities when the background knowledge of corpus is insufficiency. Despite the preprocessed external word vector bases can ease this problem, how to find a single word vector base as domain knowledge that contains all the required knowledge features is a huge challenge, and relation extraction with background knowledge is still open to further optimization. To address this problem, in this paper, we propose Relation Extraction method with Proactive Domain Adaptation Strategy (REPDAS for short) to introduce more knowledge features from different knowledge bases. More specifically, firstly, a convolutional network with a parameter-sharing layer is introduced for relation extraction, and word seeds that are important to relational feature exploitation are proactively picked by an attention mechanism during training. Secondly, the proactively-chosen word seeds and the previous parameter-sharing layer are utilized to establish a map between different domains. Our proposed method selectively avails both background knowledge and contextual features for relation extraction by incorporating the convolutional neural network with the proactively domain adaptation strategy. Experiments show that our method effectively enhances the performance of relation extraction compared with other baselines.
引用
收藏
页码:441 / 448
页数:8
相关论文
共 40 条
  • [1] Agichtein E., 2000, ACM 2000. Digital Libraries. Proceedings of the Fifth ACM Conference on Digital Libraries, P85, DOI 10.1145/336597.336644
  • [2] DBpedia: A nucleus for a web of open data
    Auer, Soeren
    Bizer, Christian
    Kobilarov, Georgi
    Lehmann, Jens
    Cyganiak, Richard
    Ives, Zachary
    [J]. SEMANTIC WEB, PROCEEDINGS, 2007, 4825 : 722 - +
  • [3] Bollacker K., 2007, AAAI, V7, P1962
  • [4] ChunYang Liu, 2013, Advanced Data Mining and Applications. 9th International Conference, ADMA 2013. Proceedings: LNCS 8347, P231, DOI 10.1007/978-3-642-53917-6_21
  • [5] Culotta Aron, 2004, P 42 ANN M ASS COMP, P423, DOI DOI 10.3115/1218955.1219009
  • [6] DI S, 2019, P 25 ACM SIGKDD INT, P1348
  • [7] Open Information Extraction from the Web
    Etzioni, Oren
    Banko, Michele
    Soderland, Stephen
    Weld, Daniel S.
    [J]. COMMUNICATIONS OF THE ACM, 2008, 51 (12) : 68 - 74
  • [8] Faruqui M, 2015, PROCEEDINGS OF THE 53RD ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS AND THE 7TH INTERNATIONAL JOINT CONFERENCE ON NATURAL LANGUAGE PROCESSING, VOL 1, P1491
  • [9] Fu L., 2017, P 8 INT JOINT C NAT, V2, P425
  • [10] DISTRIBUTIONAL STRUCTURE
    Harris, Zellig S.
    [J]. WORD-JOURNAL OF THE INTERNATIONAL LINGUISTIC ASSOCIATION, 1954, 10 (2-3): : 146 - 162