Sciweavers

134 search results - page 15 / 27
» Ensembles of Grafted Trees
Sort
View
MCS
2007
Springer
14 years 1 months ago
An Experimental Study on Rotation Forest Ensembles
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
Ludmila I. Kuncheva, Juan José Rodrí...
CIDM
2009
IEEE
14 years 2 months ago
An empirical study of bagging and boosting ensembles for identifying faulty classes in object-oriented software
—  Identifying faulty classes in object-oriented software is one of the important software quality assurance activities. This paper empirically investigates the application of t...
Hamoud I. Aljamaan, Mahmoud O. Elish
ICDM
2003
IEEE
181views Data Mining» more  ICDM 2003»
14 years 27 days ago
Dynamic Weighted Majority: A New Ensemble Method for Tracking Concept Drift
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted Majority algorithm for using any online learner for co...
Jeremy Z. Kolter, Marcus A. Maloof
PRL
2008
213views more  PRL 2008»
13 years 7 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
DM
1998
91views more  DM 1998»
13 years 7 months ago
On some relations between 2-trees and tree metrics
A tree function (TF) t on a ÿnite set X is a real function on the set of the pairs of elements of X satisfying the four-point condition: for all distinct x; y; z; w ∈ X; t(xy)+...
Bruno Leclerc, Vladimir Makarenkov