Probability of error, equivocation, and the Chernoff bound
From MaRDI portal
Cited in
(19)- On feature extraction in pattern recognition
- Properties and convergence of a posteriori probabilities in classification problems
- Dealing with under-reported variables: an information theoretic solution
- 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
- Spectral feature projections that maximize Shannon mutual information with class labels
- Comparison of relevance learning vector quantization with other metric adaptive classification methods
- Probabilities of discrepancy between minima of cross-validation, Vapnik bounds and true risks
- On the application of probabilistic distance measures for the extraction of features from imperfectly labeled patterns
- Chernoff bounds for discriminating between two markov processes
- A theory of sequence indexing and working memory in recurrent neural networks
- scientific article; zbMATH DE number 3432134 (Why is no real title available?)
- GEOMETRIC PROXIMITY GRAPHS FOR IMPROVING NEAREST NEIGHBOR METHODS IN INSTANCE-BASED LEARNING AND DATA MINING
- A compact local binary pattern using maximization of mutual information for face analysis
- Increasing and decreasing returns and losses in mutual information feature subset selection
- Limits to extreme event forecasting in chaotic systems
- A brief survey on probability distribution approximation
- Bootstrap methods for the empirical study of decision-making and information flows in social systems
This page was built for publication: Probability of error, equivocation, and the Chernoff bound
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5623071)
