A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction

Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient consideration of the node level and type information in G...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:ACM transactions on information systems 2023-01, Vol.41 (1), p.1-27, Article 20
Hauptverfasser: Wan, Qizhi, Wan, Changxuan, Xiao, Keli, Hu, Rong, Liu, Dexi
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 27
container_issue 1
container_start_page 1
container_title ACM transactions on information systems
container_volume 41
creator Wan, Qizhi
Wan, Changxuan
Xiao, Keli
Hu, Rong
Liu, Dexi
description Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient consideration of the node level and type information in Graph Attention Network (GAT), and (3) insufficient joint exploitation of the node dependency type and part-of-speech (POS) encoding on the graph structure. To address these issues, we propose a novel framework for open event extraction in documents. Specifically, to obtain an enhanced dependency structure with powerful encoding ability, our model is capable of handling an enriched parallel structure with connected ellipsis nodes. Moreover, through a bidirectional dependency parsing graph, it considers the sequence of order structure and associates the ancestor and descendant nodes. Subsequently, we further exploit node information, such as the node level and type, to strengthen the aggregation of node features in our GAT. Finally, based on the coordination of triple-channel features (i.e., semantic, syntactic dependency and POS), the performance of event extraction is significantly improved. Extensive experiments are conducted to validate the effectiveness of our method, and the results confirm its superiority over the state-of-the-art baselines. Furthermore, in-depth analyses are provided to explore the essential factors determining the extraction performance.
doi_str_mv 10.1145/3528668
format Article
fullrecord <record><control><sourceid>acm_cross</sourceid><recordid>TN_cdi_crossref_primary_10_1145_3528668</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>3528668</sourcerecordid><originalsourceid>FETCH-LOGICAL-a244t-a30b148b878533dcf79132302366ae947b5fb06f49d0a569b44414710f0863cc3</originalsourceid><addsrcrecordid>eNo9kD1PwzAYhC0EEqUgdiZvTIbX8UecsapCi1TaBebojWsrgTSJHPP175uqhenudI9uOEJuOTxwLtWjUInR2pyRCVfKsDGY89GD1MxwYy7J1TC8A4xZw4SsZ_Tls4k1sxW2rWvosnYBg61qiw1dBOwrOovRtbHuWrp28bsLH9R3gW5619L8a2xo_hMD2gNxTS48NoO7OemUvD3lr_MlW20Wz_PZimEiZWQooOTSlCY1Soit9WnGRSIgEVqjy2RaKl-C9jLbAiqdlVJKLlMOHowW1oopuT_u2tANQ3C-6EO9w_BbcCgONxSnG0by7kii3f1Df-UepI9WDQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction</title><source>ACM Digital Library Complete</source><creator>Wan, Qizhi ; Wan, Changxuan ; Xiao, Keli ; Hu, Rong ; Liu, Dexi</creator><creatorcontrib>Wan, Qizhi ; Wan, Changxuan ; Xiao, Keli ; Hu, Rong ; Liu, Dexi</creatorcontrib><description>Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient consideration of the node level and type information in Graph Attention Network (GAT), and (3) insufficient joint exploitation of the node dependency type and part-of-speech (POS) encoding on the graph structure. To address these issues, we propose a novel framework for open event extraction in documents. Specifically, to obtain an enhanced dependency structure with powerful encoding ability, our model is capable of handling an enriched parallel structure with connected ellipsis nodes. Moreover, through a bidirectional dependency parsing graph, it considers the sequence of order structure and associates the ancestor and descendant nodes. Subsequently, we further exploit node information, such as the node level and type, to strengthen the aggregation of node features in our GAT. Finally, based on the coordination of triple-channel features (i.e., semantic, syntactic dependency and POS), the performance of event extraction is significantly improved. Extensive experiments are conducted to validate the effectiveness of our method, and the results confirm its superiority over the state-of-the-art baselines. Furthermore, in-depth analyses are provided to explore the essential factors determining the extraction performance.</description><identifier>ISSN: 1046-8188</identifier><identifier>EISSN: 1558-2868</identifier><identifier>DOI: 10.1145/3528668</identifier><language>eng</language><publisher>New York, NY: ACM</publisher><subject>Computing methodologies ; Data mining ; Information extraction ; Information systems ; Neural networks</subject><ispartof>ACM transactions on information systems, 2023-01, Vol.41 (1), p.1-27, Article 20</ispartof><rights>Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-a244t-a30b148b878533dcf79132302366ae947b5fb06f49d0a569b44414710f0863cc3</citedby><cites>FETCH-LOGICAL-a244t-a30b148b878533dcf79132302366ae947b5fb06f49d0a569b44414710f0863cc3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktopdf>$$Uhttps://dl.acm.org/doi/pdf/10.1145/3528668$$EPDF$$P50$$Gacm$$H</linktopdf><link.rule.ids>314,776,780,2276,27901,27902,40172,75971</link.rule.ids></links><search><creatorcontrib>Wan, Qizhi</creatorcontrib><creatorcontrib>Wan, Changxuan</creatorcontrib><creatorcontrib>Xiao, Keli</creatorcontrib><creatorcontrib>Hu, Rong</creatorcontrib><creatorcontrib>Liu, Dexi</creatorcontrib><title>A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction</title><title>ACM transactions on information systems</title><addtitle>ACM TOIS</addtitle><description>Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient consideration of the node level and type information in Graph Attention Network (GAT), and (3) insufficient joint exploitation of the node dependency type and part-of-speech (POS) encoding on the graph structure. To address these issues, we propose a novel framework for open event extraction in documents. Specifically, to obtain an enhanced dependency structure with powerful encoding ability, our model is capable of handling an enriched parallel structure with connected ellipsis nodes. Moreover, through a bidirectional dependency parsing graph, it considers the sequence of order structure and associates the ancestor and descendant nodes. Subsequently, we further exploit node information, such as the node level and type, to strengthen the aggregation of node features in our GAT. Finally, based on the coordination of triple-channel features (i.e., semantic, syntactic dependency and POS), the performance of event extraction is significantly improved. Extensive experiments are conducted to validate the effectiveness of our method, and the results confirm its superiority over the state-of-the-art baselines. Furthermore, in-depth analyses are provided to explore the essential factors determining the extraction performance.</description><subject>Computing methodologies</subject><subject>Data mining</subject><subject>Information extraction</subject><subject>Information systems</subject><subject>Neural networks</subject><issn>1046-8188</issn><issn>1558-2868</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNo9kD1PwzAYhC0EEqUgdiZvTIbX8UecsapCi1TaBebojWsrgTSJHPP175uqhenudI9uOEJuOTxwLtWjUInR2pyRCVfKsDGY89GD1MxwYy7J1TC8A4xZw4SsZ_Tls4k1sxW2rWvosnYBg61qiw1dBOwrOovRtbHuWrp28bsLH9R3gW5619L8a2xo_hMD2gNxTS48NoO7OemUvD3lr_MlW20Wz_PZimEiZWQooOTSlCY1Soit9WnGRSIgEVqjy2RaKl-C9jLbAiqdlVJKLlMOHowW1oopuT_u2tANQ3C-6EO9w_BbcCgONxSnG0by7kii3f1Df-UepI9WDQ</recordid><startdate>20230110</startdate><enddate>20230110</enddate><creator>Wan, Qizhi</creator><creator>Wan, Changxuan</creator><creator>Xiao, Keli</creator><creator>Hu, Rong</creator><creator>Liu, Dexi</creator><general>ACM</general><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20230110</creationdate><title>A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction</title><author>Wan, Qizhi ; Wan, Changxuan ; Xiao, Keli ; Hu, Rong ; Liu, Dexi</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a244t-a30b148b878533dcf79132302366ae947b5fb06f49d0a569b44414710f0863cc3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Computing methodologies</topic><topic>Data mining</topic><topic>Information extraction</topic><topic>Information systems</topic><topic>Neural networks</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wan, Qizhi</creatorcontrib><creatorcontrib>Wan, Changxuan</creatorcontrib><creatorcontrib>Xiao, Keli</creatorcontrib><creatorcontrib>Hu, Rong</creatorcontrib><creatorcontrib>Liu, Dexi</creatorcontrib><collection>CrossRef</collection><jtitle>ACM transactions on information systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Wan, Qizhi</au><au>Wan, Changxuan</au><au>Xiao, Keli</au><au>Hu, Rong</au><au>Liu, Dexi</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction</atitle><jtitle>ACM transactions on information systems</jtitle><stitle>ACM TOIS</stitle><date>2023-01-10</date><risdate>2023</risdate><volume>41</volume><issue>1</issue><spage>1</spage><epage>27</epage><pages>1-27</pages><artnum>20</artnum><issn>1046-8188</issn><eissn>1558-2868</eissn><abstract>Event extraction is an essential task in natural language processing. Although extensively studied, existing work shares issues in three aspects, including (1) the limitations of using original syntactic dependency structure, (2) insufficient consideration of the node level and type information in Graph Attention Network (GAT), and (3) insufficient joint exploitation of the node dependency type and part-of-speech (POS) encoding on the graph structure. To address these issues, we propose a novel framework for open event extraction in documents. Specifically, to obtain an enhanced dependency structure with powerful encoding ability, our model is capable of handling an enriched parallel structure with connected ellipsis nodes. Moreover, through a bidirectional dependency parsing graph, it considers the sequence of order structure and associates the ancestor and descendant nodes. Subsequently, we further exploit node information, such as the node level and type, to strengthen the aggregation of node features in our GAT. Finally, based on the coordination of triple-channel features (i.e., semantic, syntactic dependency and POS), the performance of event extraction is significantly improved. Extensive experiments are conducted to validate the effectiveness of our method, and the results confirm its superiority over the state-of-the-art baselines. Furthermore, in-depth analyses are provided to explore the essential factors determining the extraction performance.</abstract><cop>New York, NY</cop><pub>ACM</pub><doi>10.1145/3528668</doi><tpages>27</tpages></addata></record>
fulltext fulltext
identifier ISSN: 1046-8188
ispartof ACM transactions on information systems, 2023-01, Vol.41 (1), p.1-27, Article 20
issn 1046-8188
1558-2868
language eng
recordid cdi_crossref_primary_10_1145_3528668
source ACM Digital Library Complete
subjects Computing methodologies
Data mining
Information extraction
Information systems
Neural networks
title A Multi-channel Hierarchical Graph Attention Network for Open Event Extraction
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-03T00%3A40%3A03IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-acm_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=A%20Multi-channel%20Hierarchical%20Graph%20Attention%20Network%20for%20Open%20Event%20Extraction&rft.jtitle=ACM%20transactions%20on%20information%20systems&rft.au=Wan,%20Qizhi&rft.date=2023-01-10&rft.volume=41&rft.issue=1&rft.spage=1&rft.epage=27&rft.pages=1-27&rft.artnum=20&rft.issn=1046-8188&rft.eissn=1558-2868&rft_id=info:doi/10.1145/3528668&rft_dat=%3Cacm_cross%3E3528668%3C/acm_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true