Sciweavers

98 search results - page 8 / 20
» Branching on Attribute Values in Decision Tree Generation
Sort
View
DISOPT
2008
81views more  DISOPT 2008»
13 years 8 months ago
Intermediate integer programming representations using value disjunctions
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
Matthias Köppe, Quentin Louveaux, Robert Weis...
CCS
2007
ACM
14 years 2 months ago
Privacy-preserving remote diagnostics
We present an efficient protocol for privacy-preserving evaluation of diagnostic programs, represented as binary decision trees or branching programs. The protocol applies a bran...
Justin Brickell, Donald E. Porter, Vitaly Shmatiko...
ECML
2005
Springer
14 years 2 months ago
Simple Test Strategies for Cost-Sensitive Decision Trees
We study cost-sensitive learning of decision trees that incorporate both test costs and misclassification costs. In particular, we first propose a lazy decision tree learning that ...
Shengli Sheng, Charles X. Ling, Qiang Yang
CIBCB
2009
IEEE
13 years 9 months ago
A framework for the application of decision trees to the analysis of SNPs data
Data mining is the analysis of experimental datasets to extract trends and relationships that can be meaningful for the user. In genetic studies these techniques have revealed inte...
Linda Fiaschi, Jonathan M. Garibaldi, Natalio Kras...
KBS
2002
141views more  KBS 2002»
13 years 8 months ago
Using J-pruning to reduce overfitting in classification trees
The automatic induction of classification rules from examples in the form of a decision tree is an important technique used in data mining. One of the problems encountered is the o...
Max Bramer