Dissecting graph measure performance for node clustering in LFR parameter space
type: Item
instance of: scholarly article
title: Dissecting graph measure performance for node clustering in LFR parameter space
DOI: 10.1007/978-3-030-93409-5_28
author: Vladimir Ivashkin
author: Pavel Chebotarev
publication date: 2022-10-25T00:00:00Z
full work available at URL: https://arxiv.org/abs/2202.09827
Mathematics Subject Classification ID: 62-XX
zbMATH DE Number: 7607283
zbMATH Keywords: graphs
zbMATH Keywords: graph measures
zbMATH Keywords: clustering
zbMATH Keywords: kernel \(k\)-means
describes a project that uses: k-means++
MaRDI profile type: Publication
OpenAlex ID: W4205666543
cites work: Q2934696
cites work: Similarities on graphs: kernels versus proximity measures
cites work: Fast unfolding of communities in large networks
cites work: Modern multidimensional scaling. Theory and applications.
cites work: Q4692391
cites work: Studying New Classes of Graph Metrics
cites work: On a duality between metrics and \(\Sigma\)-proximities
cites work: On proximity measures for graph vertices
cites work: Q5691133
cites work: Randomized shortest paths with net flows and capacity constraints
cites work: Communicability graph and community structures in complex networks
cites work: Accounting for the role of long walks on networks via a new matrix function
cites work: An experimental investigation of kernels on graphs for collaborative recommendation and semisupervised classification
cites work: Random walks on graphs
cites work: Covariance and correlation measures on a graph in a generalized bag-of-paths formalism
cites work: Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?
cites work: A generalized inverse for graphs with absorption
cites work: A new status index derived from sociometric analysis
cites work: Q4649576
cites work: Developments in the theory of randomized shortest paths with a comparison of graph node distances
cites work: Sparse randomized shortest paths routing with Tsallis divergence regularization
cites work: Least squares quantization in PCM
cites work: Q5617409
cites work: An introduction to support vector machines and other kernel-based learning methods.
description: scientific article; zbMATH DE number 7607283