Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bargiela A and Pedrycz W (2002). Granular computing: an introduction. Springer, Berlin
Burke EK and Kendall G (2005). Search methodologies: introductory tutorials in optimization and decision support techniques. Springer, Berlin
Chouchoulas A and Shen Q (2001). Rough set-aided keyword reduction for text categorisation. Appl Artif Intell 15: 843–873
Engelbrecht AP (2003). Computational intelligence: an introduction. Wiley, Chichester
Glover F (1986). Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13: 533–549
Glover F (1989). Tabu search–Part I. ORSA J Comput 1: 190–206
Glover F (1990). Tabu search–Part II. ORSA J Comput 2: 4–32
Glover F and Laguna M (1997). Tabu search. Kluwer, Boston
Hedar A and Fukushima M (2006). Tabu search directed by direct search methods for nonlinear global optimization. Eur J Oper Res 170: 329–349
Jelonek J, Krawiec K and Slowinski R (1995). Rough set reduction of attributes and their domains for neural networks. Comput Intell 11: 339–347
Jensen R, Shen Q (2003) Finding rough set reducts with ant colony optimization. In: Proceedings of the 2003 UK workshop on computational intelligence, pp 15–22
Jensen R and Shen Q (2004). Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Trans Knowl Data Eng 16: 1457–1471
Konar A (2005). Computational intelligence: principles, techniques and applications. Springer, Berlin
Lin TY, Yao YY and Zadeh LA (2002). Data mining, rough sets and granular computing. Springer, Berlin
Montgomery DC and Runger GC (2003). Applied statistics and probability for engineers, 3rd edn. Wiley, Chichester
Pawlak Z (1982). Rough sets. Int J Comput Inf Sci 11: 341–356
Pawlak Z (1991). Rough sets: theoretical aspects of reasoning about data. Kluwer, Dordrecht
Pawlak Z and Skowron A (2000). Rough set methods and applications: New developments in knowledge discovery in information systems. In: Polkowski, L, Lin, TY and Tsumoto, S (eds) Studies in fuzziness and soft computing, vol 56., pp. Physica-Verlag, Berlin
Rego C and Alidaee B (2005). Metaheursitic optimization via memory and evolution. Springer, Berlin
Swiniarski RW and Skowron A (2003). Rough set methods in feature selection and recognition. Patt Recogn Lett 24: 833–849
Tan S (2004) A global search algorithm for attributes reduction. In: Webb GI, Yu X (eds) AI 2004: advances in artificial intelligence. LNAI 3339, pp 1004–1010
Tettamanzi A, Tomassini M and Janben J (2001). Soft computing: integrating evolutionary, neural, and fuzzy systems. Springer, Berlin
Zhai L-Y, Khoo L-P and Fok S-C (2002). Feature extraction using rough set theory and genetic algorithms—an application for simplification of product quality evaluation. Comput Ind Eng 43: 661–676
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Hedar, AR., Wang, J. & Fukushima, M. Tabu search for attribute reduction in rough set theory. Soft Comput 12, 909–918 (2008). https://doi.org/10.1007/s00500-007-0260-1
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00500-007-0260-1