摘要
利用小生境遗传算法在解决多峰最优问题的快速搜索能力,解决了目前用一般的启发式约简方法不能解决的找到粗糙集的多个属性约简的问题.并通过matlab编程,验证了几个典型的决策表约简,试验证明这种方法是正确、可靠的.最后分析了算法的时间复杂性.
Making use of the quickly searching ability of the niche genetic algorithm in solving the multimodal optimal problem,we solved the problem that how to find more optimal reductions of the Rough Sets while it is impossible when using the normal heuristic method.And through verifying some typical decision charts with the matlab program it was proved that the method is correct and credible.In the end of the paper the time complexity of the algorithm was analyzed.
出处
《武汉大学学报（理学版）》
CAS
CSCD
北大核心
2005年第S2期116-120,共5页
Journal of Wuhan University:Natural Science Edition
关键词
粗糙集
遗传算法
数据挖掘
约简
rough sets
genetic algorithm
data mining
reduction
