摘要
求核算法主要存在以下不足:对不相容决策表无法获得与正区域一致的核,求核算法的效率不够理想。针对上述问题,首先给出决策表的新定义和求核性质,并证明由该性质获得的核与正区域的核是一致的。然后,设计快速求核算法,其时间复杂度和空间复杂度分别降低为O(|C|2|U|)和O(|U|)。最后,实验验证该算法的有效性和高效性。
The algorithms for computing core have the following shortcomings： The core acquired from these algorithms is not the core based on positive region in inconsistence decision table; the efficiency of these algorithms is not ideal.Aiming at these problems, a new definition of decision table and property of computing core are provided.It is proved that the core acquired from the property is equivalent to the core based on positive region.Then,the computing core algorithm is designed, its time complexity and space complexity are cut down O（｜C｜^2｜U｜） and O（｜U｜）.Finally,the experimental results show that the algorithm is effective and efficient. Key words： rough set ;inconsistent decision table ; core attribute ;positive region
出处
《计算机工程与应用》
CSCD
北大核心
2010年第26期138-141,共4页
Computer Engineering and Applications
基金
安徽高校省级自然科学研究项目No.KJ2008B117
No.KJ2010B137
安徽高等学校优秀青年人才基金No.2010SQRL138~~
关键词
粗糙集
不相容决策表
核属性
正区域
rough set
inconsistent decision table
core attribute
positive region
