doi: 10.4304//jsw.7.11.2640-2648
An Attribute Reduction Algorithm Based on Genetic Algorithm and Discernibility Matrix
Abstract—In order to effectively solve the problem between genetic algorithm convergence and a local optimal solution, this paper presents an attribute reduction algorithm based on genetic algorithm with improved selection operator and discernibility matrix. In the algorithm, from the point of view of granular computing, rough set decision tables based on partition and covering are researched by measuring granularity again. The practical results show that the average convergence generation of modified algorithm is obviously superior to not modified algorithm, which is generally applicable in rough set decision tables based on partition and covering
Index Terms—rough set, genetic algorithm, discernibility matrix, selection operator, attribute reduction
Cite: Wu Zhengjiang, Zhang Jingmin and Gao Yan, "An Attribute Reduction Algorithm Based on Genetic Algorithm and Discernibility Matrix," Journal of Software vol. 7, no. 11, pp. 2640-2648, 2012.
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]