Hearing the clusters of a graph: A distributed algorithm.
Tuhin SahaiAlberto SperanzonAndrzej BanaszukPublished in: Autom. (2012)
Keyphrases
- learning algorithm
- computational complexity
- graph based algorithm
- graph clustering
- graph structure
- particle swarm optimization
- preprocessing
- optimal solution
- k means
- probabilistic model
- distributed systems
- input data
- graph search
- genetic algorithm
- search algorithm
- density based clustering
- clustering algorithm
- weighted graph
- similarity measure
- distributed environment
- matching algorithm
- detection algorithm
- segmentation algorithm
- multi agent
- simulated annealing
- np hard