Dissecting graph measure performance for node clustering in LFR parameter space.
Vladimir IvashkinPavel ChebotarevPublished in: CoRR (2022)
Keyphrases
- parameter space
- directed graph
- betweenness centrality
- graph structure
- graph theoretic
- clustering method
- graph clustering
- image space
- clustering algorithm
- high dimensional
- graph model
- k means
- similarity measure
- parameter values
- proximity measures
- starting points
- random walk
- graph partitioning
- dissimilarity measure
- nodes of a graph
- finding the shortest path
- hough space
- undirected graph
- weighted graph
- categorical data
- graph theory
- complex networks
- overlapping communities
- spectral clustering
- shortest path
- cluster analysis
- data clustering
- multivariate data
- tree structure
- path length
- search space
- riemannian manifolds
- information theoretic
- likelihood function
- edge weights
- root node
- low dimensional
- similarity function
- optimal solution
- high dimensional data