Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
Correlation clustering algorithms
|
de.lmu.ifi.dbs.elki.algorithm.outlier.distance |
Distance-based outlier detection algorithms, such as DBOutlier and kNN.
|
de.lmu.ifi.dbs.elki.utilities.datastructures.heap |
Heap structures and variations such as bounded priority heaps.
|
Modifier and Type | Method and Description |
---|---|
private CASHInterval |
CASH.determineNextIntervalAtMaxLevel(ObjectHeap<IntegerPriorityObject<CASHInterval>> heap)
Determines the next ''best'' interval at maximum level, i.e. the next
interval containing the most unprocessed objects.
|
private CASHInterval |
CASH.doDetermineNextIntervalAtMaxLevel(ObjectHeap<IntegerPriorityObject<CASHInterval>> heap)
Recursive helper method to determine the next ''best'' interval at maximum
level, i.e. the next interval containing the most unprocessed objects
|
private void |
CASH.initHeap(ObjectHeap<IntegerPriorityObject<CASHInterval>> heap,
Relation<ParameterizationFunction> relation,
int dim,
DBIDs ids)
Initializes the heap with the root intervals.
|
Modifier and Type | Field and Description |
---|---|
ObjectHeap<DoubleDBIDPair> |
HilOut.HilFeature.nn
Heap with the nearest known neighbors
|
private ObjectHeap<HilOut.HilFeature> |
HilOut.HilbertFeatures.out
"OUT"
|
private ObjectHeap<HilOut.HilFeature> |
HilOut.HilbertFeatures.wlb
"WLB"
|
Constructor and Description |
---|
HilFeature(DBID id,
ObjectHeap<DoubleDBIDPair> nn)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
class |
ComparableMaxHeap<K extends Comparable<? super K>>
Binary heap for primitive types.
|
class |
ComparableMinHeap<K extends Comparable<? super K>>
Binary heap for primitive types.
|
class |
ComparatorMaxHeap<K>
Binary heap for primitive types.
|
class |
ComparatorMinHeap<K>
Binary heap for primitive types.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.