Sciweavers

1661 search results - page 8 / 333
» Decision Tree Fields
Sort
View
KDD
1995
ACM
140views Data Mining» more  KDD 1995»
15 years 1 months ago
Decision Tree Induction: How Effective is the Greedy Heuristic?
Mostexisting decision tree systemsuse a greedyapproachto inducetrees -- locally optimalsplits are inducedat every node of the tree. Althoughthe greedy approachis suboptimal,it is ...
Sreerama K. Murthy, Steven Salzberg
SIGMOD
1999
ACM
122views Database» more  SIGMOD 1999»
15 years 1 months ago
BOAT-Optimistic Decision Tree Construction
Classification is an important data mining problem. Given a training database of records, each tagged with a class label, the goal of classification is to build a concise model ...
Johannes Gehrke, Venkatesh Ganti, Raghu Ramakrishn...
ICDM
2006
IEEE
169views Data Mining» more  ICDM 2006»
15 years 3 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»
14 years 9 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»
14 years 9 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