Chengcheng Yu

Dr. Chengcheng Yu

orcid

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
22 August 2024
Verified
Book Chapter
Closed access
PDF file
CGChenghua Gong
Chenghua Gong
XLXiang Li
Xiang Li
JYJianxiang Yu
Jianxiang Yu
YCYao Cheng
Yao Cheng
JTJiaqi Tan
Jiaqi Tan
CYChengcheng Yu
Chengcheng Yu

21 October 2024
Verified
Conference Paper
Open access
CYChengcheng Yu
Chengcheng Yu
JZJiapeng Zhu
Jiapeng Zhu
XLXiang Li
Xiang Li
Graph neural networks (GNNs) have recently demonstrated significant success. Active learning for GNNs aims to query the valuable samples from the unlabeled data for annotation to maximize the GNNs' performance at a low cost. However, most existing methods for reinforced active learning in GNNs may lead to a highly imbalanced class distribution, especially in highly skewed class scenarios. This further adversely affects the classification performance. To tackle this issue, in this paper, we propose a novel reinforced class-balanced active learning framework for GNNs, namely, GraphCBAL. It learns an optimal policy to acquire class-balanced and informative nodes for annotation, maximizing the performance of GNNs trained with selected labeled nodes. GraphCBAL designs class-balance-aware states, as well as a reward function that achieves trade-off between model performance and class balance. We further upgrade GraphCBAL to GraphCBAL++ by introducing a punishment mechanism to obtain a more class-balanced labeled set. Extensive experiments on multiple datasets demonstrate the effectiveness of the proposed approaches, achieving superior performance over state-of-the-art baselines. In particular, our methods can strike the balance between classification results and class balance. We provide our code and data at https://github.com/cici-chengcheng/GraphCBAL.

16 August 2025 in The Journal of Supercomputing
Verified
Journal Article
Closed access
PDF file
FCFangshu Chen
Fangshu Chen
YHYilin Huang
Yilin Huang
JWJiahui Wang
Jiahui Wang
CYChengcheng Yu
Chengcheng Yu
XMXiankai Meng
Xiankai Meng

9 September 2023
Verified
Book Chapter
Closed access
PDF file
CYChengcheng Yu
Chengcheng Yu
LFLujing Fei
Lujing Fei
FCFangshu Chen
Fangshu Chen
LCLin Chen
Lin Chen
JWJiahui Wang
Jiahui Wang


1 August 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
CYChengcheng Yu
Chengcheng Yu
LSLing Shu
Ling Shu
In recent years, the world economy is being transformed into a digital one. E-commerce has brought a lot of convenience people's life, which is followed by the exponential growth of online reviews of e-commerce. These comments are very valuable for e-commerce and users. This paper proposes an effective method of summarizing short comments information based on Chinese. This method uses a series of phrases composed by noun and adjective as the final presentation. Firstly, the noun and adjective phrases in each comment were extracted, then the LDA probability model was used for content clustering, and finally the content summary of each category was extracted according the frequency of occurrence. In this paper, the real comment data of Taobao is used for experiments, and the results show that the proposed method can effectively summarize valuable information of commodities.