Good parts first - a new algorithm for approximate search in lexica and string databases
Stefan GerdjikovStoyan MihovPetar MitankinKlaus U. SchulzPublished in: CoRR (2013)
Keyphrases
- databases
- experimental evaluation
- cost function
- dynamic programming
- times faster
- k means
- computational complexity
- computational cost
- worst case
- matching algorithm
- improved algorithm
- learning algorithm
- computationally efficient
- segmentation algorithm
- optimization algorithm
- tree structure
- probabilistic model
- string matching
- significant improvement
- optimal solution
- objective function
- np hard
- detection algorithm
- neural network
- feature selection
- convex hull
- decision trees
- path planning
- image segmentation
- database systems
- shortest path
- similarity measure
- particle swarm optimization
- simulated annealing
- motion estimation