Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm |
Algorithms suitable as a task for the
KDDTask main routine. |
de.lmu.ifi.dbs.elki.database.ids |
Database object identification and ID group handling API.
|
de.lmu.ifi.dbs.elki.database.ids.generic |
Database object identification and ID group handling - generic implementations.
|
de.lmu.ifi.dbs.elki.database.ids.integer |
Integer-based DBID implementation --
do not use directly - always use
DBIDUtil . |
de.lmu.ifi.dbs.elki.database.query.knn |
Prepared queries for k nearest neighbor (kNN) queries.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.kd |
K-d-tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
Modifier and Type | Method and Description |
---|---|
private void |
KNNJoin.processDataPagesDouble(SpatialPrimitiveDoubleDistanceFunction<? super V> df,
N pr,
N ps,
List<DoubleDistanceKNNHeap> pr_heaps,
List<DoubleDistanceKNNHeap> ps_heaps)
Processes the two data pages pr and ps and determines the k-nearest
neighbors of pr in ps.
|
private void |
KNNJoin.processDataPagesDouble(SpatialPrimitiveDoubleDistanceFunction<? super V> df,
N pr,
N ps,
List<DoubleDistanceKNNHeap> pr_heaps,
List<DoubleDistanceKNNHeap> ps_heaps)
Processes the two data pages pr and ps and determines the k-nearest
neighbors of pr in ps.
|
Modifier and Type | Method and Description |
---|---|
DoubleDistanceKNNHeap |
DBIDFactory.newDoubleDistanceHeap(int k)
Create an appropriate heap for double distances.
|
static DoubleDistanceKNNHeap |
DBIDUtil.newDoubleDistanceHeap(int k)
Create an appropriate heap for double distances.
|
Modifier and Type | Class and Description |
---|---|
class |
DoubleDistanceDBIDPairKNNHeap
Heap for collecting double-valued KNN instances.
|
class |
DoubleDistanceDBIDPairKNNListHeap
Finalized KNN List.
|
Modifier and Type | Class and Description |
---|---|
class |
DoubleDistanceIntegerDBIDKNNHeap
Class to efficiently manage a kNN heap.
|
class |
DoubleDistanceIntegerDBIDPairKNNListHeap
Finalized KNN List.
|
class |
DoubleDistanceIntegerDBIDSortedKNNList
Track the k nearest neighbors, with insertion sort to ensure the correct
order.
|
Modifier and Type | Method and Description |
---|---|
DoubleDistanceKNNHeap |
AbstractIntegerDBIDFactory.newDoubleDistanceHeap(int k) |
Modifier and Type | Method and Description |
---|---|
private static <O> void |
DoubleOptimizedDistanceKNNQuery.linearScan(Relation<? extends O> relation,
DBIDIter iter,
PrimitiveDoubleDistanceFunction<? super O> rawdist,
O obj,
DoubleDistanceKNNHeap heap) |
Modifier and Type | Method and Description |
---|---|
private double |
MinimalisticMemoryKDTree.KDTreeKNNQuery.kdKNNSearch(int left,
int right,
int axis,
O query,
DoubleDistanceKNNHeap knns,
DBIDArrayIter iter,
double maxdist)
Perform a kNN search on the kd-tree.
|
Modifier and Type | Method and Description |
---|---|
private double |
DoubleDistanceRStarTreeKNNQuery.expandNode(O object,
DoubleDistanceKNNHeap knnList,
ComparableMinHeap<DoubleDistanceSearchCandidate> pq,
double maxDist,
int nodeID) |
Modifier and Type | Method and Description |
---|---|
protected void |
DoubleDistanceRStarTreeKNNQuery.batchNN(AbstractRStarTreeNode<?,?> node,
Map<DBID,DoubleDistanceKNNHeap> knnLists)
Performs a batch knn query.
|