Clique optimization: A method to construct parsimonious ultrametric trees from similarity data

DOI10.1007/BF01889702zbMath0711.62053MaRDI QIDQ923556

N. Sriram

Publication date: 1990

Published in: Journal of Classification (Search for Journal in Brave)

zbMATH Keywords

algorithmNP-completeheuristic searchhierarchical classificationgraph clusteringClique optimizationCLOPThierarchy of nested partitionsordered sequence of clique setssimilarity data

Mathematics Subject Classification ID

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

Related Items (5)

Compatibility in a graph-theoretic setting ⋮ A survey of constrained classification ⋮ Hierarchical means clustering ⋮ Fitting semiparametric clustering models to dissimilarity data ⋮ Constructing optimal ultrametrics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Parsimonious trees
• Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity data
• Some applications of graph theory to clustering
• Hierarchical clustering schemes
• A graph theoretic approach to similarity relations
• Monotone invariant clustering procedures
• Hierarchical grouping methods and stopping rules: an evaluation
• Unresolved Problems in Cluster Analysis
• Computer Programs for Hierarchical Polythetic Classification ("Similarity Analyses")
• Corrections to Bierstone's Algorithm for Generating Cliques

This page was built for publication: Clique optimization: A method to construct parsimonious ultrametric trees from similarity data