On Paths in Search or Decision Trees Which Require Almost Worst-Case Time.
Ulrich HuckenbeckPublished in: WG (1988)
Keyphrases
- decision trees
- worst case
- search algorithm
- search strategy
- search efficiency
- search methods
- upper bound
- greedy algorithm
- machine learning
- lower bound
- average case
- predictive accuracy
- decision tree induction
- search queries
- shortest path
- search space
- decision rules
- search strategies
- naive bayes
- information retrieval systems
- digital libraries
- neural network