Rough Set Knowledge Reduction Approach Based on Improving Genetic Algorithm

被引：0

作者：

Yan Feng ^{[1
,2
]}

Gui Weihua ^{[1
]}

Chen Yong ^{[1
]}

Xie Yongfang ^{[1
]}

Ren Huifeng ^{[1
]}

机构：

[1] Cent South Univ, Sch Informat Sci & Engn, Changsha 410083, Hunan, Peoples R China

[2] Changsha Engn & Res Inst Ltd Nonferrous Met, CHALIECO, Changsha 410011, Hunan, Peoples R China

来源：

PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE | 2012年

关键词：

Rough Set; Genetic Algorithm; Support Degree; Importance Degree; dissimilarity Degree;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, a kind of rough set knowledge reduction algorithm based on improving genetic algorithm is proposed by analyzing rough sets reduction. Support degree and importance degree of condition attribute on decision attribute in information system are as heuristic information in Genetic Algorithm. On the basic of that, the GA was improved by population and individual dissimilarity degree in order to enhanced system global optimization and accelerate the convergence rate. The Practical results show that the approach is time-saving and effective for solving knowledge reduction.

引用

页码：1967 / 1971

页数：5

共 6 条

[1] Mining knowledge rules from databases: A rough set approach
Hu, XH
Cercone, N
[J]. PROCEEDINGS OF THE TWELFTH INTERNATIONAL CONFERENCE ON DATA ENGINEERING, 1996, : 96 - 105
[2] ROUGH SETS
PAWLAK, Z
[J]. INTERNATIONAL JOURNAL OF COMPUTER & INFORMATION SCIENCES, 1982, 11 (05): : 341 - 356
[3] Rough set theory and its applications to data analysis
Pawlak, Z
[J]. CYBERNETICS AND SYSTEMS, 1998, 29 (07) : 661 - 688
[4] Pawlak Z., 1991, Theoretical Aspects of Reasoning About Data, Rough sets, DOI [10.1007/978-94-011-3534-4, DOI 10.1007/978-94-011-3534-4]
[5] CONVERGENCE ANALYSIS OF CANONICAL GENETIC ALGORITHMS
RUDOLPH, G
[J]. IEEE TRANSACTIONS ON NEURAL NETWORKS, 1994, 5 (01): : 96 - 101
[6] Analysis on attribute reduction strategies of rough set
Jue Wang
Duoqian Miao
[J]. Journal of Computer Science and Technology, 1998, 13 (2) : 189 - 192

← 1 →