Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?

DOI10.1007/978-3-319-56829-4_8zbMath1380.05186arXiv1605.01046OpenAlexW2561307446MaRDI QIDQ3133361

Vladimir Ivashkin, Pavel Yu. Chebotarev

Publication date: 14 February 2018

Published in: Springer Proceedings in Mathematics & Statistics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Random graphs (graph-theoretic aspects) (05C80) Learning and adaptive systems in artificial intelligence (68T05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Randomized shortest paths with net flows and capacity constraints ⋮ Sparse randomized shortest paths routing with Tsallis divergence regularization ⋮ Similarities on graphs: kernels versus proximity measures ⋮ A simple extension of the bag-of-paths model weighting path lengths by a Poisson distribution ⋮ Dissecting graph measure performance for node clustering in LFR parameter space

This page was built for publication: Do Logarithmic Proximity Measures Outperform Plain Ones in Graph Clustering?