Best Java code snippets using de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.AnderbergHierarchicalClustering.findMerge (Showing top 3 results out of 315)

int wsize = size;
for(int i = 1; i < size; i++) {
 int x = findMerge(wsize, scratch, ix, iy, bestd, besti, builder);
 if(x == wsize - 1) {
  --wsize;

for(int i = 1, end = size; i < size; i++) {
   findMerge(end, mat, bestd, besti, builder));
 LOG.incrementProcessed(prog);

for(int i = 1, end = size; i < size; i++) {
   findMerge(end, mat, bestd, besti, builder));
 LOG.incrementProcessed(prog);