diff options
Diffstat (limited to 'src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java')
-rw-r--r-- | src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java | 12 |
1 files changed, 5 insertions, 7 deletions
diff --git a/src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java b/src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java index 99144b42..176b7508 100644 --- a/src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java +++ b/src/de/lmu/ifi/dbs/elki/algorithm/clustering/correlation/LMCLUS.java @@ -4,7 +4,7 @@ package de.lmu.ifi.dbs.elki.algorithm.clustering.correlation; This file is part of ELKI: Environment for Developing KDD-Applications Supported by Index-Structures - Copyright (C) 2013 + Copyright (C) 2014 Ludwig-Maximilians-Universität München Lehr- und Forschungseinheit für Datenbanksysteme ELKI Development Team @@ -47,7 +47,7 @@ import de.lmu.ifi.dbs.elki.logging.progress.IndefiniteProgress; import de.lmu.ifi.dbs.elki.math.MeanVariance; import de.lmu.ifi.dbs.elki.math.linearalgebra.Matrix; import de.lmu.ifi.dbs.elki.math.linearalgebra.Vector; -import de.lmu.ifi.dbs.elki.utilities.RandomFactory; +import de.lmu.ifi.dbs.elki.math.random.RandomFactory; import de.lmu.ifi.dbs.elki.utilities.datastructures.histogram.DoubleDynamicHistogram; import de.lmu.ifi.dbs.elki.utilities.datastructures.histogram.DoubleHistogram; import de.lmu.ifi.dbs.elki.utilities.datastructures.histogram.DoubleStaticHistogram.Iter; @@ -158,7 +158,7 @@ public class LMCLUS extends AbstractAlgorithm<Clustering<Model>> { * @param relation Relation * @return Clustering result */ - public Clustering<Model> run(Database database, Relation<NumberVector<?>> relation) { + public Clustering<Model> run(Database database, Relation<NumberVector> relation) { Clustering<Model> ret = new Clustering<>("LMCLUS Clustering", "lmclus-clustering"); FiniteProgress progress = LOG.isVerbose() ? new FiniteProgress("Clustered objects", relation.size(), LOG) : null; IndefiniteProgress cprogress = LOG.isVerbose() ? new IndefiniteProgress("Clusters found", LOG) : null; @@ -225,9 +225,7 @@ public class LMCLUS extends AbstractAlgorithm<Clustering<Model>> { progress.setProcessed(relation.size(), LOG); progress.ensureCompleted(LOG); } - if(cprogress != null) { - cprogress.setCompleted(LOG); - } + LOG.setCompleted(cprogress); return ret; } @@ -264,7 +262,7 @@ public class LMCLUS extends AbstractAlgorithm<Clustering<Model>> { * @return the overall goodness of the separation. The values origin basis and * threshold are returned indirectly over class variables. */ - private Separation findSeparation(Relation<NumberVector<?>> relation, DBIDs currentids, int dimension, Random r) { + private Separation findSeparation(Relation<NumberVector> relation, DBIDs currentids, int dimension, Random r) { Separation separation = new Separation(); // determine the number of samples needed, to secure that with a specific // probability |