Oct 2026· International Journal of Computational Intelligence Systems· 0 citations
TL;DR
A dual-constrained neighborhood model is developed by integrating generalized granular-ball structural information with neighborhood radius constraints and attribute ranking based on the overlap degree improves reduction results on some datasets, whereas generalized granular-ball partitioning captures local classification structures and maintains a reasonable balance between reduction rate and classification performance.
Abstract
As an effective mathematical framework for modeling fuzziness, inaccuracy, and uncertainty, neighborhood rough sets have been widely applied to attribute reduction and other data mining tasks. Existing neighborhood rough set methods generally rely on fixed neighborhood parameters to construct neighborhoods, which may fail to capture local variations in data distributions. To address this problem, a generalized granular-ball neighborhood rough set model incorporating an overlap degree function is proposed for attribute reduction in incomplete hybrid data. The proposed algorithm adopts a heterogeneous distance function for measuring difference in incomplete hybrid data and generates generalized granular balls using a purity-driven farthest-point bisection strategy, thus reducing repeated recalculations of granular-ball centers and radii. Based on the obtained generalized granular balls, a dual-constrained neighborhood model is developed by integrating generalized granular-ball structural information with neighborhood radius constraints. Candidate attributes are ranked according to the overlap degree, and the developed
$$(\alpha ,\lambda )$$
-generalized granular-ball dependency degree function based on relative inclusion degree is used to guide subsequent greedy deletion for obtaining reducts that preserve dependency. Experimental results show that the proposed method achieves the best average rankings in terms of accuracy, macro-F1 score, and macro-recall with both KNN and RF classifiers. Statistical tests further demonstrate that the proposed method achieves statistically significant improvements over some comparison methods on specific evaluation metrics when using the KNN classifier. Ablation experiments further demonstrate that attribute ranking based on the overlap degree improves reduction results on some datasets, whereas generalized granular-ball partitioning captures local classification structures and maintains a reasonable balance between reduction rate and classification performance. These findings support the feasibility and effectiveness of the proposed algorithm.
Neighborhood rough sets (NRSs) have been widely recognized as an efficient tool for solving attribute reduction problems in numerical data. In constructing neighborhood information granules, many existing extensions introduce weighting mechanisms for conditional attributes to quantify their influence on the decision at...
A. Pham, Thuy Ngoc Nguyen, Uyen Thi To Dinh et al.· International journal of mat...· 0 citations
The existing Granular-Ball (GB) generation methods construct granular-balls for clustering tasks by determining their center locations and sizes according to the local distribution characteristics of the data, making it difficult to accurately characterize clusters with arbitrary shapes. Consequently, the clusterin...
Teng Zhang, Jia-Liang Xie, Da-Jiang Chen et al.· International Journal of Int...· 0 citations
Classical Pawlak rough set theory is fundamentally based on equivalence relations, which limits its ability to represent uncertainty arising from non-equivalent and ordered information. This paper develops a generalized ordered rough set framework in which binary relations are combined with partial order structures to...
S. H. Shalil, M. K. El-Bably, M. A. El-Gayar et al.· Axioms· 0 citations
This work introduces a generic method dubbed as FERN (Fuzzy Entropy Rate Neighboring) that facilitates the adaptive implementation of neighborhood rough-feature selectors and defines a measure of fuzzy entropy rate which is leveraged to quantify the uncertainty in neighborhood.
Zhi-Wei Lv, Da-Mo Qian, Xun Wang et al.· International Journal of Mac...· 0 citations
Dempster–Shafer evidence theory and rough set theory are two important mathematical tools for dealing with uncertain information, and their integration provides a powerful theoretical framework for quantifying cognitive uncertainty. The classical D-S rough set model usually adopts the basic probability assignment BPA c...
Abstract Purpose This study aims to detect conditional outliers, which become anomalous only within a specified context, in mixed attribute data. It addresses contextual relevance, uncertainty and fuzziness that are often overlooked by conventional methods. Design/Methodology/Approach ICOD integrates fuzzy inclusion th...
Qi-Lin Li, Zhong Yuan, Shi-Hao Wang et al.· Journal of Data and Informat...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.