Online adaptive policies for ensemble classifiers

被引:18
作者
Dimitrakakis, C [1 ]
Bengio, S [1 ]
机构
[1] IDIAP, CH-1920 Martigny, Switzerland
关键词
neural networks; supervised learning; reinforcement learning; ensembles; mixture of experts; boosting; Q-learning;
D O I
10.1016/j.neucom.2004.11.031
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Ensemble algorithms can improve the performance of a given learning algorithm through the combination of multiple base classifiers into an ensemble. In this paper, we attempt to train and combine the base classifiers using an adaptive policy. This policy is learnt through a Q-learning inspired technique. Its effectiveness for an essentially supervised task is demonstrated by experimental results on several UCI benchmark databases. (c) 2005 Elsevier B.V. All rights reserved.
引用
收藏
页码:211 / 221
页数:11
相关论文
共 16 条
[11]  
LU Y, 2002, MACH LEARN, V46, P361
[12]   Improved generalization through explicit optimization of margins [J].
Mason, L ;
Bartlett, PL ;
Baxter, J .
MACHINE LEARNING, 2000, 38 (03) :243-255
[13]   Persuading the persuaders: Presidential speeches and editorial opinion [J].
Schaefer, TM .
POLITICAL COMMUNICATION, 1997, 14 (01) :97-111
[14]  
Sutton R. S., 1998, Reinforcement Learning: An Introduction, V22447
[15]  
TOUSSAINT M, 2002, P INT JOINT C NEUR N
[16]  
WATKINS CJCH, 1992, MACH LEARN, V8, P279, DOI 10.1007/BF00992698