A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems

1967/02/01 by G. N. Lance, W. T. Williams · 11 citations
Computer Science · #Evolutionary Algorithms and Applications #Metaheuristic Optimization Algorithms Research

paper · pdf · doi:10.1093/comjnl/9.4.373

Abstract

It is shown that the computational behaviour of a hierarchical sorting-strategy depends on three properties, which are established for five conventional strategies and four measures. The conventional strategies are shown to be simple variants of a single linear system defined by four parameters. A new strategy is defined, enabling continuous variation of intensity of grouping by variation in a single parameter. An Appendix provides specifications of computer programs embodying the new principles.

Cited by

• Benthic regions within the North Sea
• Cluster analysis and mathematical programming
• Transforming Keystroke Noise to Text: Self-Supervised Acoustic Eavesdropping Attacks on Keyboards
• Survey of Clustering Algorithms
• Groupwise Structural Parcellation of the Cortex: A Sound Approach Based on Logistic Models
• Semantic Word Clouds with Background Corpus Normalization and t-distributed Stochastic Neighbor Embedding
• SPORE: Skeleton Propagation Over Recalibrating Expansions
• ELKI: A large open-source library for data analysis - ELKI Release 0.7.5 "Heidelberg"
• Ravine forests in Colchis (Georgia) – Azonal forests in a Tertiary relict flora hotspot
• Applicability and Interpretability of Hierarchical Agglomerative Clustering With or Without Contiguity Constraints
• ParChain: A Framework for Parallel Hierarchical Agglomerative Clustering using Nearest-Neighbor Chain

Related

• Binar Sort: A Linear Generalized Sorting Algorithm
• Homogeneous and Non Homogeneous Algorithms
• Towards universally optimal sorting algorithms
• Composite Strategy for Multicriteria Ranking/Sorting (methodological issues, examples)
• Deriving Sorting Algorithms