1068 search results - page 131 / 214 » Extremely randomized trees |
152
Voted
JMLR
2012
13 years 5 months ago
2012
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
117
Voted
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
In this paper we perform an empirical evaluation of supervised learning on highdimensional data. We evaluate performance on three metrics: accuracy, AUC, and squared loss and stud...
107
click to vote
DASFAA
2009
IEEE
15 years 10 months ago
2009
IEEE
We demonstrate the IPL B+ -tree prototype, which has been designed as a flash-aware index structure by adopting the in-page logging (IPL) scheme. The IPL scheme has been proposed ...
106
Voted
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
We establish the exact threshold for the reconstruction problem for a binary asymmetric channel on the b-ary tree, provided that the asymmetry is sufficiently small. This is the ...
100
click to vote
ESANN
2008
15 years 4 months ago
2008
In this paper we solve the problem of classifying chestnut plants according to their place of origin. We compare the results obtained by state of the art classifiers, among which,...