Fast feature selection algorithm for neighborhood rough set model based on Bucket and Trie structures
- 4 Downloads
Feature selection is viewed as the problem of finding the minimal number of features from an original set with the minimum information loss. Due to its high importance in the fields of pattern recognition and data mining, it is necessary to investigate fast and effective search algorithms. In this paper, we introduce a novel fast feature selection algorithm for neighborhood rough set model based on Bucket and Trie structures. This proposed algorithm can guarantee to find the optimal minimal reduct by adopting a global search strategy. In addition, the dependence degree is subsequently used to evaluate the relevance of the attribute subset. Consequently, the proposed algorithm is tested on several standard data sets from UCI repository and compared with the most recent related approaches. The obtained theoretical and experimental results reveal that the present algorithm is very effective and convenient for the problem of feature selection, indicating that it could be useful for many pattern recognition and data mining systems.
KeywordsFeature selection Rough set theory Neighborhood rough set Fast algorithm Trie structure Bucket structure
The authors thankfully acknowledge the Laboratory of Intelligent Systems and Applications (LSIA) for his support to achieve this work.
Compliance with ethical standards
Conflict of interest
The authors declare no conflict of interest.
- Dheeru D, Karra Taniskidou E (2017) UCI machine learning repository. Irvine, University of California, School of Information and Computer Science. http://archive.ics.uci.edu/ml/
- Pedrycz W, Chen S-M (2014) Information granularity, big data, and computational intelligence, vol 8. Springer, BerlinGoogle Scholar
- Pedrycz W, Chen S-M (2015) Granular computing and decision-making: interactive and iterative approaches, vol 10. Springer, BerlinGoogle Scholar
- Post MJ, van der Putten P, van Rijn JN (2016) Does feature selection improve classification? a large scale experiment in OpenML. In: International symposium on intelligent data analysis. Springer, pp 158–170Google Scholar
- Shi Y, Huang Y, Wang C, He Q (2018) Attribute reduction based on the boolean matrix. Granul Comput 1–10Google Scholar
- Zhang W, Wang X, Yang X, Chen X, and Wang P (2018a) Neighborhood attribute reduction for imbalanced data. Granul ComputGoogle Scholar