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

DOI10.1137/0605048MaRDI QIDQ3223718zbMATH OpenOpenAlexFDO

Authors 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

diameter functionhomogeneity of subsetsminimal dominating clustering functionsminimal dominating hierarchiesoverlapping criteriaultrametric

Mathematics Subject Classification ID

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

Recommendations

• Some Aspects of Clustering Functions
• scientific article; zbMATH DE number 3930160
• An order theoretic framework for overlapping clustering
• Fixed points approach to clustering
• NP-hard approximation problems in overlapping clustering.

Cites work

• A set-theoretical approach to the problem of hierarchical clustering
• An Order Theoretic Model for Cluster Analysis
• Graphs Implied by the Jardine-Sibson Overlapping Clustering Methods, B k
• scientific article; zbMATH DE number 3470465 (Why is no real title available?)
• scientific article; zbMATH DE number 3504320 (Why is no real title available?)
• scientific article; zbMATH DE number 3439834 (Why is no real title available?)
• Some applications of graph theory to clustering
• Some Aspects of Clustering Functions

Cited in

(3)

• Function approximation with polynomial membership functions and alternating cluster estimation
• Some aspects of qualitative data analysis
• Dissimilarity coefficients which are independent of a special set of data

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

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