在Rough Set理论中,计算属性核是最重要的计算之一.以桶排序的思想设计了一个新的求解U/C的算法,其时间复杂度被降为O(|C||U|).基于此,提出了一个新的求核算法,其时间复杂度被降为O(|C|2U|).通过实验证明了求核算法的高效性.%Computing core is one of the most important computation in rough set.A new algorithm used bucket sort for computing UIC 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.
展开▼
