© 1985 by British Computer Society
| ||||||||||||||||||||||||||||||||||||||||||||||||||
A Survey of Algorithms for Contiguity-constrained Clustering and Related Problems
Department of Computer Science, University College Dublin, Dublin, UK
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 relationalusually contiguityconstraint, 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.
* Department of Computer Science, University College Dublin, Dublin 4, Ireland*
Current address: European Space Agency, Space Telescope European Coordinating Facility, ESO, Karl-Schwarzschild-Str. 2, 8046 Garching, W. Germany.
![]()
CiteULike
Connotea
Del.icio.us What's this?
This article has been cited by other articles:
![]() |
J. C. Duque, R. Ramos, and J. Surinach Supervised Regionalization Methods: A Survey International Regional Science Review, July 1, 2007; 30(3): 195 - 220. [Abstract] [PDF] |
||||
