| 一种相容矩阵的启发式属性约简算法 |
| |
| 引用本文： | 王帅,徐章艳,谭宗凤,舒文豪.一种相容矩阵的启发式属性约简算法[J].计算机工程与应用,2013,49(1):145-147. |
| |
| 作者姓名： | 王帅 徐章艳 谭宗凤 舒文豪 |
| |
| 作者单位： | 1. 广西师范大学 计算机科学与信息工程学院,广西桂林,541004
2. 广西师范大学 数学科学学院,广西桂林,541004 |
| |
| 基金项目： | 国家自然科学基金，广西自然科学基金 |
| |
| 摘 要： | 针对不完备决策表,黄兵给出一种基于容差关系的相容矩阵的属性约算法,但算法比较费时,其时间复杂度为O(|C|3|U|2)。为降低原算法的时间复杂度,以矩阵距离为启发信息,并运用矩阵合取的特性,设计了一个新的属性约简算法,算法时间复杂度降为O(|C|2|U|2)。通过实例验证了该算法。
|
| 关 键 词： | 不完备决策表 相容矩阵 矩阵距离 属性约简 |
Heuristic attribute reduction based on tolerance matrix |
| |
| WANG Shuai
,
XU Zhangyan
,
TAN Zongfeng
,
SHU Wenhao.Heuristic attribute reduction based on tolerance matrix[J].Computer Engineering and Applications,2013,49(1):145-147. |
| |
| Authors: | WANG Shuai XU Zhangyan TAN Zongfeng SHU Wenhao |
| |
| Affiliation: | 1.School of Computer Science and Information Engineering, Guangxi Normal University, Guilin, Guangxi 541004, China 2.School of Mathematical Sciences, Guangxi Normal University, Guilin, Guangxi 541004, China |
| |
| Abstract: | For an incomplete information decision table, Huang Bing proposed an attribution reduction algorithm using a tolerance matrix based on tolerance relationship. But the algorithm is time-consuming, and the time complexity of this algorithm is O(|C|3|U|2). For cutting down the time complexity of the attribution reduction algorithm, using the matrix distance as heuristic information, with the characteristics of the conjunctive matrix, a new algorithm is designed, the time complexity of the algorithm is reduced to O(|C|2|U|2). Finally, an example is used to illustrate the new algorithm. |
| |
| Keywords: | incomplete decision table tolerance matrix matrix distance attribute reduction |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
