Sciweavers

134 search results - page 11 / 27
» Ensembles of Grafted Trees
Sort
View
IDA
2007
Springer
14 years 1 months ago
Combining Bagging and Random Subspaces to Create Better Ensembles
Random forests are one of the best performing methods for constructing ensembles. They derive their strength from two aspects: using random subsamples of the training data (as in b...
Pance Panov, Saso Dzeroski
ICDM
2005
IEEE
122views Data Mining» more  ICDM 2005»
14 years 1 months ago
Learning through Changes: An Empirical Study of Dynamic Behaviors of Probability Estimation Trees
In practice, learning from data is often hampered by the limited training examples. In this paper, as the size of training data varies, we empirically investigate several probabil...
Kun Zhang, Zujia Xu, Jing Peng, Bill P. Buckles
IEEEIAS
2008
IEEE
14 years 2 months ago
Ensemble of One-Class Classifiers for Network Intrusion Detection System
To achieve high accuracy while lowering false alarm rates are major challenges in designing an intrusion detection system. In addressing this issue, this paper proposes an ensembl...
Anazida Zainal, Mohd Aizaini Maarof, Siti Mariyam ...
JAIR
2008
93views more  JAIR 2008»
13 years 7 months ago
Spectrum of Variable-Random Trees
In this paper, we show that a continuous spectrum of randomisation exists, in which most existing tree randomisations are only operating around the two ends of the spectrum. That ...
Fei Tony Liu, Kai Ming Ting, Yang Yu, Zhi-Hua Zhou
MCS
2004
Springer
14 years 29 days ago
A Comparison of Ensemble Creation Techniques
We experimentally evaluate bagging and six other randomization-based approaches to creating an ensemble of decision-tree classifiers. Bagging uses randomization to create multipl...
Robert E. Banfield, Lawrence O. Hall, Kevin W. Bow...