The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria

DOI10.1137/0605048zbMath0558.62053OpenAlexW2084815663MaRDI QIDQ3223718

Gerhard Herden

Publication date: 1984

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0605048

zbMATH Keywords

ultrametricdiameter functionhomogeneity of subsetsminimal dominating clustering functionsminimal dominating hierarchiesoverlapping criteria

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Related Items (2)

Dissimilarity coefficients which are independent of a special set of data ⋮ Some aspects of qualitative data analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some applications of graph theory to clustering
• A set-theoretical approach to the problem of hierarchical clustering
• Some Aspects of Clustering Functions
• Graphs Implied by the Jardine-Sibson Overlapping Clustering Methods, B k
• An Order Theoretic Model for Cluster Analysis

This page was built for publication: The Approximation of Arbitrary Clustering Functions by Clustering Functions which Satisfy Overlapping Criteria