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

Author： Dietterich T.G.

Publisher： Springer Publishing Company

ISSN： 0885-6125

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

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 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

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 a method for constructing ensembles of regression models

By Burnaev E. Prikhod’ko P.

Automation and Remote Control, Vol. 74, Iss. 10, 2013-10 ,pp. : 1630-1644

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

Boosting Methods for Regression

By Duffy N.

Machine Learning, Vol. 47, Iss. 2-3, 2002-05 ,pp. : 153-200

Springer Publishing Company

Access to resources Recommend Favorite