Some types of clustering with relational constraints (Q789129): Difference between revisions

This paper is devoted to a problem of clustering of finite sets with some relational constraints. Let \(E=\{X_ i\}\) be a finite set of units (objects) and \(R\subset E\times E\) a relation on E. If \(C\subseteq E\) is a cluster from a clustering \({\mathcal C}=\{C_ i\}\) it is natural to suppose, that the units of a cluster C are in some sense joined by the relation R. The relation R can be investigated as an oriented graph with vertex set E. Then the demands taken on clustering can be expressed in terms of the connectivity of the graphs induced by clusters. There are discussed five possible types of clusterings with corresponding strategies for finding the hierarchical clustering on a finite set of objects. A concrete example of clustering with three types of strategies is shown.