On combining classifiers
Josef Kittler, M. Hatef, Robert P. W. Duin et al. · IEEE Transactions on Pattern Analysis and Machine Intelligence · 1998
We develop a common theoretical framework for combining classifiers which use distinct pattern representations and show that many existing schemes can be considered as special cases of compound classification where all the pattern representations are used jointly to make a decision. An experimental comparison of various classifier combination schemes demonstrates that the combination rule developed under the most restrictive assumptions-the sum rule-outperforms other classifier combinations schemes. A sensitivity analysis of the various schemes to estimation errors is carried out to show that this finding can be justified theoretically.
Cited by 5,290 works. doi:10.1109/34.667881
Authors
References
- Bagging Predictors
- Experiments with a new boosting algorithm
- Bagging predictors
- Boosting the margin: a new explanation for the effectiveness of voting methods
- Stacked generalization
- Pattern recognition : a statistical approach
- Neural network ensembles
- Boosting the margin: A new explanation for the effectiveness of voting methods
- Methods of combining multiple classifiers and their applications to handwriting recognition
- Random decision forests