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

Author： Kuncheva L.I. Skurichina M. Duin R.P.W.

Publisher： Elsevier

ISSN： 1566-2535

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

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

An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging, Boosting, and Randomization

By Dietterich T.G.

Machine Learning, Vol. 40, Iss. 2, 2000-08 ,pp. : 139-157

Springer Publishing Company

Access to resources Recommend Favorite

Combining bagging, boosting, rotation forest and random subspace methods

By Kotsiantis Sotiris

Artificial Intelligence Review, Vol. 35, Iss. 3, 2011-03 ,pp. : 223-240

Springer Publishing Company

Access to resources Recommend Favorite

An Empirical Comparison of Voting Classification Algorithms:Bagging, Boosting, and Variants

By Bauer E.

Machine Learning, Vol. 36, Iss. 1-2, 1999-07 ,pp. : 105-139

Springer Publishing Company

Access to resources Recommend Favorite

On the Existence of Linear Weak Learners and Applications to Boosting

By Mannor S.

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

Springer Publishing Company

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