Gated recurrent neural network with sentimental relations for sentiment classification

被引:46
作者
Chen, Chaotao [1 ]
Zhuo, Run [1 ]
Ren, Jiangtao [1 ]
机构
[1] Sun Yat Sen Univ, Guangdong Prov Key Lab Computat Sci, Sch Data & Comp Sci, Guangzhou 510006, Guangdong, Peoples R China
基金
中国国家自然科学基金;
关键词
Sentiment classification; Recurrent neural network; Sentimental relations; FEATURES; POLARITY;
D O I
10.1016/j.ins.2019.06.050
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Gated recurrent neural networks (GRNNs) have been very successful in sentiment classification due to their ability to preserve semantics over time. However, modeling sentimental relations such as negation and intensification under a recurrent architecture remains a challenge. In this work, we introduce a gated recurrent neural network with sentimental relations (GRNN-SR)(1) to capture the sentimental relations' information from sentiment modifier context and model their effects in texts. At each time step, GRNN-SR separately encodes the information of sentiment polarity and sentiment modifier context. The new sentiment inputs are modified multiplicatively by the previous encoded sentiment modifier context before they are updated into current states of sentiment polarity, which is more effective than the approach of traditional GRNNs. The experimental results show that our model not only can capture sentimental relations but also is an improvement over state-of-the-art gated recurrent neural network baselines. (C) 2019 Elsevier Inc. All rights reserved.
引用
收藏
页码:268 / 278
页数:11
相关论文
共 49 条
[1]  
Abadi M, 2016, PROCEEDINGS OF OSDI'16: 12TH USENIX SYMPOSIUM ON OPERATING SYSTEMS DESIGN AND IMPLEMENTATION, P265
[2]  
[Anonymous], 2010, Proceedings of the 23rd International Conference on Computational Linguistics
[3]  
[Anonymous], CORR
[4]  
[Anonymous], 2016, P 2016 C INT JOINT C
[5]  
[Anonymous], 2015, Nature, DOI [10.1038/nature14539, DOI 10.1038/NATURE14539]
[6]  
[Anonymous], 2015, P ICLR
[7]  
[Anonymous], C EMP METH NAT LANG
[8]  
[Anonymous], P ACL
[9]  
[Anonymous], 2015, Optimization
[10]   LEARNING LONG-TERM DEPENDENCIES WITH GRADIENT DESCENT IS DIFFICULT [J].
BENGIO, Y ;
SIMARD, P ;
FRASCONI, P .
IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (02) :157-166