Validity of clusters formed by graph-theoretic cluster methods

DOI10.1016/0025-5564(77)90053-0zbMath0392.05060OpenAlexW1995176020MaRDI QIDQ1251676

William H. E. Day

Publication date: 1977

Published in: Mathematical Biosciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0025-5564(77)90053-0

zbMATH Keywords

ChainingChainsFlat Cluster MethodsGraph-Theoretic Cluster MethodsLoopless Undirected GraphOverlap Between ClustersSingle-Linkage ClusteringValidity of Clusters

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorial aspects of partitions of integers (05A17) Graph theory (05C99)

Related Items

Compatibility in a graph-theoretic setting ⋮ Validity studies in clustering methodologies ⋮ Clusteranalyse - Überblick und neuere Entwicklungen ⋮ The complexity of computing metric distances between partitions ⋮ Classification and specification of flat cluster methods

Uses Software

• Algorithm 447

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of graph theory to clustering
• A model for taxonomy. II
• Network Flow and Testing Graph Connectivity
• The Construction of Hierarchic and Non-Hierarchic Classifications
• k-Components, Clusters and Slicings in Graphs
• On the theory and construction of k-clusters
• Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters
• THE MAXIMUM CONNECTIVITY OF A GRAPH
• Sur la liaison et la division des points d'un ensemble fini
• On cliques in graphs