Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Boosting method for local learning in statistical pattern recognition.

Masanori Kawakita1, Shinto Eguchi

  • 1Department of Computer Science and Communication Engineering, Kyushu University, Fukuoka 819-0395, Japan. kawakita@csce.kyushu-u.ac.jp

Neural Computation
|June 7, 2008
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Area under the curve-optimized synthesis of prediction models from a meta-analytical perspective.

Research synthesis methods·2022
Same author

Generalized quasi-linear mixed-effects model.

Statistical methods in medical research·2022
Same author

Copula-based measures of asymmetry between the lower and upper tail probabilities.

Statistical papers (Berlin, Germany)·2022
Same author

Novel robust time series analysis for long-term and short-term prediction.

Scientific reports·2021
Same author

A Unified Formulation of k-Means, Fuzzy c-Means and Gaussian Mixture Model by the Kolmogorov-Nagumo Average.

Entropy (Basel, Switzerland)·2021
Same author

Quasi-linear Cox proportional hazards model with cross- L<sub>1</sub> penalty.

BMC medical research methodology·2020
Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026
Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026
Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026
Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026
Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026
Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026
See all related articles

Local boosting enhances classification by focusing on local data patterns, offering improved interpretability and performance over traditional methods. This approach proves Bayes risk consistency, balancing estimation and approximation errors effectively.

Area of Science:

  • Machine Learning
  • Statistical Learning Theory
  • Computational Statistics

Background:

  • Boosting algorithms are powerful ensemble methods for classification.
  • Local likelihood methods offer a data-driven approach to modeling.
  • Bayes risk consistency is a key theoretical property for learning algorithms.

Discussion:

  • Local boosting introduces a novel localization technique for computational feasibility in classification.
  • The method is proven to be Bayes risk consistent within the Probably Approximately Correct (PAC) learning framework.
  • Comparing local boosting to ordinary boosting reveals differences in estimation and approximation errors.

Key Insights:

  • Local boosting can achieve comparable or better performance than ordinary boosting, especially when using simple base classifiers like decision stumps.

Related Experiment Videos

  • It offers superior interpretability, clearly indicating informative features and their local contributions to classification rules.
  • The trade-off between estimation and approximation errors can be effectively managed by local boosting.

    • Outlook:

    • Further research can explore advanced base classifiers within the local boosting framework.
    • Applications in diverse fields requiring interpretable classification models are promising.
    • Investigating the scalability of local boosting for large-scale datasets is a potential future direction.