Graph Node Clustering via Transitive Node Similarity.
Eleftherios TiakasApostolos N. PapadopoulosYannis ManolopoulosPublished in: Panhellenic Conference on Informatics (2010)
Keyphrases
- graph structure
- directed graph
- normalized cut
- similarity function
- graph clustering
- graph theoretic
- clustering algorithm
- tree structure
- clustering method
- spectral clustering
- distance measure
- dissimilarity measure
- root node
- similarity calculation
- overlapping communities
- finding the shortest path
- nodes of a graph
- similarity matrix
- high dimensional data
- random walk
- k means
- similarity measure