Automatic pattern recognition: a study of the probability of error
From MaRDI portal
consistencysmoothing parametererror estimationprobability of errorasymptotic optimalitytest sequencestatistical pattern recognitionempirical risktraining sequencek-nearest neighbor ruleautomatic parameter selectiondiscrimination rulesDistribution free boundskernel-based rulesVapnik-Chernovenkis inequality
Recommendations
- scientific article; zbMATH DE number 893887
- A general approach to classification problems
- Robustness of decision rules in the presence of errors of classification of the training sample
- scientific article; zbMATH DE number 3862476
- On the posterior-probability estimate of the error rate of nonparametric classification rules
Cited in
(15)- Classification by polynomial surfaces
- Pattern recognition with ordered labels
- Histogram regression estimation using data-dependent partitions
- scientific article; zbMATH DE number 1268806 (Why is no real title available?)
- Classifier selection from a totally bounded class of functions
- Consistency of data-driven histogram methods for density estimation and classification
- Utility-Maximizing Binary Prediction via the Nearest Neighbor Method and Its Application to Credit Scoring
- Decision theoretic generalizations of the PAC model for neural net and other learning applications
- A theory for memory-based learning
- A consistent combined classification rule
- A kernel-based combined classification rule
- An iterated classification rule based on auxiliary pseudo-predictors.
- Sequential pattern recognition procedures derived from multiple Fourier series
- Theory of Classification: a Survey of Some Recent Advances
- A counterexample concerning uniform ergodic theorems for a class of functions
This page was built for publication: Automatic pattern recognition: a study of the probability of error
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3810712)
