Linear clustering process on networks: a comparative study

DOI10.1093/COMNET/CNAE022MaRDI QIDQ6622182zbMATH OpenFDO

Authors Ivan Jokić, Beichen Wang, Piet Van Mieghem

Publication date 22 October 2024

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/COMNET/CNAE022

zbMATH Keywords

spectral clusteringgraph partitioninglinear clustering process

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of graph theory (05C90) Deterministic network models in operations research (90B10)

Recommendations

• Spectral redemption in clustering sparse networks
• Comparison of algorithms in graph partitioning
• A clustering algorithm of a complex network based on a transition matrix P
• Finding community structure in networks using a shortest-path-based k-means algorithm
• Comparing recent methods in graph partitioning

This page was built for publication: Linear clustering process on networks: a comparative study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6622182)