Weighted high-order hidden Markov models for compound emotions recognition in text

被引:25
作者
Quan, Changqin [1 ]
Ren, Fuji [2 ]
机构
[1] Kobe Univ, Grad Sch Syst Informat, Kobe, Hyogo 6578501, Japan
[2] Univ Tokushima, Fac Engn, Tokushima 7708506, Japan
基金
中国国家自然科学基金;
关键词
Affective computing; Compound emotions; Sentence emotion recognition; Hidden Markov models; Weighted n-order; SENTIMENT ANALYSIS; CLASSIFICATION; FEATURES; SPEECH; NEWS;
D O I
10.1016/j.ins.2015.09.050
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Emotion recognition in text has attracted a great deal of attention recently due to many practical applications and challenging research problems. In this paper, we explore an efficient identification of compound emotions in sentences using hidden Markov models (HMMs). In this problem, emotion has temporal structure and can be encoded as a sequence of spectral vectors spanning an article range. The major contributions of the research include the (i) proposal of weighted high-order HMMs to determine the most likely sequence of sentence emotions in an article. The weighted high-order HMMs take into account the impact degree of context emotions with different lengths of history; (ii) introduction of a representation of compound emotions by a sequence of binary digits, namely emotion code; (iii) development of an architecture that uses the emotions of simple sentences as part of known states in the weighted high-order hidden Markov emotion models for further recognizing more unknown sentence emotions. The experimental results show that the proposed weighted high-order HMMs is quite powerful in identifying sentence emotions compared with several state-of-the-art machine learning algorithms and the standard n-order hidden Markov emotion models. And the use of emotion of simple sentences as part of known states is able to improve the performance of the weighted n-order hidden Markov emotion models significantly. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:581 / 596
页数:16
相关论文
共 53 条
  • [1] INSTANCE-BASED LEARNING ALGORITHMS
    AHA, DW
    KIBLER, D
    ALBERT, MK
    [J]. MACHINE LEARNING, 1991, 6 (01) : 37 - 66
  • [2] SLAM: Cross-species gene finding and alignment with a generalized pair hidden Markov model
    Alexandersson, M
    Cawley, S
    Pachter, L
    [J]. GENOME RESEARCH, 2003, 13 (03) : 496 - 502
  • [3] [Anonymous], P STY1E2005 1 WORKSH
  • [4] [Anonymous], 1998, WordNet, DOI DOI 10.7551/MITPRESS/7287.001.0001
  • [5] Improving opinion retrieval in social media by combining features-based coreferencing and memory-based learning
    Atkinson, John
    Salas, Gonzalo
    Figueroa, Alejandro
    [J]. INFORMATION SCIENCES, 2015, 299 : 20 - 31
  • [6] Baccianella S, 2010, LREC 2010 - SEVENTH INTERNATIONAL CONFERENCE ON LANGUAGE RESOURCES AND EVALUATION
  • [7] StarTrack: The Next Generation (of Product Review Management Tools)
    Baccianella, Stefano
    Esuli, Andrea
    Sebastiani, Fabrizio
    [J]. NEW GENERATION COMPUTING, 2013, 31 (01) : 47 - 70
  • [8] Z*-numbers: Augmented Z-numbers for machine-subjectivity representation
    Banerjee, Romi
    Pal, Sankar K.
    [J]. INFORMATION SCIENCES, 2015, 323 : 143 - 178
  • [9] Endorsements and rebuttals in blog distillation
    Berardi, Giacomo
    Esuli, Andrea
    Sebastiani, Fabrizio
    Silvestri, Fabrizio
    [J]. INFORMATION SCIENCES, 2013, 249 : 38 - 47
  • [10] Berger AL, 1996, COMPUT LINGUIST, V22, P39