A Survey of Algorithms for Contiguity-constrained Clustering and Related Problems

1985/01/01 by F. Murtagh, Fionn Murtagh · 4 citations
Computer Science · #Advanced Clustering Algorithms Research #Data Management and Algorithms #Data Mining Algorithms and Applications

paper · pdf · doi:10.1093/comjnl/28.1.82

Abstract

A large number of non-parametric clustering algorithms from a wide range of applications in the social sciences, earth sciences, pattern recognition, and image processing, are critically appraised. These algorithms all have the common property of seeking to use a relational–usually contiguity–constraint, in addition to proximity information. The constraint is necessary in many applications for the visualisation of clustering results. The primary objective of this survey is to sketch out the major algorithmic paradigms in current use, with a view towards facilitating the task of algorithm design in this area.

Cited by

• THE MAX‐P‐REGIONS PROBLEM*
• On the Performance of the Subtour Elimination Constraints Approach for the p‐Regions Problem: A Computational Study
• Tobler’s Law in a Multivariate World
• Examining Short-Term Responses to a Long-Term Problem: RNA-Seq Analyses of Iron Deficiency Chlorosis Tolerant Soybean. [europepmc]

Related

• Basic Principles of Clustering Methods
• Survey of Clustering Algorithms
• Semi-Supervised Constrained Clustering: An In-Depth Overview, Ranked Taxonomy and Future Research Directions
• Introduction to Clustering Algorithms and Applications
• A Framework for Deep Constrained Clustering -- Algorithms and Advances