Clique optimization: A method to construct parsimonious ultrametric trees from similarity data
- 1 March 1990
- journal article
- research article
- Published by Springer Nature in Journal of Classification
- Vol. 7 (1) , 33-52
- https://doi.org/10.1007/bf01889702
Abstract
No abstract availableThis publication has 17 references indexed in Scilit:
- Least squares algorithms for constructing constrained ultrametric and additive tree representations of symmetric proximity dataJournal of Classification, 1987
- Complete linkage as a multiple stopping rule for single linkage clusteringJournal of Classification, 1987
- Parsimonious treesJournal of Classification, 1987
- Unresolved Problems in Cluster AnalysisPublished by JSTOR ,1979
- Monotone Invariant Clustering ProceduresPsychometrika, 1973
- Corrections to Bierstone's Algorithm for Generating CliquesJournal of the ACM, 1972
- Semantic Clustering of Index TermsJournal of the ACM, 1968
- Representation of Similarity Matrices by TreesJournal of the American Statistical Association, 1967
- Computer Programs for Hierarchical Polythetic Classification ("Similarity Analyses")The Computer Journal, 1966
- A Graph Theoretic Approach to Similarity RelationsPsychometrika, 1964