Computer Engineering and Applications ›› 2011, Vol. 47 ›› Issue (26): 53-54.
• 研究、探讨 • Previous Articles Next Articles
JIANG Yu,WANG Jiayun
Received:
Revised:
Online:
Published:
蒋 瑜,王嘉昀
Abstract: 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.
Key words: rough set, positive region, attribute core, bucket sort
摘要: 在Rough Set理论中,计算属性核是最重要的计算之一。以桶排序的思想设计了一个新的求解U/C的算法,其时间复杂度被降为O(|C||U|)。基于此,提出了一个新的求核算法,其时间复杂度被降为[O(|C|2|U|)]。通过实验证明了求核算法的高效性。
关键词: 粗糙集, 正区域, 属性核, 桶排序
JIANG Yu,WANG Jiayun. Fast algorithm for computing attribute core[J]. Computer Engineering and Applications, 2011, 47(26): 53-54.
蒋 瑜,王嘉昀. 一种快速属性核求解算法[J]. 计算机工程与应用, 2011, 47(26): 53-54.
0 / Recommend
Add to citation manager EndNote|Ris|BibTeX
URL: http://cea.ceaj.org/EN/
http://cea.ceaj.org/EN/Y2011/V47/I26/53