Scale-sensitive dimensions and skeleton estimates for classification

DOI10.1016/S0166-218X(98)00013-4zbMATH Open0934.62065OpenAlexW1988355994MaRDI QIDQ1265744FDOQ1265744

Authors: Márta Horváth, Gábor Lugosi 

Publication date: 27 April 2000

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(98)00013-4

Recommendations

• Classifier selection from a totally bounded class of functions
• Efficiency of classification methods based on empirical risk minimization
• A general approach to classification problems
• Scale adjustments for classifiers in high-dimensional, low sample size settings
• Local Rademacher complexities

zbMATH Keywords

binary classificationskeletonsempirical riskregression functions

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Cites Work

• Convergence of stochastic processes
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• On the density of families of sets
• Title not available (Why is that?)
• Learnability and the Vapnik-Chervonenkis dimension
• Estimation of dependences based on empirical data. Transl. from the Russian by Samuel Kotz
• Efficient agnostic learning of neural networks with bounded fan-in
• Title not available (Why is that?)
• Function Learning from Interpolation
• Efficient distribution-free learning of probabilistic concepts
• Scale-sensitive dimensions, uniform convergence, and learnability
• Decision theoretic generalizations of the PAC model for neural net and other learning applications
• A result of Vapnik with applications
• Covering numbers for real-valued function classes
• Adaptive model selection using empirical complexities
• Fat-shattering and the learnability of real-valued functions
• Title not available (Why is that?)
• A metric entropy bound is not sufficient for learnability
• Learning by canonical smooth estimation. I. Simultaneous estimation
• Learning by canonical smooth estimation. II. Learning and choice of model complexity

Cited In (1)

• Optimal aggregation of classifiers in statistical learning.

This page was built for publication: Scale-sensitive dimensions and skeleton estimates for classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265744)