Attribute Reduction Based on Rough Sets and the Discrete Firefly Algorithm
Attribute reduction is used to allow elimination of redundant attributes while remaining full meaning of the original dataset. Rough sets have been used as attribute reduction techniques with much success. However, rough set applies to attribute reduction are inadequate at finding optimal reductions. This paper proposes an optimal attribute reduction strategy relying on rough sets and discrete firefly algorithm. To demonstrate the applicability and superiority of the proposed model, comparison between the proposed models with existing well-known methods is also investigated. The experiment results illustrate that performances of the proposed model when compared to other attribute reduction can provide comparative solutions efficiently.
KeywordsAttribute Reduction Reduction Feature selection Rough sets Core Firefly Algorithm
Unable to display preview. Download preview PDF.
- 6.Hoa, N.S.: Some Efficient Algorithms For Rough Set Methods. In: Proceedings IPMU 1996 Granada, Spain, pp. 1541–1457 (1996)Google Scholar
- 15.Luthra, J., Pal, S.K.: A hybrid Firefly Algorithm using genetic operators for the cryptanalysis of a monoalphabetic substitution cipher. In: 2011 World Congress on Information and Communication Technologies (WICT), pp. 202–206 (2011)Google Scholar
- 19.Long, N.C., Meesad, P.: Meta-heuristic algorithms applied to the optimization of type-1 and type 2 TSK fuzzy logic systems for sea water level prediction. In: 2013 IEEE Sixth International Workshop on Computational Intelligence Applications (IWCIA), Hiroshima, Japan, pp. 69–74 (2013)Google Scholar