diff options
author | Erich Schubert <erich@debian.org> | 2016-02-13 17:05:40 +0100 |
---|---|---|
committer | Andrej Shadura <andrewsh@debian.org> | 2019-03-09 22:30:47 +0000 |
commit | defdc6d2d24cb1cefca77aa63ca6c436a8f3672c (patch) | |
tree | a017235849736e0a0ea8a2b28de23f46dc47b082 /elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java | |
parent | aee1a6e43bd1a264226de31eadf10003c46d47c6 (diff) | |
parent | 0a055548ae9f9d5c639bb29ca32e0fd88de37c1d (diff) |
Import Debian changes 0.7.1-1
elki (0.7.1-1) unstable; urgency=low
* New upstream release (mostly bug fixes)
* Drop patches included upstream
* Build-dep on default-jdk instead of openjdk7-jdk (Closes: #814163)
Diffstat (limited to 'elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java')
-rw-r--r-- | elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java | 5 |
1 files changed, 4 insertions, 1 deletions
diff --git a/elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java b/elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java index 37dfd01f..b402d65f 100644 --- a/elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java +++ b/elki/src/main/java/de/lmu/ifi/dbs/elki/algorithm/clustering/hierarchical/HDBSCANLinearMemory.java @@ -74,8 +74,11 @@ import de.lmu.ifi.dbs.elki.utilities.documentation.Title; * </p> * * @author Erich Schubert + * @since 0.7.0 * * @param <O> Object type + * + * @apiviz.has PointerDensityHierarchyRepresentationResult */ @Title("HDBSCAN: Hierarchical Density-Based Spatial Clustering of Applications with Noise") @Description("Density-Based Clustering Based on Hierarchical Density Estimates") @@ -119,7 +122,7 @@ public class HDBSCANLinearMemory<O> extends AbstractHDBSCAN<O, PointerDensityHie final int numedges = ids.size() - 1; DoubleLongHeap heap = new DoubleLongMinHeap(numedges); // 2. Build spanning tree. - FiniteProgress mprog = LOG.isVerbose() ? new FiniteProgress("Computing minimum spanning tree (n-1 edges).", numedges, LOG) : null; + FiniteProgress mprog = LOG.isVerbose() ? new FiniteProgress("Computing minimum spanning tree (n-1 edges)", numedges, LOG) : null; PrimsMinimumSpanningTree.processDense(ids,// new HDBSCANAdapter(ids, coredists, distQ), // new HeapMSTCollector(heap, mprog, LOG)); |