A Simple Algorithm for Predicting Nearly as Well as the Best Pruning Labeled with the Best Prediction Values of a Decision Tree.
Eiji TakimotoKen'ichi HiraiAkira MaruokaPublished in: ALT (1997)
Keyphrases
- decision trees
- optimization algorithm
- experimental evaluation
- k means
- computational complexity
- objective function
- prediction error
- detection algorithm
- similarity measure
- dynamic programming
- learning algorithm
- tree construction
- prediction algorithm
- prediction accuracy
- computational cost
- cost function
- worst case
- high accuracy
- particle swarm optimization
- segmentation algorithm
- search space
- exhaustive search
- optimal solution
- np hard
- significant improvement
- training data
- matching algorithm
- preprocessing
- decision tree algorithm