Quantum Probability-inspired Graph Attention Network for Modeling Complex Text Interaction
Yan, Peng1,2; Li, Linjing1,2,3; Zeng, Daniel1,2,3
发表期刊KNOWLEDGE-BASED SYSTEMS
ISSN0950-7051
2021-12-25
卷号234页码:12
通讯作者Li, Linjing(linjing.li@ia.ac.cn)
摘要Inspired by quantum-like phenomena in human language understanding, recent studies propose quan-tum probability-inspired neural networks to model natural language by treating words as superposition states and a sentence as a mixed state. However, many complex natural language processing tasks (e.g., emotion-cause pair extraction or joint dialog act recognition and sentiment classification) require modeling the complex and graphical interaction of multiple text pieces (e.g., multiple clauses in a document or multiple utterances in a dialog). The existing quantum probability-inspired neural networks only encode sequential interaction of a sequence of words, but cannot model the complex interaction of text pieces. To generalize the quantum framework from modeling word sequence to modeling complex and graphical text interaction, we propose a Quantum Probability-inspired Graph Attention NeTwork (QPGAT) by combining quantum probability and graph attention mechanism in a unified framework. Specifically, a text interaction graph is firstly constructed to describe the complex interaction of text pieces. Then QPGAT models each text node as a particle in a superposition state and each node's neighborhood in the graph as a mixed system in a mixed state to learn interaction-aware text node representations. We apply QPGAT to the two important and complex NLP tasks, emotion- cause pair extraction and joint dialog act recognition and sentiment classification. Experiment results show that QPGAT is competitive compared with the state-of-the-art methods on the two complex NLP tasks, demonstrating the effectiveness of QPGAT. Moreover, QPGAT can also provide a reasonable post-hoc explanation about the model decision process for emotion-cause pair extraction. (c) 2021 Elsevier B.V. All rights reserved.
关键词Natural language processing Quantum probability Graph attention network
DOI10.1016/j.knosys.2021.107557
收录类别SCI
语种英语
WOS研究方向Computer Science
WOS类目Computer Science, Artificial Intelligence
WOS记录号WOS:000709963300005
出版者ELSEVIER
七大方向——子方向分类自然语言处理
引用统计
被引频次:3[WOS]   [WOS记录]     [WOS相关记录]
文献类型期刊论文
条目标识符http://ir.ia.ac.cn/handle/173211/46280
专题多模态人工智能系统全国重点实验室_互联网大数据与信息安全
通讯作者Li, Linjing
作者单位1.Univ Chinese Acad Sci, Sch Artificial Intelligence, Beijing, Peoples R China
2.Chinese Acad Sci, Inst Automat, Beijing, Peoples R China
3.Shenzhen Artificial Intelligence & Data Sci Inst, Shenzhen, Peoples R China
第一作者单位中国科学院自动化研究所
通讯作者单位中国科学院自动化研究所
推荐引用方式
GB/T 7714
Yan, Peng,Li, Linjing,Zeng, Daniel. Quantum Probability-inspired Graph Attention Network for Modeling Complex Text Interaction[J]. KNOWLEDGE-BASED SYSTEMS,2021,234:12.
APA Yan, Peng,Li, Linjing,&Zeng, Daniel.(2021).Quantum Probability-inspired Graph Attention Network for Modeling Complex Text Interaction.KNOWLEDGE-BASED SYSTEMS,234,12.
MLA Yan, Peng,et al."Quantum Probability-inspired Graph Attention Network for Modeling Complex Text Interaction".KNOWLEDGE-BASED SYSTEMS 234(2021):12.
条目包含的文件
条目无相关文件。
个性服务
推荐该条目
保存到收藏夹
查看访问统计
导出为Endnote文件
谷歌学术
谷歌学术中相似的文章
[Yan, Peng]的文章
[Li, Linjing]的文章
[Zeng, Daniel]的文章
百度学术
百度学术中相似的文章
[Yan, Peng]的文章
[Li, Linjing]的文章
[Zeng, Daniel]的文章
必应学术
必应学术中相似的文章
[Yan, Peng]的文章
[Li, Linjing]的文章
[Zeng, Daniel]的文章
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。