Lower bounds for the rate of convergence in nonparametric pattern recognition.
András AntosPublished in: Theor. Comput. Sci. (2002)
Keyphrases
- lower bound
- pattern recognition
- upper bound
- branch and bound algorithm
- branch and bound
- objective function
- np hard
- signal processing
- machine learning
- image analysis
- image processing
- data driven
- neural network
- lower and upper bounds
- number of iterations required
- lower bounding
- pattern classification
- convergence speed
- randomly generated problems
- pattern recognition problems
- external memory
- set of randomly generated instances
- iterative algorithms
- graph matching
- sample size
- support vector machine svm
- simulated annealing
- search space
- optimal solution
- computer vision