Finding minimal rough set reducts with particle swarm optimization

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3641 LNAI, Issue , 2005, Pages 451-460

  Wang, Xiangyang ^a   Yang, Jie ^a   Peng, Ningsong ^a   Teng, Xiaolong ^a  

^a SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; MATHEMATICAL OPERATORS; OPTIMIZATION;

MINIMAL ROUGH SET REDUCTS; PARTICLE SWARM OPTIMIZATION;

ROUGH SET THEORY;

EID: 33645977199     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11548669_47     Document Type: Conference Paper

References (16)

1. Swiniarski, R.W., Skowron, A.: Rough set methods in feature selection and recognition. Pattern Recognition Letters 24 (2003) 833-849
2. Chouchoulas, A., Shen, Q.: Rough set-aided keyword reduction for text categorization. Applied Artificial Intelligence, 15(9) (2001) 843-873
3. 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, Kluwer Academic Publishers, Dordrecht (1992) 311-362
4. Hu, X.: Knowledge discovery in databases: An attribute-oriented rough set approach. Ph.D thesis, Regina university (1995)
5. 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)
6. 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 (1995) 186-189
7. Wroblewski, J.: Theoretical Foundations of Order-Based Genetic Algorithms. Fundamenta Informaticae. IOS Press, 28(3-4) (1996) 423-430
8. 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. Physica-Verlag, Heidelberg, Germany (2000) 49-88
9. 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. Heidelberg: Physica-Verlag (1998) 321-365.
10. Slezak, D., Wroblewski, J.: Order based genetic algorithms for the search of approximate entropy reducts. In: Wang, G.Y. et al. (eds.): RSFDGrC. LNAI, Vol. 2693. Chongqing, China (2003) 308-311
11. 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. Physica Verlag, Heidelberg (1998) 500-529
12. Kennedy, J., Eberhart, R.: Particle Swarm Optimization. In: Proc IEEE Int. Conf. On Neural Networks. Perth (1995) 1942-1948
13. 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)
14. Shi, Y., Eberhart, R.: A modified particle swarm optimizer. In: Proc. IEEE Int. Conf. On Evolutionary Computation. Anchorage, AK, USA (1998) 69-73
15. Eberhart, R., Shi, Y.: Particle swarm optimization: Developments, applications and resources. In: Proc. IEEE Int. Conf. On Evolutionary Computation. Seoul (2001) 81-86
16. 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