| Package | Description |
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms.
|
| 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.distance.distanceresultlist |
Classes for building and storing the results of distance-based queries
The classes in this package essentially form three groups:
KNNHeap for building kNN results. |
| 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.
|
| Class and Description |
|---|
| UpdatableHeap
A heap as used in OPTICS that allows updating entries.
|
| Class and Description |
|---|
| Heap
Basic in-memory heap structure.
|
| IntegerPriorityObject
Object for a priority queue with integer priority.
|
| Class and Description |
|---|
| Heap
Basic in-memory heap structure.
|
| Class and Description |
|---|
| Heap
Basic in-memory heap structure.
|
| TiedTopBoundedHeap
A size-limited heap similar to
TopBoundedHeap, discarding elements
with the highest value. |
| Class and Description |
|---|
| Heap
Basic in-memory heap structure.
|
| Class and Description |
|---|
| AbstractHeap
Abstract base class for heaps.
|
| DoubleHeap
Basic in-memory heap structure.
|
| DoublePriorityObject
Object for a priority queue with integer priority.
|
| Heap
Basic in-memory heap structure.
|
| IntegerHeap
Basic in-memory heap structure.
|
| IntegerPriorityObject
Object for a priority queue with integer priority.
|
| ObjectHeap
Basic in-memory heap structure.
|
| TopBoundedHeap
Heap class that is bounded in size from the top.
|
| TopBoundedUpdatableHeap
Heap class that is bounded in size from the top.
|
| UpdatableHeap
A heap as used in OPTICS that allows updating entries.
|