A Structured Family of Clustering and Tree Construction Methods

✍ Scribed by David Bryant; Vincent Berry

• Publisher: Elsevier Science
• Year: 2001
• Tongue: English
• Weight: 190 KB
• Volume: 27
• Category: Article
• ISSN: 0196-8858
• DOI: 10.1006/aama.2001.0758

✦ Synopsis

A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of related hierarchical clustering methods. The extensions are shown to be closely connected with the well-known single and average linkage tree constructions. A dual family of methods for classification by splits is also presented. Splits are partitions of the set of objects into two disjoint blocks and are widely used in domains such as phylogenetics. Both the cluster and split methods give rise to progressively refined tree representations. We exploit dualities and connections between the various methods, giving polynomial time construction algorithms for most of the constructions and NP-hardness results for the rest.