Fig. 4

Toy example illustrating how cluster frequency behaves for a data structure having clusters far apart (A, B and C) but having some ties. In this example the set of leaves is \(X=\{a,b,c,d,e,f,g,h,i\}\), whose elements are characterised by two properties: \(P_1\) and \(P_2\). Frequencies of well-separated clusters A, B and C through graph and relaxed-graph-cluster contrasts are depicted (in this example cluster contrast results are equal for graph and relaxed-graph-cluster contrasts)