Clustering with relational constraint (Q1060516): Difference between revisions

The paper deals with clustering problems where grouping is constrained by a symmetric and reflexive relation. For solving clustering problems with relational constraints two methods are adapted: the ''standard'' hierarchical clustering procedure based on the \textit{G. N. Lance} and \textit{W. T. Williams} formula [A general theory of classificatory strategies. I. Hierarchical systems. Comput. J. 9, 373-380 (1967)] and local optimization procedure, CLUDIA. To illustrate these procedures, clusterings of the European countries are given based on the developmental indicators where the relation is determined by the geographical neighbourhoods of countries.