Skip to content

On combining classifiers

Josef Kittler, M. Hatef, Robert P. W. Duin, Jiří Matas

IEEE Transactions on Pattern Analysis and Machine Intelligence · 1998 · 5,401 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Kittler, J., Hatef, M., Duin, R. P. W., & Matas, J. (1998). On combining classifiers. IEEE Transactions on Pattern Analysis and Machine Intelligence, 20(3), 226–239. https://doi.org/10.1109/34.667881

In text: (Kittler et al., 1998)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

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.

  1. Scikit-learn: Machine Learning in Python2012
  2. LIBSVM2011
  3. SMOTE: Synthetic Minority Over-sampling Technique2002
  4. The WEKA data mining software2009
  5. The Elements of Statistical Learning: Data Mining, Inference, and Prediction2010

Metadata from OpenAlex (CC0). Citations are generated from the published record.