Probability of error, equivocation, and the Chernoff bound

DOI10.1109/TIT.1970.1054466zbMath0218.62005MaRDI QIDQ5623071

J. Raviv, Martin Edward Hellman

Publication date: 1970

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

Mathematics Subject Classification ID

General considerations in statistical decision theory (62C05)

Related Items (17)

Unnamed Item ⋮ GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING ⋮ Dealing with under-reported variables: an information theoretic solution ⋮ A compact local binary pattern using maximization of mutual information for face analysis ⋮ On the application of probabilistic distance measures for the extraction of features from imperfectly labeled patterns ⋮ Increasing and decreasing returns and losses in mutual information feature subset selection ⋮ A Theory of Sequence Indexing and Working Memory in Recurrent Neural Networks ⋮ Approximate information discriminant analysis: A computationally simple heteroscedastic feature extraction technique ⋮ A fast separability-based feature-selection method for high-dimensional remotely sensed image classification ⋮ Toward a tight upper bound for the error probability of the binary Gaussian classification problem ⋮ On feature extraction in pattern recognition ⋮ Spectral feature projections that maximize Shannon mutual information with class labels ⋮ Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks ⋮ Comparison of relevance learning vector quantization with other metric adaptive classification methods ⋮ Properties and convergence of a posteriori probabilities in classification problems ⋮ Bootstrap methods for the empirical study of decision-making and information flows in social systems ⋮ Chernoff bounds for discriminating between two markov processes

This page was built for publication: Probability of error, equivocation, and the Chernoff bound