Fast Approximate Minimum Spanning Tree Algorithm Based on K-Means.
Caiming ZhongMikko I. MalinenDuoqian MiaoPasi FräntiPublished in: CAIP (1) (2013)
Keyphrases
- k means
- minimum spanning tree
- objective function
- spanning tree
- computational complexity
- np hard
- minimum weight
- expectation maximization
- combinatorial optimization
- graph theory
- similarity measure
- search space
- cost function
- neural network
- probabilistic model
- feature space
- segmentation algorithm
- distance transform
- optimal solution
- bayesian networks