Clustering with minimum spanning trees: how good can it be?

DOI10.1007/S00357-024-09483-1MaRDI QIDQ6994987zbMATH OpenFDO

Authors Marek Gągolewski, Anna Cena, MacIej Bartoszuk, Łukasz Brzozowski

Publication date 22 April 2025

Published in Journal of Classification (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

MSTminimum spanning treemutual informationsingle linkagecluster validity measureGenie algorithmhierarchical partitional clustering

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

This page was built for publication: Clustering with minimum spanning trees: how good can it be?

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