A formal proof of the 𝜀-optimality of discretized pursuit algorithms.
Xuan ZhangB. John OommenOle-Christoffer GranmoLei JiaoPublished in: Appl. Intell. (2016)
Keyphrases
- formal proof
- learning algorithm
- computational cost
- image processing
- computational complexity
- recently developed
- orders of magnitude
- exhaustive search
- theoretical analysis
- computationally efficient
- theorem prover
- convergence rate
- classification algorithm
- data mining algorithms
- machine learning
- probabilistic model
- expert systems
- data structure
- bayesian networks
- genetic algorithm