Dissecting graph measure performance for node clustering in LFR parameter space

DOI10.1007/978-3-030-93409-5_28OpenAlexW4205666543MaRDI QIDQ2086607

Vladimir Ivashkin, Pavel Yu. Chebotarev

Publication date: 25 October 2022

Full work available at URL: https://arxiv.org/abs/2202.09827

zbMATH Keywords

clusteringgraphsgraph measureskernel \(k\)-means

Mathematics Subject Classification ID

Statistics (62-XX)

Uses Software

• k-means++

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
• Accounting for the role of long walks on networks via a new matrix function
• Communicability graph and community structures in complex networks
• Random walks on graphs
• A generalized inverse for graphs with absorption
• Developments in the theory of randomized shortest paths with a comparison of graph node distances
• On proximity measures for graph vertices
• On a duality between metrics and \(\Sigma\)-proximities
• Sparse randomized shortest paths routing with Tsallis divergence regularization
• Randomized shortest paths with net flows and capacity constraints
• Similarities on graphs: kernels versus proximity measures
• Modern multidimensional scaling. Theory and applications.
• A new status index derived from sociometric analysis
• Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?
• Least squares quantization in PCM
• Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
• Fast unfolding of communities in large networks
• Studying New Classes of Graph Metrics

This page was built for publication: Dissecting graph measure performance for node clustering in LFR parameter space