Some Types of Clustering with Relational Constraints
Authors:
- 1 December 1983
- journal article
- Published by Cambridge University Press (CUP) in Psychometrika
- Vol. 48 (4) , 541-552
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
This publication has 5 references indexed in Scilit:
- Clustering with Relational ConstraintPsychometrika, 1982
- Note on Ultrametric Hierarchical Clustering AlgorithmsPsychometrika, 1981
- GRAPH THEORY1969
- Hierarchical Clustering SchemesPsychometrika, 1967
- A General Theory of Classificatory Sorting Strategies: 1. Hierarchical SystemsThe Computer Journal, 1967