摘要
研究了不完备信息系统下的属性约简,基于相容关系提出一种遗传算法的分配约简算法,算法编码采用了二进制一维编码形式,比较适合地表达了遗传算子.为了加快算法的收敛,在适应值函数中引入了惩罚函数,可以保证所求约简既含较少属性又有较强支持度.在交叉规则中,采用了单点交叉,最大迭代代数被作为停止准则,算法获得较佳的搜索效果.通过实例分析,可以证明该算法是求解知识约简问题的快速有效方法.
Studying the attribute reduction in incomplete information systems, a GA-based algorithm is proposed to reduce assignment with the compatibility relation taken into account. The one-dimensional binary code is used to encode the algorithm because it is suitable to express genetic operators. Penalty function is introduced in the adaptive value function to speed up the convergence of the algorithm and ensure that the assignment reduction includes fewer attributes with stronger support. In addition, the single-point crossing is used as the rule with a given MaxGen iterative solution taken as termination criterion, thus providing a good searching result. An exemplifying analysis shows that the algorithm proposed is quick and effective in solving the problems of reducing knowledge.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2007年第1期19-22,共4页
Journal of Northeastern University(Natural Science)
基金
国家自然科学基金资助项目(70471028)
沈阳市自然科学基金资助项目(1041006-1-03-05)
关键词
粗糙集
不完备信息系统
属性约简
分配约简
遗传算法
rough set
incomplete information system
attribute reduction
assignment reduction
genetic algorithm
