Sciweavers

507 search results - page 31 / 102
» Sizes of Ordered Decision Trees
Sort
View
PRL
2008
213views more  PRL 2008»
13 years 7 months ago
Boosting recombined weak classifiers
Boosting is a set of methods for the construction of classifier ensembles. The differential feature of these methods is that they allow to obtain a strong classifier from the comb...
Juan José Rodríguez, Jesús Ma...
CVPR
2009
IEEE
15 years 3 months ago
Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees
Current work in object categorization discriminates among objects that typically possess gross differences which are readily apparent. However, many applications require making ...
Andrew Moldenke, Asako Yamamuro, David A. Lytle, E...
ANTSW
2004
Springer
14 years 1 months ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
JMLR
2010
108views more  JMLR 2010»
13 years 2 months ago
Tree Decomposition for Large-Scale SVM Problems
To handle problems created by large data sets, we propose a method that uses a decision tree to decompose a given data space and train SVMs on the decomposed regions. Although the...
Fu Chang, Chien-Yang Guo, Xiao-Rong Lin, Chi-Jen L...
IPPS
2000
IEEE
14 years 9 days ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen