Faster learning through a probabilistic approximation algorithm.
John F. KolenPublished in: ICNN (1988)
Keyphrases
- learning algorithm
- probabilistic model
- k means
- times faster
- experimental evaluation
- learning speed
- preprocessing
- expectation maximization
- matching algorithm
- detection algorithm
- optimal solution
- learning process
- optimization algorithm
- learning phase
- theoretical analysis
- objective function
- learning rules
- approximation ratio
- worst case
- dynamic programming
- np hard
- randomized algorithm
- error tolerance
- context free parsing
- highly efficient
- recognition algorithm
- error bounds
- closed form
- generative model
- particle swarm optimization
- computational cost
- cost function
- significant improvement