Zheng Chen

Zheng Chen

orcid

Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
12 April 2022 in Neurocomputing
Verified
Journal Article
Closed access
ZCZheng Chen
Zheng Chen
CGChangyu Guo
Changyu Guo

1 December 2006 in IEEE International Conference on Data Mining (ICDM)
Verified
Conference Paper
Open access
HLHua Li
Hua Li
DSDou Shen
Dou Shen
BZBenyu Zhang
Benyu Zhang
ZCZheng Chen
Zheng Chen
QYQiang Yang
Qiang Yang

23 June 2021 in Applied Sciences
Verified
Journal Article
Open access
PDF file
WGWei Gou
Wei Gou
ZCZheng Chen
Zheng Chen
Chinese Spelling Error Correction is a hot subject in the field of natural language processing. Researchers have already produced many great solutions, from the initial rule-based solution to the current deep learning method. At present, SpellGCN, proposed by Alibaba’s team, achieves the best results of which character level precision over SIGHAN2013 is 98.4%. However, when we apply this algorithm to practical error correction tasks, it produces many false error correction results. We believe that this is because the corpus used for model training contains significantly more errors than the text used for model correcting. In response to this problem, we propose performing a post-processing operation on the error correction tasks. We employ the initial model’s output as a candidate character, obtain various features of the character itself and its context, and then use a classification model to filter the initial model’s false error correction results. The post-processing idea introduced in this paper can apply to most Chinese Spelling Error Correction models to improve their performance over practical error correction tasks.


18 February 2015 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
ZCZheng Chen
Zheng Chen
MCMinmin Chen
Minmin Chen
KWKilian Weinberger
Kilian Weinberger
WZWeixiong Zhang
Weixiong Zhang
Link prediction and multi-label learning on graphs are two important but challenging machine learning problems that have broad applications in diverse fields. Not only are the two problems inherently correlated and often appear concurrently, they are also exacerbated by incomplete data. We develop a novel algorithm to solve these two problems jointly under a unified framework, which helps reduce the impact of graph noise and benefits both tasks individually. We reduce multi-label learning problem into an additional link prediction task and solve both problems with marginalized denoising, which we co-regularize with Laplacian smoothing. This approach combines both learning tasks into a single convex objective function, which we optimize efficiently with iterative closed-form updates. The resulting approach performs significantly better than prior work on several important real-world applications with great consistency.

7 October 2018
Verified
Book Chapter
Closed access
PDF file
ZCZheng Chen
Zheng Chen
KHKeqi Hu
Keqi Hu