A `No panacea theorem' for classifier combination

DOI10.1016/J.PATCOG.2008.01.022zbMATH Open1151.68606OpenAlexW2050240670MaRDI QIDQ931702FDOQ931702

Authors: Roland Hu, Robert I. Damper 

Publication date: 26 June 2008

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2008.01.022

Recommendations

• scientific article; zbMATH DE number 1717330
• Structural, Syntactic, and Statistical Pattern Recognition
• scientific article; zbMATH DE number 1304651
• On combining classifiers using sum and product rules
• scientific article; zbMATH DE number 2044165

zbMATH Keywords

Gaussian mixturesprobability density functions`No free lunch' theorems

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Cites Work

• Combining Pattern Classifiers
• Title not available (Why is that?)
• Title not available (Why is that?)
• A `No panacea theorem' for classifier combination

Cited In (2)

• A `No panacea theorem' for classifier combination
• Majority Voting by Independent Classifiers Can Increase Error Rates

This page was built for publication: A `No panacea theorem' for classifier combination

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q931702)