Bicriterion Cluster Analysis

DOI10.1109/TPAMI.1980.4767027MaRDI QIDQ3908335zbMATH OpenWikidataFDO

Authors Michel Delattre, Pierre Hansen

Publication date 1980

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.1980.4767027

zbMATH Keywords

dissimilaritydiameterhomogeneityseparationsplitbicriterion cluster analysiscoloration of graphefficient partition

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Graph theory (05C99)

Cited in

(31)

• The weighted sum of split and diameter clustering
• Fuzzy clustering algorithms based on the maximum likelihood principle
• Multiobjective blockmodeling for social network analysis
• Espaliers: A generalization of dendrograms
• Clustering on trees
• A review on declarative approaches for constrained clustering
• Visual attractiveness in vehicle routing via bi-objective optimization
• Cluster analysis and mathematical programming
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
• Maximum sum-of-splits clustering
• Monotone linkage clustering and quasi-concave set functions
• Constrained clustering: current and new trends
• Hierarchical clustering based on ordinal consistency
• Pattern classification problems and fuzzy sets
• A review of multiobjective programming and its application in quantitative psychology
• Clustering based on multiple paths
• The conditional \(p\)-dispersion problem
• Constrained clustering by constraint programming
• Graph theoretical clustering based on limited neighbourhood sets
• Computing sharp bounds for hard clustering problems on trees
• Sequential clustering with radius and split criteria
• A Lagrangian-based score for assessing the quality of pairwise constraints in semi-supervised clustering
• Silhouettes: a graphical aid to the interpretation and validation of cluster analysis
• Minimum sum of diameters clustering
• Comparing clusterings and numbers of clusters by aggregation of calibrated clustering validity indexes
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Set partition by globally optimized cluster seed points
• Clustering heuristics for set covering
• SingleCross-clustering: an algorithm for finding elongated clusters with automatic estimation of outliers and number of clusters

This page was built for publication: Bicriterion Cluster Analysis

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