507 search results - page 31 / 102 » Sizes of Ordered Decision Trees |
125
Voted
PRL
2008
15 years 12 days ago
2008
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...
129
click to vote
CVPR
2009
IEEE
16 years 7 months ago
2009
IEEE
Current work in object categorization discriminates
among objects that typically possess gross differences
which are readily apparent. However, many applications
require making ...
119
click to vote
ANTSW
2004
Springer
15 years 5 months ago
2004
Springer
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...
109
Voted
JMLR
2010
14 years 7 months ago
2010
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...
84
Voted
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
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...