Decision tree model

Known as: Query complexity, Decision tree complexity, Quantum query complexity 
In computational complexity and communication complexity theories the decision tree model is the model of computation or communication in which an… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2013
2013
In the application of microarray data, how to select a small number of informative genes from thousands of genes that may… (More)
  • table 1
  • figure 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We propose a new decision tree algorithm, Class Confidence Proportion Decision Tree (CCPDT), which is robust and insensitive to… (More)
  • table 1
  • figure 1
  • figure 2
  • table 2
  • figure 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
As the most important responsibility of purchasing management, the problem of vendor evaluation and selection has always received… (More)
Is this relevant?
2008
2008
Traditional decision tree algorithms face the problem of having sharp decision boundaries which are hardly found in any real-life… (More)
  • figure 1
  • figure 2
  • table I
  • table III
  • table IV
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The techniques of combining the results of multiple classification models to produce a single prediction have been investigated… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • figure 4
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Speech disfluencies (filled pauses, repe titions, repairs, and false starts) are pervasive in spontaneous speech. The ab ility to… (More)
  • table 1
  • table 4
  • figure 1
  • table 3
  • figure 2
Is this relevant?
Highly Cited
1997
Highly Cited
1997
This paper presents experiments with 19 datasets and 5 decision tree pruning algorithms that show that increasing training set… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
1996
1996
We present an alternative model of human cognitive development on the balance scale task. Study of this task has inspired a wide… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1986
Highly Cited
1986
The Boolean Decision tree model is perhaps the simplest model that computes Boolean functions; it charges only for reading an… (More)
Is this relevant?
Highly Cited
1983
Highly Cited
1983
A topological method is given for obtaining lower bounds for the height of algebraic computation trees, and algebraic decision… (More)
Is this relevant?