Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2017
Review
2017
This paper surveys quantum learning theory: the theoretical aspects of machine learning using quantum computers. We describe the… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
  • D. Wu
  • Expert Syst. Appl.
  • 2009
  • Corpus ID: 15916037
As the most important responsibility of purchasing management, the problem of vendor evaluation and selection has always received… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Skin diseases are common to children and adults. Many factors influence the onsets of these diseases, and each age group usually… Expand
  • figure 1
  • figure 2
  • table 1
  • table 2
  • table 3
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Based on imbalanced data, the predictive models for 5-year survivability of breast cancer using decision tree are proposed. After… Expand
  • table I
Is this relevant?
2009
2009
We propose an efficient skin region segmentation methodology using low complexity fuzzy decision tree constructed over B, G, R… Expand
  • figure 1
  • figure 2
  • figure 5
  • figure 5
  • figure 3
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity… Expand
  • figure 1
Is this relevant?
Highly Cited
1992
Highly Cited
1992
Every boolean function may be represented as a real polynomial. In this paper we characterize the degree of this polynomial in… Expand
Is this relevant?
Highly Cited
1991
Highly Cited
1991
This work gives apolynomial time algorithm for learning decision trees with respect to the uniform distribution. (This algorithm… Expand
  • figure 2
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… Expand
Is this relevant?
Highly Cited
1981
Highly Cited
1981
In this paper, the red-blue pebble game is proposed to model the input-output complexity of algorithms. Using the pebble game… Expand
  • figure 2-1
  • figure 5-2
  • figure 5-1
Is this relevant?