On the Existence of Linear Weak Learners and Applications to Boosting

ISSN： 0885-6125

Source： Machine Learning, Vol.48, Iss.1-3, 2002-07, pp. : 219-251

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

BoostingTree: parallel selection of weak learners in boosting, with application to ranking

By Kocsis Levente György András Bán Andrea

Machine Learning, Vol. 93, Iss. 2-3, 2013-11 ,pp. : 293-320

Springer Publishing Company

Access to resources Recommend Favorite

On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms

By Shalev-Shwartz Shai

Machine Learning, Vol. 80, Iss. 2-3, 2010-09 ,pp. : 141-163

Springer Publishing Company

Access to resources Recommend Favorite

A geometric approach to leveraging weak learners

By Duffy

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 67-108

Elsevier

Access to resources Recommend Favorite

An experimental study on diversity for bagging and boosting with linear classifiers

By Kuncheva L.I. Skurichina M. Duin R.P.W.

Information Fusion, Vol. 3, Iss. 4, 2002-12 ,pp. : 245-258

Elsevier

Access to resources Recommend Favorite

Linear Programming Boosting via Column Generation

By Demiriz A.

Machine Learning, Vol. 46, Iss. 1-3, 2002-01 ,pp. : 225-254

Springer Publishing Company

Access to resources Recommend Favorite