37 for (class1 = 0; class1 < (C->
nclasses - 1); class1++) {
38 if (C->
count[class1] < 2)
40 for (class2 = class1 + 1; class2 < C->
nclasses; class2++) {
41 if (C->
count[class2] < 2)
45 if (dsep >= 0.0 && dsep < dmin) {
int I_cluster_sum2(struct Cluster *)
Compute sum of squares for each class.
int I_cluster_distinct(struct Cluster *C, double separation)
Get distinct value.
double I_cluster_separation(struct Cluster *, int, int)
?