Concept learning using complexity regularization
DOI10.1109/18.481777zbMATH Open0844.62006OpenAlexW2120337009MaRDI QIDQ4879989FDOQ4879989
Publication date: 1 September 1996
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/18.481777
Recommendations
classificationlearning theoryBayes rulepattern recognitionestimation errorapproximation errorcomplexity regularizationBayes error probabilityinfinite Vapnis Chervonenkis dimension
Statistical aspects of information-theoretic topics (62B10) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)
Cited In (14)
- A penalized criterion for variable selection in classification
- Sampling and empirical risk minimization
- Estimation of the conditional risk in classification: the swapping method
- Efficient distribution-free population learning of simple concepts
- On learning multicategory classification with sample queries.
- Model selection in utility-maximizing binary prediction
- Complexity control in statistical learning
- Parametric version space approach to concept learning
- Multiclass classification with potential function rules: margin distribution and generalization
- Semantic-based regularization for learning and inference
- Adaptive partitioning schemes for bipartite ranking
- Theory of Classification: a Survey of Some Recent Advances
- Model selection by bootstrap penalization for classification
- Title not available (Why is that?)
This page was built for publication: Concept learning using complexity regularization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4879989)
