Abstract
We propose a new algorithm to find minimal rough set reducts by using Particle Swarm Optimization (PSO). Like Genetic Algorithm, PSO is also a type of evolutionary algorithm. But compared with GA, PSO does not need complex operators as crossover and mutation that GA does, it requires only primitive and simple mathematical operators, and is computationally inexpensive in terms of both memory and times. The experiments on some UCI data compare our algorithm with GA-based, and other deterministic rough set reduction algorithms. The results show that PSO is efficient to minimal rough set reduction.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24, 833–849 (2003)
Chouchoulas, A., Shen, Q.: Rough set-aided keyword reduction for text categorization. Applied Artificial Intelligence 15(9), 843–873 (2001)
Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Swiniarski, R. (ed.) Intelligent Decision Support–Handbook of Applications and Advances of the Rough Sets Theory, pp. 311–362. Kluwer Academic Publishers, Dordrecht (1992)
Hu, X.: Knowledge discovery in databases: An attribute-oriented rough set approach. Ph.D thesis, Regina university (1995)
Wang, G.Y., et al.: Theoretical Study on Attribute Reduction of Rough Set Theory: Comparison of Algebra and Information Views. In: Proceedings of the Third IEEE International Conference on Cognitive Informatics (2004)
Wroblewski, J.: Finding minimal reducts using genetic algorithms. In: Proc. of the Second Annual Join Conference on Information Sciences, Wrightsville Beach, NC, September 28 - October 1, pp. 186–189 (1995)
Wroblewski, J.: Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae 28(3-4), 423–430 (1996)
Bazan, J., Nguyen, H.S., et al.: Rough set algorithms in classification problems. In: Polkowski, L., Lin, T.Y., Tsumoto, S. (eds.) Rough Set Methods and Applications: New Developments in Knowledge Discovery in Information Systems. Studies in Fuzziness and Soft Computing, vol. 56, pp. 49–88. Physica, Heidelberg (2000)
Bazan, J.: A Comparison of Dynamic and non-Dynamic Rough Set Methods for Extracting Laws from Decision Table. In: Polkowski, L., Skowron, A. (eds.) Rough Sets in Knowledge Discovery, pp. 321–365. Physica, Heidelberg (1998)
Slezak, D., Wroblewski, J.: Order based genetic algorithms for the search of approximate entropy reducts. In: Wang, G., Liu, Q., Yao, Y., Skowron, A., et al. (eds.) RSFDGrC 2003. LNCS (LNAI), vol. 2639, pp. 308–311. Springer, Heidelberg (2003)
Stefanowski, J.: On rough set based approaches to induction of decision rules. In: Skowron, A., Polkowski, L. (eds.) Rough Sets in Knowledge Discovery, vol. 1, pp. 500–529. Physica, Heidelberg (1998)
Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc. IEEE Int. Conf. on Neural Networks, Perth, pp. 1942–1948 (1995)
Kennedy, J., Spears, W.M.: Matching Algorithms to Problems: An Experimental Test of the Particle Swarm and Some Genetic Algorithms on the Multimodal Problem Generator. In: Proceedings of the IEEE Int’l Conference on Evolutionary Computation (1998)
Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proc. IEEE Int. Conf. On Evolutionary Computation, Anchorage, AK, USA, pp. 69–73 (1998)
Eberhart, R., Shi, Y.: Particle swarm optimization: Developments, applications and resources. In: Proc. IEEE Int. Conf. On Evolutionary Computation, Seoul, pp. 81–86 (2001)
Blake, C., Keogh, E., et al.: UCI repository of machine learning databases. Tech. rep. Department of Information and Computer Science, University of California, Irvine, CA (1998), http://www.ics.uci.edu/mlearn/MLRepository.htm
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wang, X., Yang, J., Peng, N., Teng, X. (2005). Finding Minimal Rough Set Reducts with Particle Swarm Optimization. In: Ślęzak, D., Wang, G., Szczuka, M., Düntsch, I., Yao, Y. (eds) Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing. RSFDGrC 2005. Lecture Notes in Computer Science(), vol 3641. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11548669_47
Download citation
DOI: https://doi.org/10.1007/11548669_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28653-0
Online ISBN: 978-3-540-31825-5
eBook Packages: Computer ScienceComputer Science (R0)