334 search results - page 39 / 67 » The Alternating Decision Tree Learning Algorithm |
IDA
2007
Springer
15 years 3 months ago
2007
Springer
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...
84
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Many academic journals ask their authors to provide a list of about five to fifteen keywords, to appear on the first page of each article. Since these key words are often phrases ...
ISCI
2008
14 years 9 months ago
2008
In this paper, we introduce weights into Pawlak rough set model to balance the class distribution of a data set and develop a weighted rough set based method to deal with the clas...
ICCV
2001
IEEE
15 years 11 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
77
Voted
ICML
1999
IEEE
15 years 10 months ago
1999
IEEE
Before applying learning algorithms to datasets, practitioners often globally discretize any numeric attributes. If the algorithm cannot handle numeric attributes directly, prior ...