A Locally-Biased form of the DIRECT Algorithm.
Joerg M. GablonskyCarl T. KelleyPublished in: J. Glob. Optim. (2001)
Keyphrases
- experimental evaluation
- preprocessing
- computational complexity
- times faster
- learning algorithm
- improved algorithm
- recognition algorithm
- memory requirements
- matching algorithm
- computational cost
- simulated annealing
- np hard
- worst case
- single pass
- theoretical analysis
- segmentation algorithm
- detection algorithm
- experimental study
- classification algorithm
- dynamic programming
- cost function
- similarity measure
- significant improvement
- probabilistic model
- search space
- artificial neural networks
- tree structure
- neural network
- estimation algorithm
- decision trees
- high quality
- convex hull
- data structure
- k means
- optimization algorithm
- hidden markov models
- particle swarm optimization
- high accuracy