Mixing times for the Swapping Algorithm on the Blume-Emery-Griffiths model.
Mirko EbbersHolger KnöpfelMatthias LöweFranck VermetPublished in: Random Struct. Algorithms (2014)
Keyphrases
- probabilistic model
- theoretical analysis
- objective function
- cost function
- optimization model
- dynamic programming
- mathematical model
- recognition algorithm
- algorithm employs
- similarity measure
- classification algorithm
- em algorithm
- times faster
- experimental evaluation
- estimation algorithm
- k means
- markov model
- optimal solution
- detection algorithm
- model free
- algorithm has been developed
- input data
- expectation maximization
- learning algorithm
- parameter estimation
- optimization algorithm
- preprocessing
- selection algorithm
- bayesian framework
- neural network
- multiple models
- computational complexity
- prior information
- optimization method
- kalman filter
- computational cost
- tree structure
- probability distribution
- worst case
- mobile robot
- np hard
- hidden markov models
- parametric models
- computational model
- clustering method
- filtering algorithm
- image segmentation
- high accuracy
- particle swarm optimization