Yanghui Rao

Yanghui Rao

Auto-generated profile, based on publicly available information

Yanghui Rao

School of Computer Science and Engineering, Sun Yat-sen University, Guangzhou, China

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 May 2020 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
MHMinghui Huang
Minghui Huang
Haoran XieHaoran Xie
Haoran Xie
YRYanghui Rao
Yanghui Rao
YLYuwei Liu
Yuwei Liu
LPLeonard Poon
Leonard Poon
Fu Lee WangFu Lee Wang
Fu Lee Wang
With the growing availability and popularity of sentiment-rich resources like blogs and online reviews, new opportunities and challenges have emerged regarding the identification, extraction, and organization of sentiments from user-generated documents or sentences. Recently, many studies have exploited lexicon-based methods or supervised learning algorithms to separately conduct sentiment analysis tasks; however, the former approaches ignore contextual information of sentences and the latter ones do not take sentiment information embedded in sentiment words into consideration. To tackle these limitations, we propose a new model named Sentiment Convolutional Neural Network (SentiCNN) to analyze the sentiments of sentences with both contextual and sentiment information of sentiment words, in which, contextual information is captured from word embeddings and sentiment information is identified using existing lexicons. We incorporate a Highway Network into our model to adaptively combine sentiment and contextual information from sentences by strengthening the connection between features of both sentences and their sentiment words. Furthermore, we propose three lexicon-based attention mechanisms (LBAMs) for our SentiCNN model to find the most important indicators of sentiments and make predictions more effectively. Experiments over two well-known datasets indicate that sentiment words, the Highway Network, and LBAMs contribute to sentiment analysis.

1 October 2017 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
XLXiangsheng Li
Xiangsheng Li
YRYanghui Rao
Yanghui Rao
Haoran XieHaoran Xie
Haoran Xie
RLRaymond Yiu Keung Lau
Raymond Yiu Keung Lau
JYJian Yin
Jian Yin
Fu Lee WangFu Lee Wang
Fu Lee Wang
Social emotion classification aims to predict the aggregation of emotional responses embedded in online comments contributed by various users. Such a task is inherently challenging because extracting relevant semantics from free texts is a classical research problem. Moreover, online comments are typically characterized by a sparse feature space, which makes the corresponding emotion classification task very difficult. On the other hand, though deep neural networks have been shown to be effective for speech recognition and image analysis tasks because of their capabilities of transforming sparse low-level features to dense high-level features, their effectiveness on emotion classification requires further investigation. The main contribution of our work reported in this paper is the development of a novel model of semantically rich hybrid neural network (HNN) which leverages unsupervised teaching models to incorporate semantic domain knowledge into the neural network to bootstrap its inference power and interpretability. To our best knowledge, this is the first successful work of incorporating semantics into neural networks to enhance social emotion classification and network interpretability. Through empirical studies based on three real-world social media datasets, our experimental results confirm that the proposed hybrid neural networks outperform other state-of-the-art emotion classification methods.

30 September 2019 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
JPJianhui Pang
Jianhui Pang
YRYanghui Rao
Yanghui Rao
Haoran XieHaoran Xie
Haoran Xie
XWXizhao Wang
Xizhao Wang
Fu Lee WangFu Lee Wang
Fu Lee Wang
QLQing Li
Qing Li
With the development of social network platforms, discussion forums, and question answering websites, a huge number of short messages that typically contain a few words for an individual document are posted by online users. In these short messages, emotions are frequently embedded for communicating opinions, expressing friendship, and promoting influence. It is quite valuable to detect emotions from short messages, but the corresponding task suffers from the sparsity of feature space. In this article, we first generate term groups co-occurring in the same context to enrich the number of features. Then, two basic supervised topic models are proposed to associate emotions with topics accurately. To reduce the time cost of parameter estimation, we further propose an accelerated algorithm for our basic models. Extensive evaluations using three short corpora validate the efficiency and effectiveness of the accelerated models for predicting the emotions of unlabeled documents, in addition to generate the topic-level emotion lexicons.

