Generalization Bounds for Voting Classifiers Based on Sparsity and Clustering.
Vladimir KoltchinskiiDmitry PanchenkoSavina AndonovaPublished in: COLT (2003)
Keyphrases
- generalization bounds
- linear classifiers
- data dependent
- learning theory
- convex combinations
- generalization ability
- pac bayes
- model selection
- vc dimension
- k means
- ranking algorithm
- statistical learning theory
- learning problems
- learning machines
- majority voting
- support vector
- supervised classification
- learning algorithm
- training data
- ensemble learning
- multi class
- high dimensional
- kernel machines
- decision trees
- training examples
- training set
- support vector machine
- text classification
- training samples
- ensemble methods
- machine learning methods