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

DOI10.1080/09720529.2013.867680zbMath1487.68183OpenAlexW2039335835MaRDI QIDQ5069681

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

outliersclusteringEuclidean minimum spanning treesubtreehubscore edge

Mathematics Subject Classification ID

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

Uses Software

• LOF
• clusfind

Cites Work

• Unnamed Item
• Unnamed Item
• Centers of complex networks
• Min and max hierarchical clustering using asymmetric similarity measures
• Detection of outliers and robust estimation using fuzzy clustering
• Finding Groups in Data
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• Foundations of Information and Knowledge Systems

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