Binbin Sang

Prof. Binbin Sang

orcid

Research Focus & Metrics

Academic Career Length

4Years (2023-Present)

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

Representative Publications

View All Publications
2 May 2023 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
Binbin SangBinbin Sang
Binbin Sang
Weihua XuWeihua Xu
Weihua Xu
HCHongmei Chen
Hongmei Chen
TLTianrui Li
Tianrui Li
Feature selection methods with anti-noise performance are effective dimensionality reduction methods for classification tasks with noise. However, there are few studies on robust feature selection methods for monotonic classification tasks. The fuzzy dominance rough set (FDRS) model is a nontrivial knowledge acquisition tool, which is widely used in feature selection of monotonic classification tasks. Nonetheless, this model has been proved in practice to be generally poorly fault-tolerance, and only one noisy sample can cause huge interference in acquiring knowledge. In view of these two issues, this paper firstly designs an adaptive $K$ -nearest neighbors strategy to calculate the density of samples. The noisy samples are identified according to their densities, and then an active anti-noise fuzzy dominance rough set model is proposed. Then, in the active anti-noise fuzzy dominance rough approximation space, the class-separability is evaluated by the approximation operators of the proposed model, and the feature-redundancy is evaluated by the fuzzy ranking conditional mutual information. On this basis, a feature evaluation index is designed comprehensively considering class-separability and feature-redundancy. Finally, a feature selection algorithm is designed to select the feature subset with the highest classification performance. The experimental results show that the proposed algorithm has better robustness and classification performance.

23 May 2023 in Expert Systems with Applications
Verified
Journal Article
Closed access
Binbin SangBinbin Sang
Binbin Sang
LYLei Yang
Lei Yang
HCHongmei Chen
Hongmei Chen
WXWeihua Xu
Weihua Xu
XZXiaoyan Zhang
Xiaoyan Zhang

21 March 2025 in IEEE Transactions on Systems, Man, and Cybernetics: Systems
Verified
Journal Article
Closed access
Binbin SangBinbin Sang
Binbin Sang
LYLei Yang
Lei Yang
HCHongmei Chen
Hongmei Chen
TLTianrui Li
Tianrui Li
Weihua XuWeihua Xu
Weihua Xu
Robust knowledge acquisition approaches are one of the research hotspots in data mining. The fuzzy dominance rough sets (FDRS) model is an important knowledge acquisition tool for ordinal classification tasks. However, it has been proved in practice that this model usually performs poorly fault tolerance, and only one noisy sample can cause huge interference in acquiring knowledge. Attribute reduction is one of the nontrivial applications of the FDRS. At present, most attribute reduction methods for ordinal classification tasks mainly focus on the dependence of decision to attributes, while ignoring the information provided by the separability of classes and the correlation of attributes for ordinal classification. In view of these two issues, this article first proposes a robust FDRS model with filterable noise samples. Then, the class-separability and attribute-correlation are explored in robust fuzzy dominance rough approximation space, and corresponding attribute evaluation index is designed. Finally, an attribute reduction algorithm is designed to select the attribute subset with the highest classification performance. The experimental results show that the proposed algorithm has better robustness and classification performance.

20 April 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
SCShaoguo Cui
Shaoguo Cui
GLGengsen Li
Gengsen Li
Binbin SangBinbin Sang
Binbin Sang
WXWeihua Xu
Weihua Xu
HCHongmei Chen
Hongmei Chen

12 January 2026 in IEEE Transactions on Fuzzy Systems
Verified
Journal Article
Closed access
HZHua Zhang
Hua Zhang
LYLei Yang
Lei Yang
Binbin SangBinbin Sang
Binbin Sang
Weihua XuWeihua Xu
Weihua Xu
SXShuyin Xia
Shuyin Xia
GWGuoyin Wang
Guoyin Wang
Outlier detection is an effective technique for identifying abnormal samples in complex data. Random walks effectively detect outliers by analyzing graph transition patterns. However, existing methods only consider local transitions and fail to capture complex structural patterns in complex data. Granular-ball computing based outlier detection methods have better robustness and efficiency. Nevertheless, these methods use a coarse-granularity representation of granular-balls and ignore the large number of sample information within the granular-balls. To address the above issues, this paper develops a bi-level granular-ball based second-order biased random walk outlier detection method. First, a bi-level granular-ball knowledge representation method is proposed to address the information distortion inherent in granular-ball computing-based methods. Then, a granular-ball anomaly membership evaluation metric is introduced, which leverages second-order biased random walk, to endow granular-balls with coarse-granularity anomaly degrees. Subsequently, a bi-level granular-ball anomaly classifier is designed to map coarse-granularity granular-ball anomaly degrees to fine-granularity sample-level anomaly degrees. Finally, a distilled outlier factor is defined, which selects optimal attribute sequences through granular-ball construction on attributes, for outlier detection. At the same time, a corresponding outlier detection algorithm is proposed. Experiments on datasets are conducted to compare the proposed algorithm with six other algorithms. The experimental results show that the algorithm has better performance and a certain degree of robustness.

4 May 2026 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
XLXiaoyu Lian
Xiaoyu Lian
SXShuyin Xia
Shuyin Xia
Binbin SangBinbin Sang
Binbin Sang
GWGuoyin Wang
Guoyin Wang
XGXinbo Gao
Xinbo Gao
Fuzzy rough set (FRS) theory is effective for handling uncertainty and vagueness in complex datasets. However, most existing models rely on fine-grained pointwise analysis, resulting in poor robustness to noise. This article integrates granular ball computing into FRSs by replacing individual data points with granular balls of varying sizes. A granular ball FRS (GBFRS) framework is proposed and applied to feature selection for the first time. Each granular ball is labeled by the majority class of its internal samples, reducing the impact of noisy instances and improving noise tolerance. Within this framework, a weighted fuzzy dependency function is redefined based on fixed https://github.com/lianxiaoyu724/GBFRS structures, where the weight is determined by the proportion of samples within each granular ball. Larger balls have higher fuzzy dependency values and thus receive greater weights, enabling a more stable evaluation of attribute importance. The theoretical foundations, including properties of lower and upper approximations and the convergence of dependency, are formally established. The experimental results on multiple UCI datasets demonstrate that GBFRS outperforms existing methods in classification accuracy. The source codes and datasets are both available on the public link: https://github.com/lianxiaoyu724/GBFRS