Enhancing the Performance of Tree Algorithm Using Re-split Mechanism.
Warakorn SrichavengsupPublished in: ISADS (2015)
Keyphrases
- dynamic programming
- tree structure
- worst case
- k means
- learning algorithm
- optimization algorithm
- high accuracy
- computational cost
- classification trees
- cost function
- preprocessing
- computational complexity
- optimal solution
- objective function
- significant improvement
- experimental evaluation
- path planning
- expectation maximization
- computationally efficient
- clustering method
- ant colony optimization
- improved algorithm
- minimum spanning tree
- classification algorithm
- binary tree
- detection algorithm
- simulated annealing
- scheduling problem
- np hard
- data streams
- image sequences