A Near-Optimal Algorithm for Finding an Optimal Shortcut of a Tree.
Eunjin OhHee-Kap AhnPublished in: ISAAC (2016)
Keyphrases
- tree structure
- dynamic programming
- optimal solution
- preprocessing
- detection algorithm
- experimental evaluation
- worst case
- cost function
- computational cost
- binary tree
- globally optimal
- significant improvement
- probabilistic model
- high accuracy
- computational complexity
- binary search trees
- learning algorithm
- recognition algorithm
- computationally efficient
- particle swarm optimization
- neural network
- optimization algorithm
- closed form
- times faster
- exhaustive search
- optimal parameters
- k means
- locally optimal
- optimal or near optimal