Some Types of Clustering with Relational Constraints

1 December 1983

journal article
Published by Cambridge University Press (CUP) in Psychometrika

Vol. 48 (4) , 541-552
https://doi.org/10.1007/bf02293878

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 Constraint
Psychometrika, 1982
Note on Ultrametric Hierarchical Clustering Algorithms
Psychometrika, 1981
GRAPH THEORY
Published by Defense Technical Information Center (DTIC) ,1969
Hierarchical clustering schemes
Psychometrika, 1967
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
The Computer Journal, 1967