The combination of multiple classifiers using an evidential reasoning approach

被引:86
作者
Bi, Yaxin [1 ]
Guan, Jiwen [2 ]
Bell, David [2 ]
机构
[1] Univ Ulster, Sch Comp & Math, Jordanstown BT37 0QB, Antrim, North Ireland
[2] Queens Univ Belfast, Sch Comp Sci, Belfast BT7 1NN, Antrim, North Ireland
关键词
Ensemble methods; Dempster's rule of combination; Evidential reasoning; Evidential structures; Combination functions;
D O I
10.1016/j.artint.2008.06.002
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In many domains when we have several competing classifiers available we want to synthesize them or some of them to get a more accurate classifier by a combination function. in this paper we propose a 'class-indifferent' method for combining classifier decisions represented by evidential structures called triplet and quartet, using Dempster's rule of combination. This method is unique in that it distinguishes important elements from the trivial ones in representing classifier decisions, makes use of more information than others in calculating the support for class labels and provides a practical way to apply the theoretically appealing Dempster-Shafer theory of evidence to the problem of ensemble learning. We present a formalism for modelling classifier decisions as triplet mass functions and we establish a range of formulae for combining these mass functions in order to arrive at a consensus decision. In addition we carry out a comparative study with the alternatives of simplet and dichotomous structure and also compare two combination methods, Dempster's rule and majority voting, over the UCI benchmark data, to demonstrate the advantage our approach offers. (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:1731 / 1751
页数:21
相关论文
共 57 条
[1]   A new technique for combining multiple classifiers using the Dempster-Shafer theory of evidence [J].
Al-Ani, M ;
Deriche, M .
JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2002, 17 :333-361
[2]  
[Anonymous], UCI REPOSITORY MACHI
[3]  
[Anonymous], EVIDENCE THEORY ITS
[4]  
Barnett J.A., 1981, P 7 INT JOINT C ART, P868
[5]   On combining classifier mass functions for text categorization [J].
Bell, DA ;
Guan, JW ;
Bi, YX .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (10) :1307-1319
[6]  
BI Y, 2006, P 21 NAT C ART INT A, P324
[7]  
BI Y, 2006, P 22 C UNC ART INT, P31
[8]  
BI Y, 2004, THESIS U ULSTER UK
[9]  
Bi YX, 2004, LECT NOTES ARTIF INT, V3215, P521
[10]   Random forests [J].
Breiman, L .
MACHINE LEARNING, 2001, 45 (01) :5-32