This paper mainly analyses the fault tolerant capability of a combining classifier that uses a K-voting strategy for integrating binary classifiers. From the point view of fault tolerance, we discuss the influence of the failure of binary classifiers on the final output of the combining classifier, and present a theoretical analysis of combination performance under three fault models. The results provide a theoretical base for fault detection of the combining classifier. © Springer-Verlag 2004.
CITATION STYLE
Zhao, H., & Lu, B. L. (2004). Analysis of fault tolerance of a combining classifier. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3173, 888–893. https://doi.org/10.1007/978-3-540-28647-9_146
Mendeley helps you to discover research relevant for your work.