Dynamic hypergraph convolutional network for multimodal sentiment analysis

超图 计算机科学 成对比较 图形 理论计算机科学 模态(人机交互) 人工智能 仿射变换 数学 离散数学 纯数学
作者
Jian Huang,Yuanyuan Pu,Dongming Zhou,Jinde Cao,Jinjing Gu,Zhengpeng Zhao,Dan Xu
出处
期刊:Neurocomputing [Elsevier BV]
卷期号:565: 126992-126992 被引量:40
标识
DOI:10.1016/j.neucom.2023.126992
摘要

Multimodal sentiment analysis (MSA) aims to detect the sentiments from language (text), audio, and visual (facial expressions) modalities. The main challenge in MSA is how to efficiently model intra-modality and inter-modality dynamics. With the advent of graph convolution network (GCN), graph-based models are proposed to solve the challenge. However, general graphs contain only two nodes per edge, which limits the exploitation of high-order interactions. Moreover, current graph-based models mainly aggregate the features of each node during fusion, while the features of connected edges are not well mined. In this paper, we introduce dynamic hypergraph convolution networks to MSA for the first time and propose a Multimodal Dynamic Hypergraph Network (MDH) to learn intra- and inter-modality dynamics. Hypergraphs provide a natural approach to capture transcendental pairwise relations, and their potential for MSA remains unexplored. MDH mainly consists of three components: Unimodal Encoder, Dynamic Hypergraph Enhancement Network (DHEN), and HyperFusion module. Specifically, DHEN is composed of Cross-modal Affine, Hypergraph Construction, and Hypergraph Aggregation modules. As for the intra-modality dynamics, MDH utilizes Hypergraph Construction and Aggregation modules to model the interactions within time steps for each modality. As for the inter-modality dynamics, MDH implements Cross-modal Affine and HyperFusion modules to learn the relationships of the modalities. In addition, multi-task learning has been implemented to optimize the learning process for multimodal tasks. Experiments show that MDH outperforms graph-based models on CMU-MOSI and CMU-MOSEI datasets, as well as obtains new state-of-the-art results on CH-SIMS dataset. Furthermore, we conduct external experiments to explore the effectiveness of MDH and the effect of model depth with different graph networks.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
jianmei完成签到,获得积分10
1秒前
1秒前
xiaobaiyang发布了新的文献求助20
1秒前
2秒前
自由月光应助甜叶菊采纳,获得10
4秒前
洁净初柳完成签到,获得积分10
4秒前
4秒前
谢昊宸发布了新的文献求助10
4秒前
彭于晏应助xuan采纳,获得10
4秒前
6秒前
6秒前
在水一方应助王淳采纳,获得10
6秒前
李健应助ccc6195采纳,获得20
7秒前
7秒前
自然函完成签到 ,获得积分10
7秒前
7秒前
hottie完成签到,获得积分10
7秒前
小宇完成签到,获得积分10
8秒前
v0id应助luo采纳,获得10
8秒前
耍酷橘子完成签到,获得积分20
8秒前
英俊的铭应助125mmD91T采纳,获得10
9秒前
9秒前
好吗好的完成签到,获得积分10
10秒前
什么东西这么好看完成签到,获得积分10
10秒前
11秒前
情怀应助静子采纳,获得10
11秒前
two_dog发布了新的文献求助10
11秒前
曾小荣发布了新的文献求助30
12秒前
文静元霜发布了新的文献求助10
12秒前
852应助少吃甜多健身采纳,获得10
13秒前
13秒前
hvacr123完成签到,获得积分10
13秒前
13秒前
14秒前
是你还是我11完成签到,获得积分10
14秒前
zhouyang发布了新的文献求助10
14秒前
bxj123完成签到,获得积分10
14秒前
小蘑菇应助孙友浩采纳,获得10
14秒前
erkk发布了新的文献求助10
15秒前
高分求助中
Markov Chain Monte Carlo 10000
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Common Foundations of American and East Asian Modernisation: From Alexander Hamilton to Junichero Koizumi 5000
How to Use Machine Learning in Chemistry: An Introduction 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
Discerning Saints: Moralization of Intrinsic Motivation and Selective Prosociality at Work 500
Handbuch Trainingswissenschaft – Trainingslehre 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7583093
求助须知:如何正确求助?哪些是违规求助? 9161776
关于积分的说明 19604859
捐赠科研通 7165133
什么是DOI,文献DOI怎么找? 3266207
关于科研通互助平台的介绍 2431164
邀请新用户注册赠送积分活动 2257518