节点文献

基于并行协同进化的属性约简

Attribute Reduction Based on Parallel Symbiotic Evolution

  • 推荐 CAJ下载
  • PDF下载
  • 不支持迅雷等下载工具,请取消加速工具后下载。

【作者】 王立宏吴耿锋

【Author】 WANG Li-Hong 1),2) WU Geng-Feng 1) 1) ( School of Computer Engineering and Science, Shanghai University,Shanghai 200072) 2) ( School of Computer Engineering and Technology, Yantai University, Yantai 264005)

【机构】 上海大学计算机工程与科学学院上海大学计算机工程与科学学院 上海200072烟台大学计算机工程与技术学院烟台264005上海200072

【摘要】 提出一种求属性集合最小约简的新方法 ,即基于并行协同进化的属性约简方法 .该方法将并行遗传算法和协同进化算法相结合 ,能有效地处理具有大量属性的信息系统 .对各类实验数据的测试表明 ,该方法得到的属性约简量与基于属性重要性的约简方法相似 ,在某些情况下求得最小约简的可能性要高于属性重要性方法 .

【Abstract】 A new approach to attribute reduction based on parallel symbiotic evolution is proposed. Combining parallel genetic algorithm with symbiotic evolution, this approach can make efficient reduction for an information system with a large number of attributes. In symbiotic evolution, a (full) solution to an optimal problem will be divided into several partial solutions that constitute a population, which is going to evolve to find the optimal solution for each partial solution. Due to the diversity of optimal patterns for partial solutions, the population can maintain diversity and the optimal solutions will be found more promisingly. However, the position information of partial solutions in a full solution does not be used in symbiotic evolution and then an optimal pattern for one position may be settled in another place. The abuse of these optimal patterns leads to a lower fitness value and then threatens the survival of them. Considering the position information as well as the population diversity, this paper proposes an algorithm named Parallel Symbiotic Evolution Algorithm (PSEA). In order to get the minimal attribute reduction, authors encode the attribute subsets into binary strings, cut them into several sections and create a population for each section position. These populations experience evolution in a parallel way, exchanging patterns by the elitist strategy. The experiment tests seven kinds of discernibility matrices and shows that the minimal attribute reduction can be found in some cases with a higher probability than that of other approaches.

【基金】 国家自然科学基金 (69985 0 0 4,60 2 75 0 2 2 );上海市科委基础研究项目(0 1JC14 0 2 2 )资助
  • 【文献出处】 计算机学报 ,Chinese Journal of Computers , 编辑部邮箱 ,2003年05期
  • 【分类号】TP18
  • 【被引频次】61
  • 【下载频次】366
节点文献中: 

本文链接的文献网络图示:

本文的引文网络