Dissecting Graph Measure Performance for Node Clustering in LFR Parameter Space.
Vladimir IvashkinPavel ChebotarevPublished in: COMPLEX NETWORKS (2021)
Keyphrases
- parameter space
- graph structure
- betweenness centrality
- directed graph
- high dimensional
- clustering algorithm
- graph clustering
- graph theoretic
- clustering method
- image space
- parameter values
- proximity measures
- dissimilarity measure
- k means
- graph partitioning
- undirected graph
- graph model
- categorical data
- nodes of a graph
- shortest path
- data points
- search space
- multivariate data
- starting points
- random walk
- normalized cut
- spectral clustering
- finding the shortest path
- overlapping communities
- lie group
- information theoretic
- distance measure
- graph construction
- root node
- directed acyclic graph
- likelihood function
- riemannian manifolds
- data clustering
- graph mining
- probabilistic model
- linear transformations
- data objects
- weighted graph
- social networks