Yucong Jiang

Ms. Yucong Jiang


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
12 January 2024 in Engineering Applications of Artificial Intelligence
Verified
Journal Article
Closed access
HGHuanhuan Gong
Huanhuan Gong
YJYucong Jiang
Yucong Jiang
JZJiaoni Zhang
Jiaoni Zhang
BZBaoshuang Zhang
Baoshuang Zhang
XWXialin Wang
Xialin Wang

16 October 2023 in Applied Soft Computing
Verified
Journal Article
Closed access
XWXialin Wang
Xialin Wang
YJYucong Jiang
Yucong Jiang
JZJiaoni Zhang
Jiaoni Zhang
BZBaoshuang Zhang
Baoshuang Zhang
HGHuanhuan Gong
Huanhuan Gong

28 July 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
JZJiaoni Zhang
Jiaoni Zhang
YJYucong Jiang
Yucong Jiang
BZBaoshuang Zhang
Baoshuang Zhang
XWXialin Wang
Xialin Wang
HGHuanhuan Gong
Huanhuan Gong

30 October 2024 in Expert Systems with Applications
Verified
Journal Article
Closed access
XWXialin Wang
Xialin Wang
YJYucong Jiang
Yucong Jiang
JZJiaoni Zhang
Jiaoni Zhang

5 July 2022 in Research Square
Verified
Preprint
Open access
PDF file
ZCZheng Chai
Zheng Chai
YJYucong Jiang
Yucong Jiang
Aiming at the disadvantages of exponential growth of time required by KNN algorithm on data sets containing a large number of samples and low classification performance, this paper proposes a sample reduction method based on classification contribution ranking (SRCCR), which not only greatly reduces the storage demand and execution time, but also significantly improves the classification effect of KNN algorithm. Firstly, SRCCR denoises the initial training set, and expands the smooth decision boundary to a certain extent by removing the noise points in the data set; Secondly, the denoised samples are sorted in ascending order based on the classification contribution strategy. The lower the score, the closer the sample is to the class boundary, and the higher the score, the closer it is to the center of the same kind of samples; Finally, the selection process based on local set is used to select a certain representative boundary samples and a small number of central samples to form the final subset. Although the boundary samples contribute the most to the classification accuracy, appropriate retention of central samples can greatly improve the classification effect. In order to verify the effectiveness of the proposed method, we conduct comparative experiments on 24 real data sets from UCI and KEEL databases. Compared with several classical instance selection algorithms, the proposed SRCCR algorithm has certain advantages in accuracy and simplification rate. The results on the two-dimensional data set `Banana' show that SRCCR algorithm not only selects more representative boundary points and center points, but also retains the distribution of the original data set to a great extent.