New rough set attribute reduction algorithm based on grey wolf optimization

17Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this paper, we propose a new attribute reduction strategy based on rough sets and grey wolf optimization (GWO). Rough sets have been used as an attribute reduction technique with much success, but current hill-climbing rough set approaches to attribute reduction are inconvenient at finding optimal reductions as no perfect heuristic can guarantee optimality. Otherwise, complete searches are not feasible for even medium sized datasets. So, stochastic approaches provide a promising attribute reduction technique. Like Genetic Algorithms, GWO is a new evolutionary computation technique, mimics the leadership hierarchy and hunting mechanism of grey wolves in nature. The grey wolf optimization find optimal regions of the complex search space through the interaction of individuals in the population. Compared with GAs, GWO does not need complex operators such as crossover and mutation, it requires only primitive and easy mathematical operators, and is computationally inexpensive in terms of both memory and runtime. Experimentation is carried out, using UCI data, which compares the proposed algorithm with a GA-based approach and other deterministic rough set reduction algorithms. The results show that GWO is efficient for rough set-based attribute reduction.

Cite

CITATION STYLE

APA

Yamany, W., Emary, E., & Hassanien, A. E. (2016). New rough set attribute reduction algorithm based on grey wolf optimization. In Advances in Intelligent Systems and Computing (Vol. 407, pp. 241–251). Springer Verlag. https://doi.org/10.1007/978-3-319-26690-9_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free