Space and Time Efficient Parallel Graph Decomposition, Clustering, and Diameter Approximation.
Matteo CeccarelloAndrea PietracaprinaGeppino PucciEli UpfalPublished in: SPAA (2015)
Keyphrases
- graph theoretic
- efficient computation
- k means
- clustering method
- graph clustering
- directed graph
- graph model
- data points
- vector space
- parallel processing
- equivalence classes
- parallel execution
- laplacian matrix
- random walk
- search algorithm
- search space
- graph construction
- space reduction
- categorical data
- spectral clustering
- error bounds
- cluster analysis
- self organizing maps
- unsupervised learning
- probabilistic model