| 一种快速属性核求解算法 |
| |
| 引用本文： | 蒋瑜,王嘉昀. 一种快速属性核求解算法[J]. 计算机工程与应用, 2011, 47(26): 53-54. DOI: 10.3778/j.issn.1002-8331.2011.26.016 |
| |
| 作者姓名： | 蒋瑜 王嘉昀 |
| |
| 作者单位： | 成都信息工程学院 软件工程学院，成都 610225 |
| |
| 摘 要： | 在Rough Set理论中，计算属性核是最重要的计算之一。以桶排序的思想设计了一个新的求解U/C的算法，其时间复杂度被降为O（|C||U|）。基于此，提出了一个新的求核算法，其时间复杂度被降为[O(|C|2|U|)]。通过实验证明了求核算法的高效性。
|
| 关 键 词： | 粗糙集 正区域 属性核 桶排序 |
| 修稿时间： | |
Fast algorithm for computing attribute core |
| |
| JIANG Yu,WANG Jiayun. Fast algorithm for computing attribute core[J]. Computer Engineering and Applications, 2011, 47(26): 53-54. DOI: 10.3778/j.issn.1002-8331.2011.26.016 |
| |
| Authors: | JIANG Yu WANG Jiayun |
| |
| Affiliation: | College of Software Engineering，Chengdu University of Information Technology，Chengdu 610225，China |
| |
| 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. |
| |
| Keywords: | rough set positive region attribute core bucket sort
|
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机工程与应用》浏览原始摘要信息 |
|
点击此处可从《计算机工程与应用》下载免费的PDF全文 |