15 June 2019 in Data Science and Engineering
Verified
Journal Article
Open access
PDF file
XCXingming Chen
Xingming Chen
YRYanghui Rao
Yanghui Rao
Haoran XieHaoran Xie
Haoran Xie
Fu Lee WangFu Lee Wang
Fu Lee Wang
YZYingchao Zhao
Yingchao Zhao
JYJian Yin
Jian Yin
Traditional methods of annotating the sentiment of an unlabeled document are based on sentiment lexicons or machine learning algorithms, which have shown low computational cost or competitive performance. However, these methods ignore the semantic composition problem displaying in several ways such as negative reversing and intensification. In this paper, we propose a new method for sentiment classification using negative and intensive sentiment supplementary information, so as to exploit the linguistic feature of negative and intensive words in conjunction with the context information. Particularly, our method can solve the domain-specific problem without relying on the external sentiment lexicons. Experimental results on two real-world datasets demonstrate the effectiveness of our proposed method.

11 April 2024 in Artificial Intelligence Review
Verified
Journal Article
Open access
PDF file
YZYongxiang ZHANG
Yongxiang ZHANG
RLRaymond Yiu Keung Lau
Raymond Yiu Keung Lau
DXDavid Xu
David Xu
YRYanghui Rao
Yanghui Rao
Yuefeng LiYuefeng Li
Yuefeng Li
With the support of advanced hardware and software technology, Artificial Intelligence (AI) techniques, especially the increasing number of deep learning algorithms, have spawned the popularization of online intelligent services and accelerated the contemporary development and applications of chatbot systems. The promise of providing 24/7 uninterrupted business services and minimizing workforce costs has made business chatbots a hot topic due to the impact of the pandemic. It has attracted considerable attention from academic researchers and business practitioners. However, a thorough technical review of advanced chatbot technologies and their relevance and applications to various business domains is rare in the literature. The main contribution of this review article is the critical analysis of various chatbot development approaches and the underlying deep learning computational methods in the context of some business applications. We first conceptualize current business chatbot architectures and illustrate the technical characteristics of two common structures. Next, we explore the mainstream deep learning technologies in chatbot design from the perspective of computational methods and usages. Then, we propose a new framework to classify chatbot construction architectures and differentiate the traditional retrieval-based and generation-based chatbots in terms of the modern pipeline and end-to-end structures. Finally, we highlight future research directions for business chatbots to enable researchers to devote their efforts to the most promising research topics and commercial scenarios and for practitioners to benefit from realizing the trend in business chatbot development and applications.

31 January 2022 in IEEE Transactions on Knowledge and Data Engineering
Verified
Journal Article
Closed access
YCYufu Chen
Yufu Chen
ZLZhiqi Lei
Zhiqi Lei
YRYanghui Rao
Yanghui Rao
Haoran XieHaoran Xie
Haoran Xie
Fu Lee WangFu Lee Wang
Fu Lee Wang
QLQing Li
Qing Li
As a novel paradigm for data mining and dimensionality reduction, Non-negative Matrix Tri-Factorization (NMTF) has attracted much attention due to its notable performance and elegant mathematical derivation, and it has been applied to a plethora of real-world applications, such as text data co-clustering. However, the existing NMTF-based methods usually involve intensive matrix multiplications, which exhibits a major limitation of high computational complexity. With the explosion at both the size and the feature dimension of texts, there is a growing need to develop a parallel and scalable NMTF-based algorithm for text data co-clustering. To this end, we first show in this paper how to theoretically derive the original optimization problem of NMTF by introducing the Lagrangian multipliers. Then, we propose to solve the Lagrange dual objective function in parallel through an efficient distributed implementation. Extensive experiments on five benchmark corpora validate the effectiveness, efficiency, and scalability of our distributed parallel update algorithm for an NMTF-based text data co-clustering method.