A fast and efficient algorithm to identify clusters in networks.
Francesc ComellasAlicia MirallesPublished in: Appl. Math. Comput. (2010)
Keyphrases
- dynamic programming
- high accuracy
- experimental evaluation
- computationally efficient
- single pass
- high efficiency
- computational complexity
- hierarchical clustering
- matching algorithm
- detection algorithm
- segmentation algorithm
- learning algorithm
- cost function
- significant improvement
- k means
- preprocessing
- optimization algorithm
- times faster
- subspace clustering
- cluster centers
- pruning strategy
- density based clustering
- simulated annealing
- convergence rate
- worst case
- probabilistic model
- search space
- search algorithm
- objective function
- image sequences