Classifier selection from a totally bounded class of functions
From MaRDI portal
Recommendations
- Classifiers that approximate functions
- Upper-bound estimates for classifiers based on a dissimilarity function
- Classifiers on relatively compact sets
- A unified view of class-selection with probabilistic classifiers
- scientific article; zbMATH DE number 4092814
- A microchoice bound for continuous-space classification algorithms
- On some universal constraints for classification algorithms
Cites work
- scientific article; zbMATH DE number 5654889 (Why is no real title available?)
- scientific article; zbMATH DE number 893887 (Why is no real title available?)
- Automatic pattern recognition: a study of the probability of error
- Combining Classifiers via Discretization
- Consistency of data-driven histogram methods for density estimation and classification
- Convergence of stochastic processes
- Learning by canonical smooth estimation. I. Simultaneous estimation
- Learning by canonical smooth estimation. II. Learning and choice of model complexity
Cited in
(7)- A microchoice bound for continuous-space classification algorithms
- A consistency result for Bayes classifiers with censored response data
- A novel distribution classifier
- A Bayesian classifier
- Classification with minimax fast rates for classes of Bayes rules with sparse representation
- Consistency of logistic classifier in abstract Hilbert spaces
- On the kernel rule for function classification
This page was built for publication: Classifier selection from a totally bounded class of functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951992)
