一种粗糙集属性约简的伪粒子群算法  

CHENG Bing.Pseudo particle swarm algorithm for rough sets attribute reduction

作　　者：范会联[1] 仲元昌[2] 程冰[1] 

机构地区：[1]长江师范学院数学与计算机学院,重庆408100 [2]重庆大学通信工程学院,重庆400030

出　　处：《计算机工程与应用》2012年第1期150-152,169,共4页Computer Engineering and Applications

基　　金：科技部创新基金项目(No.10C26215115008);重庆市科技攻关项目(CSTC;No.2010AC3110)

摘　　要：针对高维数据集的属性约简问题,通过改变经典粒子群算法的运动方程,并用属性依赖性和属性子集特征数构造适应度函数,提出以决策表核属性为基础的最小属性子集搜寻策略。实验结果表明,与其他类型的最小属性约简算法相比,该算法不仅能有效提高获得最小属性约简的机率,同时还大大降低了计算时间。In order to solve the problem of calculating the attribute reduction of high-dimensional data set, a new pseudo particle swarm based on updating the motion equation of particle swarm is proposed, and dependency of the attributes, feature number of the subset of attributions are added into fitness function. Experimental results show that the proposed algorithm can get better results than some other existing algorithms for attribute reduction in terms of both solution quality and computational effort.

关 键 词：粗糙集 属性约简 核属性 粒子群 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]