Incremental Arbiter learning method

被引:0
作者
Zhou, PL [1 ]
机构
[1] Monash Univ, Sch COmp Sci & Software Engn, Melbourne, Vic 3145, Australia
来源
SEVENTH SCANDINAVIAN CONFERENCE ON ARTIFICIAL INTELLIGENCE | 2001年 / 66卷
关键词
machine learning; data mining; incremental learning;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
This paper proposes a new kind of generalization and reduction learning method based on an Arbiter. This is a multi-layer incremental induction algorithm, which is linked to an existing non-incremental induction algorithm to learn incrementally from noisy data. This method is applied to the learning problem under the conditions that 1) the data set is very large, 2) data quality is low, 3) after partition, each subset still meets the requirements of data completeness and information integrity. These conditions would guarantee that learning reliability will not be affected by such data partitioning The method mainly comprises three processing steps, which Arbiter applies to the data set, rule generalization, and reduction of data subsets. The experimental results show that by applying the Arbiter learning from partitioned data in a large scale data set, we are able to sustain the accuracy level of a single classifier trained on the entire data set, and improve some existing non-incremental learning algorithms.
引用
收藏
页码:101 / 107
页数:3
相关论文
共 8 条
  • [1] KODRATOFF Y, 1984, COMPUTER VISION GRAP
  • [2] LANGLEY P, 1996, ELEMENTARY MACHINE L
  • [3] Leung K T, 1992, ELEMENTARY SET THEOR
  • [4] MICHALSKI RS, 1984, ARTIFICIAL INTELLIGE, V20
  • [5] MRUPHY PM, 1995, UCI REPOSITORY MACHI
  • [6] Schlimmer J. C., 1986, Proceedings AAAI-86: Fifth National Conference on Artificial Intelligence, P496
  • [7] TIM N, 1993, KNOWLEDGE REPRESENTA, V14, P345
  • [8] 1990, P 7 INT C MACH LEARN, P49