Nov 22, 2007 · In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction problem in rough set theory.

Oct 22, 2024 · In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction problem in rough set theory. The proposed ...

In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction problem in rough set theory.

Attribute reduction is the problem of selecting a minimal subset from the original set of attributes. Rough set theory has been used for attribute reduction ...

Nov 22, 2007 · Abstract In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction pro- blem in rough set theory.

Hedar et al. (2008) considered a memory-based heuristic of a tabu search to solve the attribute reduction problem in the rough set theory; ant colony-based ...

Jun 29, 2012 · Abstract:- This paper proposed a dynamic tabu search (DTSAR) that incorporated a dynamic tabu list to solve an attribute reduction problem ...

This paper proposed a dynamic tabu search (DTSAR) that incorporated a dynamic tabu list to solve an attribute reduction problem in rough set theory.

Tabu Search for Attribute Reduction in Rough Set Theory. Soft Computing, 12(9):909-918, 2008. [25] Vijay S. Desai, Jonathan N. Crook, George A. Berstreet Jr ...

Tabu search for attribute reduction in rough set theory | Faculty of Computers and Information.