Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
Correlation clustering algorithms
|
de.lmu.ifi.dbs.elki.algorithm.outlier |
Outlier detection algorithms
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
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(Heap<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(Heap<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(Heap<IntegerPriorityObject<CASHInterval>> heap,
Relation<ParameterizationFunction> relation,
int dim,
DBIDs ids)
Initializes the heap with the root intervals.
|
Modifier and Type | Field and Description |
---|---|
Heap<DoubleDistanceResultPair> |
HilOut.HilFeature.nn
Heap with the nearest known neighbors
|
private Heap<HilOut.HilFeature> |
HilOut.HilbertFeatures.out
"OUT"
|
private Heap<HilOut.HilFeature> |
HilOut.HilbertFeatures.wlb
"WLB"
|
Modifier and Type | Method and Description |
---|---|
private Heap<DoubleObjPair<DBID>> |
ABOD.calcDistsandNN(Relation<V> data,
KernelMatrix kernelMatrix,
int sampleSize,
DBIDRef aKey,
WritableDoubleDataStore dists) |
private Heap<DoubleObjPair<DBID>> |
ABOD.calcDistsandRNDSample(Relation<V> data,
KernelMatrix kernelMatrix,
int sampleSize,
DBIDRef aKey,
WritableDoubleDataStore dists) |
Constructor and Description |
---|
HilOut.HilFeature(DBID id,
Heap<DoubleDistanceResultPair> nn)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
private D |
GenericRStarTreeKNNQuery.expandNode(O object,
KNNHeap<D> knnList,
Heap<GenericDistanceSearchCandidate<D>> pq,
D maxDist,
Integer nodeID) |
private double |
DoubleDistanceRStarTreeKNNQuery.expandNode(O object,
KNNHeap<DoubleDistance> knnList,
Heap<DoubleDistanceSearchCandidate> pq,
double maxDist,
Integer nodeID) |
Modifier and Type | Class and Description |
---|---|
class |
KNNHeap<D extends Distance<D>>
Heap used for KNN management.
|
class |
TiedTopBoundedHeap<E>
A size-limited heap similar to
TopBoundedHeap , discarding elements
with the highest value. |
class |
TiedTopBoundedUpdatableHeap<E>
A size-limited heap similar to
TopBoundedHeap , discarding elements
with the highest value. |
class |
TopBoundedHeap<E>
Heap class that is bounded in size from the top.
|
class |
TopBoundedUpdatableHeap<E>
Heap class that is bounded in size from the top.
|
class |
UpdatableHeap<O>
A heap as used in OPTICS that allows updating entries.
|