447 search results - page 8 / 90 » Decision trees with minimal costs |
ICML
1994
IEEE
14 years 8 days ago
1994
IEEE
We explore algorithms for learning classification procedures that attempt to minimize the cost of misclassifying examples. First, we consider inductive learning of classification ...
CSDA
2006
13 years 8 months ago
2006
The cost-complexity pruning generates nested subtrees and selects the best one. However, its computational cost is large since it uses holdout sample or cross-validation. On the o...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—In many applications, it is a basic operation for the sink to periodically collect reports from all sensors. Since the data gathering process usually proceeds for many rounds, i...
ESA
2008
Springer
13 years 10 months ago
2008
Springer
Abstract. We study two-stage robust variants of combinatorial optimization problems like Steiner tree, Steiner forest, and uncapacitated facility location. The robust optimization ...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...