doi: 10.4304/jsw.9.9.2276-2282
An Attribute Reduction Algorithm Based on Rough Set Theory and an Improved Genetic Algorithm
Abstract—Because the existing attribute reduction algorithms based on rough set theory and genetic algorithm have the main problems: the complexity in calculating fitness function and slow speed in convergence. An attribute reduction algorithm based on rough set theory and an improved genetic algorithm is proposed in this paper. In order to simplify the calculation of fitness function under the condition of keeping the algorithm correct, the relative importance of chromosome is used to define the fitness function. Beyond that, by introducing the core attributes into the initial population and using an improved mutation operator, the algorithm can not only maintain the feature of whole optimization, but also have a quicker convergence speed. The experimental results show that the algorithm can obtain the optimal attribute reduction set of information system quickly and efficiently.
Index Terms—rough set theory, relative attribute importance, genetic algorithm, relative importance of chromosome
Cite: Lian Chen, Hongling Liu, Zilong Wan, "An Attribute Reduction Algorithm Based on Rough Set Theory and an Improved Genetic Algorithm," Journal of Software vol. 9, no. 9, pp. 2276-2282, 2014.
General Information
ISSN: 1796-217X (Online)
Abbreviated Title: J. Softw.
Frequency: Quarterly
APC: 500USD
DOI: 10.17706/JSW
Editor-in-Chief: Prof. Antanas Verikas
Executive Editor: Ms. Cecilia Xie
Abstracting/ Indexing: DBLP, EBSCO,
CNKI, Google Scholar, ProQuest,
INSPEC(IET), ULRICH's Periodicals
Directory, WorldCat, etcE-mail: jsweditorialoffice@gmail.com
-
Oct 22, 2024 News!
Vol 19, No 3 has been published with online version [Click]
-
Jan 04, 2024 News!
JSW will adopt Article-by-Article Work Flow
-
Apr 01, 2024 News!
Vol 14, No 4- Vol 14, No 12 has been indexed by IET-(Inspec) [Click]
-
Apr 01, 2024 News!
Papers published in JSW Vol 18, No 1- Vol 18, No 6 have been indexed by DBLP [Click]
-
Jun 12, 2024 News!
Vol 19, No 2 has been published with online version [Click]