Keyang Ding

Mr. Keyang Ding

orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
1 January 2023
Verified
Conference Paper
Open access
PDF file
QWQianlong Wang
Qianlong Wang
KDKeyang Ding
Keyang Ding
BLBin Liang
Bin Liang
Min YangMin Yang
Min Yang
Ruifeng XuRuifeng Xu
Ruifeng Xu
Qianlong Wang, Keyang Ding, Bin Liang, Min Yang, Ruifeng Xu. Findings of the Association for Computational Linguistics: EMNLP 2023. 2023.

22 July 2024 in IEEE Transactions on Affective Computing
Verified
Journal Article
Closed access
QWQianlong Wang
Qianlong Wang
ZWZhiyuan Wen
Zhiyuan Wen
KDKeyang Ding
Keyang Ding
BLBin Liang
Bin Liang
Ruifeng XuRuifeng Xu
Ruifeng Xu
Cross-domain sentiment analysis (CDSA) aims to predict the sentiment polarities of reviews in the target domain using a sentiment classifier learned from the source labeled domain. Most existing studies are dominant with adversarial learning methods and focus on learning domain-invariant sentiment representations in both the source and target domains. However, since sentiment-specific features are not explicitly decoupled, the model may confuse domain features with sentiment features, thus affecting its generalization ability on target domains. Unlike previous studies, in this paper, we tackle the CDSA task from the view of disentangled representation learning, which explicitly learns the disentangled representations of review, focusing in particular on sentiment and domain semantics. Specifically, we disentangle sentiment-specific and domain-specific features from the text representation of the review by two different linear transformations. Then, we introduce a straightforward disentangled loss to disallow the sentiment-specific feature to capture domain information. Moreover, we leverage target unlabeled data to improve the quality of the learned sentiment-specific features via prototypical learning. It indirectly encourages the sentiment-specific features of target samples having potentially different classes more discriminative. Extensive experiments on widely used CDSA datasets show that our method surpasses competitive baselines and achieves new state-of-the-art results, demonstrating its effectiveness and superiority.

2 January 2024 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
KDKeyang Ding
Keyang Ding
CFChuang Fan
Chuang Fan
YDYiwen Ding
Yiwen Ding
QWQianlong Wang
Qianlong Wang
ZWZhiyuan Wen
Zhiyuan Wen
Ruifeng XuRuifeng Xu
Ruifeng Xu
In this article, we present our work in social emotion prediction to online trending topics. While most prior works focus on emotion from writers or the readers’ emotions evoked by news articles, we investigate discussions from massive social media users and explore the public feelings to the online trending topic. We employ user-generated “#hashtags” to indicate online trending topics and construct a large-scale Chinese dataset for social emotion prediction (LCSEP) to trending topics collected from the Chinese microblog Sina Weibo. It contains more than 20 000 trending topics, each with social emotions voted in 24 fine-grained types, and gathers hashtags, posts, comments, and related metadata to give each trending topic a thorough context. We also propose a Hashtag- and Topic-Enhanced Attention Model (HTEAM) that combines a pretrained BERT model, a neural topic model, and an attention mechanism via joint training to understand social emotion. Experiments show that HTEAM outperforms baselines and achieves the state-of-the-art result.

10 July 2024
Verified
Conference Paper
Open access
QWQianlong Wang
Qianlong Wang
KDKeyang Ding
Keyang Ding
XLXuan Luo
Xuan Luo
Ruifeng XuRuifeng Xu
Ruifeng Xu
In this paper, we leverage in-context learning (ICL) paradigm to handle few-shot aspect-based sentiment analysis (ABSA). Previous works first rank candidate examples by some metrics and then independently retrieve examples similar to test samples. However, their effectiveness may be discounted because of two limitations: in-context example redundancy and example preference misalignment between retriever and LLM. To alleviate them, we propose a novel framework that sequentially retrieves in-context examples. It not only considers which example is useful for the test sample but also prevents its information from being duplicated by already retrieved examples. Subsequently, we exploit the rewards of LLMs on retrieved in-context examples to optimize parameters for bridging preference gaps. Experiments on four ABSA datasets show that our framework is significantly superior to previous works.

1 January 2025
Verified
Conference Paper
Open access
PDF file
QWQianlong Wang
Qianlong Wang
KDKeyang Ding
Keyang Ding
HGHengxin Gao
Hengxin Gao
HWHui Wang
Hui Wang
Ruifeng XuRuifeng Xu
Ruifeng Xu
Qianlong Wang, Keyang Ding, Hengxin Gao, Hui Wang, Ruifeng Xu. Proceedings of the 63rd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). 2025.

14 June 2023 in Electronics
Verified
Journal Article
Open access
PDF file
ZWZhiyuan Wen
Zhiyuan Wen
RWRui Wang
Rui Wang
SCShiwei Chen
Shiwei Chen
QWQianlong Wang
Qianlong Wang
KDKeyang Ding
Keyang Ding
Ruifeng XuRuifeng Xu
Ruifeng Xu
Verbal irony is a common form of expression used in daily communication, where the intended meaning is often opposite to the literal meaning. Accurately recognizing verbal irony is essential for any NLP application for which the understanding of the true user intentions is key to performing the underlying tasks. While existing research has made progress in this area, verbal irony often involves connotative knowledge that cannot be directly inferred from the text or its context, which limits the detection model’s ability to recognize and comprehend verbal irony. To address this issue, we propose a Retrieval–Detection method for Verbal Irony (RDVI). This approach improves the detection model’s ability to recognize and comprehend verbal irony by retrieving the connotative knowledge from the open domain and incorporating it into the model using prompt learning. The experimental results demonstrate that our proposed method outperforms state-of-the-art models.