On separable clusterings

DOI10.1016/0196-6774(89)90013-8MaRDI QIDQ4730799zbMATH OpenOpenAlexFDO

Authors Hugo Heusinger, Hartmut Noltemeier

Publication date 1989

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

Full work available at URL https://doi.org/10.1016/0196-6774(89)90013-8

zbMATH Keywords

geometrical clusteringVoronoi diagrams

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Analysis of algorithms and problem complexity (68Q25) Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 4074475
• Geometric clusterings
• scientific article; zbMATH DE number 764292
• Optical clustering
• An approach to cluster separability in a partition

Cited in

(11)

• A combinatorial approach to assess the separability of clusters
• On metric clustering
• scientific article; zbMATH DE number 4074475 (Why is no real title available?)
• scientific article; zbMATH DE number 764292 (Why is no real title available?)
• Good clusterings have large volume
• An approach to cluster separability in a partition
• Identifying Clusters from Positive Data
• Grammatical Inference: Algorithms and Applications
• Clustering mixtures with almost optimal separation in polynomial time
• A novel optimization approach towards improving separability of clusters
• Lloyd's clustering method is not 1-separability detecting

This page was built for publication: On separable clusterings

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