Sciweavers

1591 search results - page 252 / 319
» Hybrid decision tree
Sort
View
ICPR
2006
IEEE
14 years 10 months ago
Forest Extension of Error Correcting Output Codes and Boosted Landmarks
In this paper, we introduce a robust novel approach for detecting objects category in cluttered scenes by generating boosted contextual descriptors of landmarks. In particular, ou...
Oriol Pujol, Petia Radeva, Sergio Escalera
ICPR
2004
IEEE
14 years 10 months ago
A Hierarchical Projection Pursuit Clustering Algorithm
We define a cluster to be characterized by regions of high density separated by regions that are sparse. By observing the downward closure property of density, the search for inte...
Alexei D. Miasnikov, Jayson E. Rome, Robert M. Har...
DAC
2005
ACM
14 years 9 months ago
Efficient SAT solving: beyond supercubes
SAT (Boolean satisfiability) has become the primary Boolean reasoning engine for many EDA applications, so the efficiency of SAT solving is of great practical importance. Recently...
Domagoj Babic, Jesse D. Bingham, Alan J. Hu
ICML
2000
IEEE
14 years 9 months ago
A Dynamic Adaptation of AD-trees for Efficient Machine Learning on Large Data Sets
This paper has no novel learning or statistics: it is concerned with making a wide class of preexisting statistics and learning algorithms computationally tractable when faced wit...
Paul Komarek, Andrew W. Moore
ICML
2000
IEEE
14 years 9 months ago
FeatureBoost: A Meta-Learning Algorithm that Improves Model Robustness
Most machine learning algorithms are lazy: they extract from the training set the minimum information needed to predict its labels. Unfortunately, this often leads to models that ...
Joseph O'Sullivan, John Langford, Rich Caruana, Av...