Exact Upper and Lower Bounds on the Misclassification Probability

DOI10.1109/TIT.2019.2891529MaRDI QIDQ5224075zbMATH OpenOpenAlexWikidataFDO

Authors Iosif Pinelis

Publication date 19 July 2019

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1712.00812

Mathematics Subject Classification ID

Inequalities; stochastic orderings (60E15) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Measures of information, entropy (94A17)

Abstract: Exact lower and upper bounds on the best possible misclassification probability for a finite number of classes are obtained in terms of the total variation norms of the differences between the sub-distributions over the classes. These bounds are compared with the exact bounds in terms of the conditional entropy obtained by Feder and Merhav.

Cited in

(4)

• Misclassification minimization
• Classification with guaranteed probability of error
• Graph-Theoretic Concepts in Computer Science
• Estimation of misclassification rate in the Asymptotic Rare and Weak model with sub-Gaussian noises

This page was built for publication: Exact Upper and Lower Bounds on the Misclassification Probability

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