Hostname: page-component-7dd5485656-bt4hw Total loading time: 0 Render date: 2025-10-29T20:33:35.482Z Has data issue: false hasContentIssue false
  • English
  • Français

Some Types of Clustering with Relational Constraints

Published online by Cambridge University Press:  01 January 2025

Anuška Ferligoj  and
Vladimir Batagelj
Anuška Ferligoj*
Affiliation:
University Edvard Kardelj
Vladimir Batagelj
Affiliation:
University Edvard Kardelj
*
Requests for reprints should be sent to: Anuška Ferligoj, Faculty of Sociology, Political Sciences and Journalism, University Edvard Kardelj, Kardeljeva ploščad 5, 61 000 Ljubljana, Yugoslavia.
Get access Rights & Permissions [Opens in a new window]

Abstract

For the clustering problem with general (not necessarily symmetric) relational constraints, different sets of feasible clusterings, also called clustering types, determined by the same relation, can be defined. In this paper some clustering types are discussed and adaptations of the hierarchical clustering method compatible with these clustering types are proposed.

Keywords

graphshierarchical clusteringclustering with relational constraints

Information

Type
Original Paper
Information
Psychometrika , Volume 48 , Issue 4 , December 1983 , pp. 541 - 552
Copyright
Copyright © 1983 The Psychometric Society

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

This work was supported in part by the Boris Kidrič Fund Yugoslavia.

We are grateful to anonymous reviewers for a number of helpful suggestions which improved the presentation of this paper.

References

Reference Note

Perruchet, C. Classification sous contrainte de contiguité continue (Application aux sciences de la terre). Thesis. Paris: 1979 (in French).Google Scholar

References

Anderberg, M. R. Cluster analysis for applications, New York: Academic Press, 1973.Google Scholar
Batagelj, V. Note on ultrametric hierarchical clustering algorithms. Psychometrika, 1981, 46, 351–352.CrossRefGoogle Scholar
Berztiss, A. T. Data structures (Theory and practice), New York: Academic Press, 1975.Google Scholar
Ferligoj, A. & Batagelj, V. Clustering with relational constraint. Psychometrika, 1982, 47, 413–426.CrossRefGoogle Scholar
Garey, M. R. & Johnson, D. S. Computer and intractability, San Francisco: Freeman, 1979.Google Scholar
Gordon, A. D. Methods of constrained classification. In Tomassone, R. (Eds.), Analyse de Donnée et Informatique, Le Chesnay: I.N.R.I.A., 1980.Google Scholar
Harary, F. Graph theory, Reading: Addison-Wesley, 1969.CrossRefGoogle Scholar
Johnson, S. C. Hierarchical clustering schemes. Psychometrika, 1967, 32, 241–254.CrossRefGoogle ScholarPubMed
Lance, G. N. & Williams, W. T. A general theory of classificatory sorting strategies, 1. Hierarchical systems. The Computer Journal, 1967, 9, 373–380.CrossRefGoogle Scholar
Preparata, F. P. & Yeh, R. T. Introduction to discrete structures (for computer science and engineering), Reading: Addison-Wesley, 1973.Google Scholar