Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.statistics |
Statistical analysis algorithms
The algorithms in this package perform statistical analysis of the data
(e.g. compute distributions, distance distributions etc.)
|
de.lmu.ifi.dbs.elki.database.ids |
Database object identification and ID group handling API.
|
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.range |
Prepared queries for ε-range queries, that return all objects within the radius ε.
|
de.lmu.ifi.dbs.elki.index.idistance |
iDistance is a distance based indexing technique, using a reference points embedding.
|
de.lmu.ifi.dbs.elki.index.invertedlist |
Indexes using inverted lists.
|
de.lmu.ifi.dbs.elki.index.lsh |
Locality Sensitive Hashing
|
de.lmu.ifi.dbs.elki.index.preprocessed.knn |
Indexes providing KNN and rKNN data.
|
de.lmu.ifi.dbs.elki.index.projected |
Projected indexes for data.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.covertree |
Cover-tree variations.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkcop | |
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkmax | |
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mktab | |
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.query |
Classes for performing queries (knn, range, ...) on metrical trees.
|
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.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rdknn | |
de.lmu.ifi.dbs.elki.index.vafile |
Vector Approximation File
|
de.lmu.ifi.dbs.elki.utilities.datastructures |
Basic memory structures such as heaps and object hierarchies.
|
Modifier and Type | Method and Description |
---|---|
private void |
EvaluateRetrievalPerformance.computeDistances(ModifiableDoubleDBIDList nlist,
DBIDIter query,
DistanceQuery<O> distQuery,
Relation<O> relation)
Compute the distances to the neighbor objects.
|
void |
EvaluateRetrievalPerformance.KNNEvaluator.evaluateKNN(double[] knnperf,
ModifiableDoubleDBIDList nlist,
Relation<?> lrelation,
gnu.trove.map.hash.TObjectIntHashMap<Object> counters,
Object label)
Evaluate by simulating kNN classification for k=1...maxk
|
Modifier and Type | Method and Description |
---|---|
ModifiableDoubleDBIDList |
DBIDFactory.newDistanceDBIDList()
Create a modifiable list to store distance-DBID pairs.
|
static ModifiableDoubleDBIDList |
DBIDUtil.newDistanceDBIDList()
Create a modifiable list to store distance-DBID pairs.
|
ModifiableDoubleDBIDList |
DBIDFactory.newDistanceDBIDList(int size)
Create a modifiable list to store distance-DBID pairs.
|
static ModifiableDoubleDBIDList |
DBIDUtil.newDistanceDBIDList(int size)
Create a modifiable list to store distance-DBID pairs.
|
Modifier and Type | Class and Description |
---|---|
class |
DoubleIntegerDBIDKNNList
kNN list, but without automatic sorting.
|
(package private) class |
DoubleIntegerDBIDList
Class to store double distance, integer DBID results.
|
(package private) class |
DoubleIntegerDBIDListKNNHeap
Track the k nearest neighbors, with insertion sort to ensure the correct
order.
|
(package private) class |
DoubleIntegerDBIDPairList
Class to store double distance, integer DBID results.
|
Modifier and Type | Method and Description |
---|---|
ModifiableDoubleDBIDList |
AbstractIntegerDBIDFactory.newDistanceDBIDList() |
ModifiableDoubleDBIDList |
AbstractIntegerDBIDFactory.newDistanceDBIDList(int size) |
Modifier and Type | Method and Description |
---|---|
void |
LinearScanPrimitiveDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
LinearScanEuclideanDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
RangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList result)
Get the neighbors for a particular object in a given query range
|
void |
LinearScanDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
AbstractDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
LinearScanPrimitiveDistanceRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
LinearScanEuclideanDistanceRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList neighbors) |
void |
RangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result)
Get the neighbors for a particular object in a given query range
|
void |
LinearScanDistanceRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList neighbors) |
private void |
LinearScanPrimitiveDistanceRangeQuery.linearScan(Relation<? extends O> relation,
DBIDIter iter,
O obj,
double range,
ModifiableDoubleDBIDList result)
Main loop for linear scan,
|
private void |
LinearScanEuclideanDistanceRangeQuery.linearScan(Relation<? extends O> relation,
DBIDIter iter,
O obj,
double range,
ModifiableDoubleDBIDList result)
Main loop for linear scan,
|
Modifier and Type | Field and Description |
---|---|
private ModifiableDoubleDBIDList[] |
InMemoryIDistanceIndex.index
The actual index.
|
Modifier and Type | Method and Description |
---|---|
protected static void |
InMemoryIDistanceIndex.binarySearch(ModifiableDoubleDBIDList index,
DoubleDBIDListIter iter,
double val)
Seek an iterator to the desired position, using binary search.
|
void |
InMemoryIDistanceIndex.IDistanceRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Field and Description |
---|---|
(package private) ArrayList<ModifiableDoubleDBIDList> |
InMemoryInvertedIndex.index
Inverted index.
|
Modifier and Type | Method and Description |
---|---|
private ModifiableDoubleDBIDList |
InMemoryInvertedIndex.getOrCreateColumn(int dim)
Get (or create) a column.
|
Modifier and Type | Method and Description |
---|---|
void |
InMemoryInvertedIndex.CosineRangeQuery.getRangeForObject(V obj,
double range,
ModifiableDoubleDBIDList result) |
void |
InMemoryInvertedIndex.ArcCosineRangeQuery.getRangeForObject(V obj,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Method and Description |
---|---|
void |
InMemoryLSHIndex.Instance.LSHRangeQuery.getRangeForObject(V obj,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Field and Description |
---|---|
(package private) List<ModifiableDoubleDBIDList> |
NaiveProjectedKNNPreprocessor.projected
Projected data.
|
Modifier and Type | Method and Description |
---|---|
void |
ProjectedIndex.ProjectedRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Field and Description |
---|---|
(package private) ModifiableDoubleDBIDList |
CoverTree.Node.singletons
Objects in this node.
|
Modifier and Type | Method and Description |
---|---|
protected CoverTree.Node |
CoverTree.bulkConstruct(DBIDRef cur,
int maxScale,
double parentDist,
ModifiableDoubleDBIDList elems)
Bulk-load the cover tree.
|
protected SimplifiedCoverTree.Node |
SimplifiedCoverTree.bulkConstruct(DBIDRef cur,
int maxScale,
ModifiableDoubleDBIDList elems)
Bulk-load the cover tree.
|
protected void |
AbstractCoverTree.collectByCover(DBIDRef cur,
ModifiableDoubleDBIDList candidates,
double fmax,
ModifiableDoubleDBIDList collect)
Collect all elements with respect to a new routing object.
|
protected void |
AbstractCoverTree.excludeNotCovered(ModifiableDoubleDBIDList candidates,
double fmax,
ModifiableDoubleDBIDList collect)
Retain all elements within the current cover.
|
void |
CoverTree.CoverTreeRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList ret) |
void |
SimplifiedCoverTree.CoverTreeRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList ret) |
Modifier and Type | Method and Description |
---|---|
private void |
MkCoPTree.doReverseKNNQuery(int k,
DBIDRef q,
ModifiableDoubleDBIDList result,
ModifiableDBIDs candidates)
Performs a reverse knn query.
|
Modifier and Type | Method and Description |
---|---|
private void |
MkMaxTree.doReverseKNNQuery(DBIDRef q,
MkMaxTreeNode<O> node,
MkMaxEntry node_entry,
ModifiableDoubleDBIDList result)
Performs a reverse k-nearest neighbor query in the specified subtree for
the given query object with k =
AbstractMkTreeUnified.getKmax() . |
Modifier and Type | Method and Description |
---|---|
private void |
MkTabTree.doReverseKNNQuery(int k,
DBIDRef q,
MkTabEntry node_entry,
MkTabTreeNode<O> node,
ModifiableDoubleDBIDList result)
Performs a k-nearest neighbor query in the specified subtree for the given
query object and the given parameter k.
|
Modifier and Type | Method and Description |
---|---|
private void |
MetricalIndexRangeQuery.doRangeQuery(DBID o_p,
AbstractMTreeNode<O,?,?> node,
O q,
double r_q,
ModifiableDoubleDBIDList result)
Performs a range query on the specified subtree.
|
void |
MetricalIndexRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Field and Description |
---|---|
(package private) ModifiableDoubleDBIDList |
SmallMemoryKDTree.sorted
The actual "tree" as a sorted array.
|
Modifier and Type | Method and Description |
---|---|
void |
MinimalisticMemoryKDTree.KDTreeRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
void |
SmallMemoryKDTree.KDTreeRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
private void |
MinimalisticMemoryKDTree.KDTreeRangeQuery.kdRangeSearch(int left,
int right,
int axis,
O query,
ModifiableDoubleDBIDList res,
DBIDArrayIter iter,
double radius)
Perform a kNN search on the kd-tree.
|
private void |
SmallMemoryKDTree.KDTreeRangeQuery.kdRangeSearch(int left,
int right,
int axis,
O query,
ModifiableDoubleDBIDList res,
DoubleDBIDListIter iter,
double radius)
Perform a kNN search on the kd-tree.
|
Modifier and Type | Method and Description |
---|---|
void |
RStarTreeRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList result) |
void |
RStarTreeRangeQuery.getRangeForObject(O obj,
double range,
ModifiableDoubleDBIDList result) |
void |
EuclideanRStarTreeRangeQuery.getRangeForObject(O object,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Method and Description |
---|---|
List<ModifiableDoubleDBIDList> |
RdKNNTree.bulkReverseKNNQueryForID(DBIDs ids,
int k,
SpatialPrimitiveDistanceFunction<? super O> distanceFunction,
KNNQuery<O> knnQuery) |
Modifier and Type | Method and Description |
---|---|
private void |
RdKNNTree.doReverseKNN(RdKNNNode node,
DBID oid,
ModifiableDoubleDBIDList result)
Performs a reverse knn query in the specified subtree.
|
Modifier and Type | Method and Description |
---|---|
private void |
RdKNNTree.doBulkReverseKNN(RdKNNNode node,
DBIDs ids,
Map<DBID,ModifiableDoubleDBIDList> result)
Performs a bulk reverse knn query in the specified subtree.
|
Modifier and Type | Method and Description |
---|---|
void |
PartialVAFile.PartialVAFileRangeQuery.getRangeForObject(V query,
double range,
ModifiableDoubleDBIDList result) |
void |
VAFile.VAFileRangeQuery.getRangeForObject(V query,
double eps,
ModifiableDoubleDBIDList result) |
Modifier and Type | Method and Description |
---|---|
private static void |
QuickSelect.insertionSort(ModifiableDoubleDBIDList data,
int start,
int end,
DoubleDBIDListIter iter1,
DoubleDBIDListIter iter2)
Sort a small array using repetitive insertion sort.
|
static int |
QuickSelect.median(ModifiableDoubleDBIDList data)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
QuickSelect.median(ModifiableDoubleDBIDList data,
int begin,
int end)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
QuickSelect.quantile(ModifiableDoubleDBIDList data,
double quant)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
QuickSelect.quantile(ModifiableDoubleDBIDList data,
int begin,
int end,
double quant)
Compute the median of an array efficiently using the QuickSelect method.
|
static void |
QuickSelect.quickSelect(ModifiableDoubleDBIDList data,
int rank)
QuickSelect is essentially quicksort, except that we only "sort" that half
of the array that we are interested in.
|
static void |
QuickSelect.quickSelect(ModifiableDoubleDBIDList data,
int start,
int end,
int rank)
QuickSelect is essentially quicksort, except that we only "sort" that half
of the array that we are interested in.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.