一种新的粗糙集约简算法
首发时间:2008-02-27
摘要:属性约简是粗糙集合研究的核心内容之一,现已证明寻找最小约简是NP-hard问题。本文利用一种新的区分矩阵与免疫遗传算法结合方法,能够实现相容/不相容决策表的属性约简,通过简化区分函数方法求得核属性,有效提高计算速度。并通过实例证明了算法的有效性。
For information in English, please click here
A New Reduction Algorithm Based on Rough Set Theory
Abstract:Attribute reduction is one of the key topics of rough set theory,Search for minimum reduction has been proved to be a NP-hard problem. A new rough set reduction algorithm based on Immune Genetic Algorithm is proposed in this paper. With a new type of discernibility matrix adopted,the algorithm exhibits excellent capabilities in attribute reduction of inconsistent decision table; By simplifying binary discernibility matrix and correspondence computing core algorithm, the computing is improved efficiently. Finally, the validity and feasibility of the algorithm is demonstrated by classical databases.
Keywords: rough set Immune Genetic Algorith discernibility matirx attribute reduction
基金:
论文图表:
引用
No.1887620222912040****
同行评议
共计0人参与
勘误表
一种新的粗糙集约简算法
评论
全部评论0/1000