| 一种基于粗集理论的增量式学习改进算法 |
| |
| 引用本文： | 韩业红,戴凌霄. 一种基于粗集理论的增量式学习改进算法[J]. 计算机工程与应用, 2007, 43(1): 185-188 |
| |
| 作者姓名： | 韩业红 戴凌霄 |
| |
| 作者单位： | 山东师范大学,管理学院,济南,250014;山东师范大学,管理学院,济南,250014 |
| |
| 摘 要： | 增量式学习中,当向决策表中增加一个新例子时,为了获得极小决策规则集,一般方法是对决策表中的所有数据重新计算。但这种方法显然效率很低,而且也是不必要的。论文从粗集理论出发,提出了一种最小重新计算的标准,并在此基础上,给出了一个增量式学习的改进算法。该算法在一定程度上优于传统的增量式学习算法。
|
| 关 键 词： | 粗集 增量式学习 动态学习 机器学习 |
| 文章编号： | 1002-8331（2007）01-0185-04 |
| 修稿时间： | 2006-04-01 |
Improved algorithm for incremental learning based on rough sets theory |
| |
| HAN Ye-hong,DAI Ling-xiao. Improved algorithm for incremental learning based on rough sets theory[J]. Computer Engineering and Applications, 2007, 43(1): 185-188 |
| |
| Authors: | HAN Ye-hong DAI Ling-xiao |
| |
| Abstract: | In order to compute the minimum set of roles of decision table when a new instance is given into a Knowledge Representation System for incremental learning,all the data in the decision table will be recalculated in the classical method. Clearly,this method is not effective.In this paper,a criteria for the minimal recalculation based on the rough sets theory is given, and an improved algorithm for incremental learning is present.The improved algorithm in this paper is better than the classical method in some sense. |
| |
| Keywords: | rough sets incremental learning dynamic learning machine learning |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
