A feature selection algorithm embedded with division-mining-fusion strategy and redundant-sample-deletion technology
摘要
Efficiency and accuracy are two core metrics for evaluating the performance of a feature selection algorithm. Currently, most feature selection algorithms based on rough set (RS) theory struggle to balance these two critical indicators simultaneously. To address this challenge, we first investigate the RS theory under two technical frameworks: the Divisuin-Mining-Fusion (DMF) strategy and the Redundant-Sample-Deletion (RSD) technique. Theoretical analyses reveal that the DMF strategy and RSD technique can significantly improve the classification accuracy and computational efficiency of RS-based data analysis. Subsequently, we integrate the DMF strategy with the RSD technique to develop a novel feature selection algorithm. Results from comparative experiments confirm that, compared with traditional feature selection algorithms, the proposed algorithm exhibits significant advantages in both classification accuracy and computational efficiency.