| 一种增量式属性约简更新算法 |
| |
| 引用本文： | 罗来鹏. 一种增量式属性约简更新算法[J]. 沈阳大学学报：自然科学版, 2013, 25(3): 246-249 |
| |
| 作者姓名： | 罗来鹏 |
| |
| 作者单位： | 华东交通大学基础科学学院,江西南昌,330013 |
| |
| 基金项目： | 江西省自然科学基金资助项目 |
| |
| 摘 要： | 根据关系矩阵表示与计算方法,提出一种基于二叉树的增量式属性约简更新算法,主要考虑对象动态增加情况下属性约简的更新问题.该算法通过快速更新二叉树,在动态求解核的基础上,通过对二叉树进行剪枝,有效地进行增量式属性约简的更新,并就该方法的有效性进行了理论证明与示例分析.
|
| 关 键 词： | 粗糙集 布尔矩阵 属性约简 增量式更新 |
An Incremental Updating Algorithm for Attribute Reduction |
| |
| Luo Laipeng. An Incremental Updating Algorithm for Attribute Reduction[J]. Journal of Shenyang University, 2013, 25(3): 246-249 |
| |
| Authors: | Luo Laipeng |
| |
| Affiliation: | Luo Laipeng (School of Basic Sciences, East China Jiaotong University, Nanchang 330013, China) |
| |
| Abstract: | According to computation of relation matrix in information system, an incremental updating algorithm for attribute reduction based on binary tree is presented, which is mainly used to solve attribute reduction updating when objects are dynamically increased. Core attributes can be dynamically obtained by updating the binary tree; and attribute reduction can be effectively updated by pruning the binary tree. Theoretical analysis and example show that the algorithm is efficient and feasible. |
| |
| Keywords: | rough set boolean matrix attribute reduction incremental updating |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
