Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm |
Algorithms suitable as a task for the
KDDTask main routine. |
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.
|
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.
|
Constructor and Description |
---|
DoubleDistanceKNNList(DoubleDistanceKNNHeap heap)
Constructor, to be called from KNNHeap only.
|
Modifier and Type | Method and Description |
---|---|
protected void |
DoubleDistanceRStarTreeKNNQuery.doKNNQuery(O object,
DoubleDistanceKNNHeap knnList)
Performs a k-nearest neighbor query for the given NumberVector with the
given parameter k and the according distance function.
|
private double |
DoubleDistanceRStarTreeKNNQuery.expandNode(O object,
DoubleDistanceKNNHeap knnList,
Heap<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.
|