Some Types of Clustering with Relational Constraints
Anuška Ferligoj, Vladimir Batagelj · Psychometrika · 1983
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.