447 search results - page 14 / 90 » Decision trees with minimal costs |
HICSS
2009
IEEE
14 years 3 months ago
2009
IEEE
Privacy preserving data mining has been investigated extensively. The previous works mainly fall into two categories, perturbation and randomization based approaches and secure mu...
IDA
2010
Springer
13 years 10 months ago
2010
Springer
This paper introduces a novel method for obtaining increased predictive performance from transparent models in situations where production input vectors are available when building...
ISCAS
1995
IEEE
14 years 10 days ago
1995
IEEE
In this paper, we present a new clock routing algorithm which minimizes total wirelength under any given path-length skew bound. The algorithm constructs a bounded-skew tree (BST)...
HM
2007
Springer
14 years 2 months ago
2007
Springer
For the NP-hard Optimum Communication Spanning Tree (OCST) problem a cost minimizing spanning tree has to be found, where the cost depends on the communication volume between each ...
PODS
2007
ACM
14 years 9 months ago
2007
ACM
We consider the problem of constructing decision trees for entity identification from a given relational table. The input is a table containing information about a set of entities...