摘要
在RoughSet理论中,计算属性核是最重要的计算之一。以桶排序的思想设计了一个新的求解U/C的算法,其时间复杂度被降为O(|C||U|)。基于此,提出了一个新的求核算法,其时间复杂度被降为O(|C|2|U|)。通过实验证明了求核算法的高效性。
Computing core is one of the most important computation in rough set.A new algorithm used bucket sort for computing U/C is provided,it＇s complexity is cut down to O（｜C｜｜U｜）,and a new algorithm for computing core is provided.The time complexity of the algorithm in the worst case is analyzed and its temporal complexity is O（｜C｜2｜U｜）.The efficiency of the algorithms is proved by the experiments.
出处
《计算机工程与应用》
CSCD
北大核心
2011年第26期53-54,61,共3页
Computer Engineering and Applications
关键词
粗糙集
正区域
属性核
桶排序
rough set
positive region
attribute core
bucket sort
