Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs

DOI10.1080/09720529.2013.867680MaRDI QIDQ5069681zbMATH OpenOpenAlexFDO

Authors S. John Peter

Publication date 19 April 2022

Published in Journal of Discrete Mathematical Sciences and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720529.2013.867680

zbMATH Keywords

clusteringcore edgeEuclidean minimum spanning treehubsoutlierssubtree

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• Centers of complex networks
• Detection of outliers and robust estimation using fuzzy clustering
• Finding Groups in Data
• Foundations of Information and Knowledge Systems
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• scientific article; zbMATH DE number 3684698 (Why is no real title available?)
• scientific article; zbMATH DE number 621792 (Why is no real title available?)
• Min and max hierarchical clustering using asymmetric similarity measures

Cited in

(2)

• Density-equalizing Euclidean minimum spanning trees for the detection of all disease cluster shapes
• An application of the minimal spanning tree approach to the cluster stability problem

Describes a project that uses

Uses Software

• LOF
• clusfind

This page was built for publication: Minimum Spanning Tree-Resembling algorithm for Clusters, Outliers and Hubs

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