A framework for the analysis of majority voting

DOI10.1007/3-540-45103-X_37MaRDI QIDQ4448029zbMATH OpenFDO

Authors Anand M. Narasimhamurthy

Publication date 17 February 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2749/27490268.htm

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Machine vision and scene understanding (68T45) Computing methodologies and applications (68U99)

Recommendations

• On the relationship between majority vote accuracy and dependency in multiple classifier systems
• Limits on the majority vote accuracy in classifier fusion
• Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
• Generating classifier outputs with fixed diversity for evaluating voting methods
• An asymptotic analysis of some expert fusion methods

Cited in

(6)

• Optimizing majority voting based systems under a resource constraint for multiclass problems
• Relationship of sum and vote fusion strategies
• On the relationship between majority vote accuracy and dependency in multiple classifier systems
• Analysis of the voting method used in the European Central Bank
• Risk bounds for the majority vote: from a PAC-Bayesian analysis to a learning algorithm
• Local event boundary detection with unreliable sensors: analysis of the majority vote scheme

This page was built for publication: A framework for the analysis of majority voting

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