Tabu search for attribute reduction in rough set theory
- First Online:
- Cite this article as:
- Hedar, AR., Wang, J. & Fukushima, M. Soft Comput (2008) 12: 909. doi:10.1007/s00500-007-0260-1
In this paper, we consider a memory-based heuristic of tabu search to solve the attribute reduction problem in rough set theory. The proposed method, called tabu search attribute reduction (TSAR), is a high-level TS with long-term memory. Therefore, TSAR invokes diversification and intensification search schemes besides the TS neighborhood search methodology. TSAR shows promising and competitive performance compared with some other CI tools in terms of solution qualities. Moreover, TSAR shows a superior performance in saving the computational costs.