SVM-boosting based on Markov resampling: theory and algorithm

DOI10.1016/j.neunet.2020.07.036zbMath1480.62024OpenAlexW3048868447WikidataQ98658431 ScholiaQ98658431MaRDI QIDQ2057733

Chen Xu, Yuan Yan Tang, Bin Zou, Hongwei Jiang, Jie Xu

Publication date: 7 December 2021

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2020.07.036

zbMATH Keywords

consistencyresamplingboostinguniformly ergodic Markov chain

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Nonparametric statistical resampling methods (62G09) Learning and adaptive systems in artificial intelligence (68T05) Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20)

Related Items (1)

Generalization ability of online pairwise support vector machine

Uses Software

• AdaBoost.MH
• bootstrap
• XGBoost

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bagging predictors
• A decision-theoretic generalization of on-line learning and an application to boosting
• Arcing classifiers. (With discussion)
• Additive logistic regression: a statistical view of boosting. (With discussion and a rejoinder by the authors)
• On weak base hypotheses and their implications for boosting regression and classification
• Learning and generalisation. With applications to neural networks.
• Best choices for regularization parameters in learning theory: on the bias-variance problem.
• Process consistency for AdaBoost.
• On the Bayes-risk consistency of regularized boosting methods.
• Statistical behavior and consistency of classification methods based on convex risk minimization.
• Boosting a weak learning algorithm by majority
• Weak convergence and empirical processes. With applications to statistics
• Regularization networks and support vector machines
• Improved boosting algorithms using confidence-rated predictions
• Learning rates of least-square regularized regression
• Boosting with early stopping: convergence and consistency
• The Generalization Ability of Online Algorithms for Dependent Data
• Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
• Convexity, Classification, and Risk Bounds
• Theory of Reproducing Kernels

This page was built for publication: SVM-boosting based on Markov resampling: theory and algorithm