Shaobo Deng

Shaobo Deng


Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
8 November 2022 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
LKLin Ke
Lin Ke
MLMin Li
Min Li
LWLei Wang
Lei Wang
SDShaobo Deng
Shaobo Deng
JYJun Ye
Jun Ye
XYXiang Yu
Xiang Yu

1 January 2025 in Computers, Materials & Continua
Verified
Journal Article
Open access
MXMeiru Xie
Meiru Xie
BWBo Wang
Bo Wang
SZShuaikun Zhang
Shuaikun Zhang
SGSujie Guan
Sujie Guan
MLMin Li
Min Li
SDShaobo Deng
Shaobo Deng
In recent years, particle swarm optimization (PSO) has received widespread attention in feature selection due to its simplicity and potential for global search. However, in traditional PSO, particles primarily update based on two extreme values: personal best and global best, which limits the diversity of information. Ideally, particles should learn from multiple advantageous particles to enhance interactivity and optimization efficiency. Accordingly, this paper proposes a PSO that simulates the evolutionary dynamics of species survival in mountain peak ecology (PEPSO) for feature selection. Based on the pyramid topology, the algorithm simulates the features of mountain peak ecology in nature and the competitive-cooperative strategies among species. According to the principles of the algorithm, the population is first adaptively divided into many subgroups based on the fitness level of particles. Then, particles within each subgroup are divided into three different types based on their evolutionary levels, employing different adaptive inertia weight rules and dynamic learning mechanisms to define distinct learning modes. Consequently, all particles play their respective roles in promoting the global optimization performance of the algorithm, similar to different species in the ecological pattern of mountain peaks. Experimental validation of the PEPSO performance was conducted on 18 public datasets. The experimental results demonstrate that the PEPSO outperforms other PSO variant-based feature selection methods and mainstream feature selection methods based on intelligent optimization algorithms in terms of overall performance in global search capability, classification accuracy, and reduction of feature space dimensions. Wilcoxon signed-rank test also confirms the excellent performance of the PEPSO.

14 March 2025 in Pattern Analysis and Applications
Verified
Journal Article
Closed access
PDF file
MLMin Li
Min Li
CJChen Jin
Chen Jin
YCYuheng Cai
Yuheng Cai
SDShaobo Deng
Shaobo Deng
LWLei Wang
Lei Wang

1 April 2013 in Journal of Computers
Verified
Journal Article
Closed access
PDF file
MLMin Li
Min Li
SDShaobo Deng
Shaobo Deng
SFShengzhong Feng
Shengzhong Feng
JFJianping Fan
Jianping Fan
Attribute reduction is one of the core research content of Rough sets theory. Many existing algorithms mainly are aimed at the reduction of consistency decision table, and very little work has been done for attribute reduction aimed at inconsistency decision table. In fact, the methods finding Pawlak reduct from consistent decision table are not suitable for inconsistency decision table. In this paper, we introduce the approximation dependency reduction modal and present the Quick Attribution Reduction based on Approximation Dependency Degree (Quick-ARADD), which can retain the original boundary region and the original positive region unchanged, and keep the approximation accuracy unchanged for all decision equivalence classes (the partition of universe on decision attributes) of a decision table. Theoretical analysis and experimental results show that the Quick-ARADD algorithm is effective and feasible.

17 April 2024 in Research Square
Verified
Preprint
Open access
PDF file
MLMin Li
Min Li
YWYong Wang
Yong Wang
SDShaobo Deng
Shaobo Deng
LWLei Wang
Lei Wang
The problem of imbalanced data classification is a prominent and challenging research topic in the field of data mining and machine learning. Numerous studies have demonstrated that synthetic minority oversampling technique (SMOTE) and its variants are widely adopted methods for addressing imbalanced data training. However, the performance of SMOTE and its variants can be affected by noise. Additionally, most existing techniques used to handle noise in SMOTE variants involve directly deleting noisy samples, which may lead to class re-imbalance and deviation of the decision boundary. Furthermore, SMOTE and its variants do not guarantee the diversity of synthetic samples. Motivated by these limitations, this study aims to propose a novel oversampling method named TRPS-DER to tackle class-imbalanced classification problems. TRPS-DER utilizes triangular region pre-sampling for synthesizing minority class samples and employs differential evolution resampling for filtering out noise. The primary advantage of TRPS-DER include that (a) it generates minority class samples by interpolation of triangular region, thereby augmenting diversity of synthesize samples; and (b) it employs differential evolution for resampling generated samples, effectively filtering out noise and improving classification performance. Extensive experimental results demonstrate that TRPS-DER significantly outperforms other competitive SMOTE-based oversampling methods across 24 imbalanced datasets in terms of Gmean, BACC, AUC.

1 April 2018 in Frontiers of Computer Science
Verified
Journal Article
Closed access
PDF file
SDShaobo Deng
Shaobo Deng
SGSujie Guan
Sujie Guan
MLMin Li
Min Li
LWLei Wang
Lei Wang
YSYuefei Sui
Yuefei Sui