Boosting the margin: A new explanation for the effectiveness of voting methods
Explore this paper's citation graph
Summary
It is shown that techniques used in the analysis of Vapnik's support vector classifiers and of neural networks with small weights can be applied to voting methods to relate the margin distribution to the test error.
- Type
- article
- Published
- 1997-07-08
- Cited by
- 3,114
- References
- 41
- Access
- Open access
- OpenAlex
- https://openalex.org/W1975846642
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:573509
Keywords
Boosting (machine learning), Mathematics, Voting, Margin (machine learning), Pattern recognition (psychology)
References
- Programs for Machine Learning
- Bias Plus Variance Decomposition for Zero-One Loss Functions
- Improving Regressors using Boosting Techniques
- Using output codes to boost multiclass learning problems
- Classification and regression trees
- Solving Multiclass Learning Problems via Error-Correcting Output Codes
- An Empirical Evaluation of Bagging and Boosting
- On the Density of Families of Sets
- The importance of convexity in learning with squared loss
- A decision-theoretic generalization of on-line learning and an application to boosting
- Improved Boosting Algorithms Using Confidence-rated Predictions
- A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training
- Boosting a weak learning algorithm by majority
- Rates of convex approximation in non-hilbert spaces
- A training algorithm for optimal margin classifiers
- The Strength of Weak Learnability
- A framework for structural risk minimisation
- Game theory, on-line prediction and boosting
- The Sample Complexity of Pattern Classification with Neural Networks: The Size of the Weights is More Important than the Size of the Network
- Boosting in the Limit: Maximizing the Margin of Learned Ensembles
Cited by
- Foundations of Machine Learning
- Support Vector Machine Concept-Dependent Active Learning for Image Retrieval
- On Combining Classifiers for Assessing Portrait Image Compliance with ICAO/ISO Standards
- Pruning and Exclusion Criteria for Unordered Incremental Reduced Error Pruning
- A Simple Algorithm for Learning Stable Machines
- From patterns to pathways: gene expression data analysis comes of age
- Building a cascade detector and its applications in automatic target detection.
- Dynamic classifier ensemble using classification confidence
- Labeling hypergraph-structured data using markov network
- Feature construction from synergic pairs to improve microarray-based classification
- Parallelizing support vector machines for scalable image annotation
- Secession and Survival: Nations, States and Violent Conflict
- A new approach to assess and predict the functional roles of proteins across all known structures
- Moving towards predictive toxicology - a systems biology approach
- An ensemble method using hybrid real-coded genetic algorithm with pruning (HRGA/P R )
- Chagas Parasite Detection in Blood Images Using AdaBoost
- Ensemble Methods for Structured Prediction
- Machine Learning to Predict the Incidence of Retinopathy of Prematurity
- Automatic Metadata Annotation of Images via a Two-Level Learning Framework
- Breakdown Point of Robust Support Vector Machines
Related papers
- Researching on combining boosting ensembles
- A Brief Introduction to Boosting
- Resampling or Reweighting: A Comparison of Boosting Implementations
- When is voting optimal?
- On the Optimality of Decisions
- Measuring majority power and veto power of voting rules
- Decision making with Clustered Majority Judgment
- Novel Bounds on the Probability of Misclassification in Majority Voting: Leveraging the Majority Size