Sciweavers

1923 search results - page 12 / 385
» Weighted Decision Trees
Sort
View
COMPGEOM
2003
ACM
14 years 29 days ago
Euclidean bounded-degree spanning tree ratios
Let τK be the worst-case (supremum) ratio of the weight of the minimum degree-K spanning tree to the weight of the minimum spanning tree, over all finite point sets in the Eu
Timothy M. Chan
ICDM
2006
IEEE
169views Data Mining» more  ICDM 2006»
14 years 1 months ago
Privacy-Preserving Data Imputation
In this paper, we investigate privacy-preserving data imputation on distributed databases. We present a privacypreserving protocol for filling in missing values using a lazy deci...
Geetha Jagannathan, Rebecca N. Wright
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 7 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
IPL
2002
98views more  IPL 2002»
13 years 7 months ago
Evolutionary induced decision trees for dangerous software modules prediction
We study the possibility of constructing decision trees with evolutionary algorithms in order to increase their predictive accuracy. We present a self-adapting evolutionary algori...
Vili Podgorelec, Peter Kokol
CP
2009
Springer
14 years 8 months ago
Minimising Decision Tree Size as Combinatorial Optimisation
Decision tree induction techniques attempt to find small trees that fit a training set of data. This preference for smaller trees, which provides a learning bias, is often justifie...
Christian Bessiere, Emmanuel Hebrard, Barry O'Sull...