.png){kind=icon}
返回
SVM-Boosting based on Markov resampling: Theory and algorithm
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2020.07.036.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this article we introduce the idea of Markov resampling for Boosting methods. We first prove that Boosting algorithm with general convex loss function based on uniformly ergodic Markov chain (u.e.M.c.) examples is consistent and establish its fast convergence rate. We apply Boosting algorithm based on Markov resampling to Support Vector Machine (SVM), and introduce two new resampling-based Boosting algorithms: SVM-Boosting based on Markov resampling (SVM-BM) and improved SVM-Boosting based on Markov resampling (ISVM-BM). In contrast with SVM-BM, ISVM-BM uses the support vectors to calculate the weights of base classifiers. The numerical studies based on benchmark datasets show that the proposed two resampling-based SVM Boosting algorithms for linear base classifiers have smaller misclassification rates, less total time of sampling and training compared to three classical AdaBoost algorithms: Gentle AdaBoost, Real AdaBoost, Modest AdaBoost. In addition, we compare the proposed SVM-BM algorithm with the widely used and efficient gradient Boosting algorithm-XGBoost (eXtreme Gradient Boosting), SVM-AdaBoost and present some useful discussions on the technical parameters. (C) 2020 Elsevier Ltd. All rights reserved.
Keyword:
Boosting
Consistency
Uniformly ergodic Markov chain (u.e.M.c.)
Resampling
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
8.2K
被引数:
3.0W
机构
引用论文
.png){kind=icon}
分享收藏
Crystal chemistry and metal-hydrogen bonding in anisotropic and interstitial hydrides of intermetallics of rare earth (R) and transition metals (T), RT3 and R2T7稀土 (R) 和过渡金属 (T) 的金属间化合物的各向异性和间隙氢化物中的晶体化学和金属氢键，RT3 和R2T7
PREAI
分享收藏Predictors of Compliance with the Postpartum Visit among Women Living in Healthy Start Project Areas
PREAI
分享收藏分享收藏
查看更多内容