Sciweavers

1068 search results - page 131 / 214
» Extremely randomized trees
Sort
View
JMLR
2012
12 years 16 days ago
Low rank continuous-space graphical models
Constructing tractable dependent probability distributions over structured continuous random vectors is a central problem in statistics and machine learning. It has proven diffic...
Carl Smith, Frank Wood, Liam Paninski
ICML
2008
IEEE
14 years 11 months ago
An empirical evaluation of supervised learning in high dimensions
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...
Rich Caruana, Nikolaos Karampatziakis, Ainur Yesse...
DASFAA
2009
IEEE
146views Database» more  DASFAA 2009»
14 years 4 months ago
In-Page Logging B-Tree for Flash Memory
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 ...
Gap-Joo Na, Bongki Moon, Sang-Won Lee
FOCS
2006
IEEE
14 years 4 months ago
The Kesten-Stigum Reconstruction Bound Is Tight for Roughly Symmetric Binary Channels
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 ...
Christian Borgs, Jennifer T. Chayes, Elchanan Moss...
ESANN
2008
13 years 11 months ago
Classification of chestnuts with feature selection by noise resilient classifiers
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,...
Elena Roglia, Rossella Cancelliere, Rosa Meo