Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event

LSTM has been presented to overcome the problem of the gradient vanishing and explosion. Tree-LSTM could improve the parallel speed of LSTM, and incorporate relevant information from dependency or syntax trees. Tree-LSTM can update gate and memory vectors from the multiple sub-units. Learning edge f...

Full description

Saved in:
Bibliographic Details
Main Authors: Lei Wang, Han Cao, Liu Yuan
Format: Article
Language:English
Published: Elsevier 2024-12-01
Series:Systems and Soft Computing
Subjects:
Online Access:http://www.sciencedirect.com/science/article/pii/S2772941924000048
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1850249476399169536
author Lei Wang
Han Cao
Liu Yuan
author_facet Lei Wang
Han Cao
Liu Yuan
author_sort Lei Wang
collection DOAJ
description LSTM has been presented to overcome the problem of the gradient vanishing and explosion. Tree-LSTM could improve the parallel speed of LSTM, and incorporate relevant information from dependency or syntax trees. Tree-LSTM can update gate and memory vectors from the multiple sub-units. Learning edge features can strengthen the expression ability of graph neural networks. However, the original Child-Sum Tree-LSTMs ignores edge features during aggregating the sub-nodes hidden states. To enhance node representation, we propose an interaction mechanism that can alternately updating nodes and edges vectors, thus the model can learn the richer nodes vectors. The interaction mechanism attaches the node embedding to its connected link at the first stage. Next, it superimposes the updated edge into the parent node once more. Repeat the above steps from bottom to top. We present five strategies during the alternant renewal process. Meanwhile, we adopt one constituent parser and one dependency parser to produce the diversified formats, and compare their performances in the experiment result. The proposed model achieves better performance than baseline methods on the BioNLP’09 and MLEE corpuses. The experimental results show that the simple event results are almost identical for each parser. But for complex events, Stanford Parser is better than MaltParser because of more frequent interactive behaviors. The different parsing formats have different results, and CoNLL’2008 Dependencies show competitive and superior performance for each parser.
format Article
id doaj-art-75f9d4651f494bdcb70190cabfc37b93
institution OA Journals
issn 2772-9419
language English
publishDate 2024-12-01
publisher Elsevier
record_format Article
series Systems and Soft Computing
spelling doaj-art-75f9d4651f494bdcb70190cabfc37b932025-08-20T01:58:30ZengElsevierSystems and Soft Computing2772-94192024-12-01620007510.1016/j.sasc.2024.200075Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical eventLei Wang0Han Cao1Liu Yuan2School of Computer Science, Shaanxi Normal University, Xi'an, China; School of Information and Intelligent Technology, Shaanxi Business College, Xi'an, ChinaSchool of Computer Science, Shaanxi Normal University, Xi'an, China; Corresponding author.School of Computer Science, Shaanxi Normal University, Xi'an, ChinaLSTM has been presented to overcome the problem of the gradient vanishing and explosion. Tree-LSTM could improve the parallel speed of LSTM, and incorporate relevant information from dependency or syntax trees. Tree-LSTM can update gate and memory vectors from the multiple sub-units. Learning edge features can strengthen the expression ability of graph neural networks. However, the original Child-Sum Tree-LSTMs ignores edge features during aggregating the sub-nodes hidden states. To enhance node representation, we propose an interaction mechanism that can alternately updating nodes and edges vectors, thus the model can learn the richer nodes vectors. The interaction mechanism attaches the node embedding to its connected link at the first stage. Next, it superimposes the updated edge into the parent node once more. Repeat the above steps from bottom to top. We present five strategies during the alternant renewal process. Meanwhile, we adopt one constituent parser and one dependency parser to produce the diversified formats, and compare their performances in the experiment result. The proposed model achieves better performance than baseline methods on the BioNLP’09 and MLEE corpuses. The experimental results show that the simple event results are almost identical for each parser. But for complex events, Stanford Parser is better than MaltParser because of more frequent interactive behaviors. The different parsing formats have different results, and CoNLL’2008 Dependencies show competitive and superior performance for each parser.http://www.sciencedirect.com/science/article/pii/S2772941924000048Tree-LSTMEdgeDependencyInteraction
spellingShingle Lei Wang
Han Cao
Liu Yuan
Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
Systems and Soft Computing
Tree-LSTM
Edge
Dependency
Interaction
title Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
title_full Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
title_fullStr Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
title_full_unstemmed Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
title_short Child-Sum (N2E2N)Tree-LSTMs: An interactive Child-Sum Tree-LSTMs to extract biomedical event
title_sort child sum n2e2n tree lstms an interactive child sum tree lstms to extract biomedical event
topic Tree-LSTM
Edge
Dependency
Interaction
url http://www.sciencedirect.com/science/article/pii/S2772941924000048
work_keys_str_mv AT leiwang childsumn2e2ntreelstmsaninteractivechildsumtreelstmstoextractbiomedicalevent
AT hancao childsumn2e2ntreelstmsaninteractivechildsumtreelstmstoextractbiomedicalevent
AT liuyuan childsumn2e2ntreelstmsaninteractivechildsumtreelstmstoextractbiomedicalevent