A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods

DOI10.1109/TPAMI.1981.4767125MaRDI QIDQ3938375zbMATH OpenWikidataFDO

Authors

Publication date 1981

Published in IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TPAMI.1981.4767125

zbMATH Keywords

connected componentsmaximal complete subgraphsstability boundsstability comparisonsstable classifications

Mathematics Subject Classification ID

Connectivity (05C40) Graph theory (05C99) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited in

(4)

• A stratificational overlapping cluster scheme
• Clustering based on multiple paths
• Graph clustering
• Clustering and community detection in directed networks: a survey

This page was built for publication: A Comparison of the Stability Characteristics of Some Graph Theoretic Clustering Methods

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