Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm |
Algorithms suitable as a task for the
KDDTask main routine. |
de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms
Clustering algorithms are supposed to implement the
Algorithm -Interface. |
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
Correlation clustering algorithms
|
de.lmu.ifi.dbs.elki.algorithm.clustering.subspace |
Axis-parallel subspace clustering algorithms
The clustering algorithms in this package are instances of both, projected clustering algorithms or
subspace clustering algorithms according to the classical but somewhat obsolete classification schema
of clustering algorithms for axis-parallel subspaces.
|
de.lmu.ifi.dbs.elki.algorithm.outlier |
Outlier detection algorithms
|
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.application.visualization |
Visualization applications in ELKI.
|
de.lmu.ifi.dbs.elki.database |
ELKI database layer - loading, storing, indexing and accessing data
|
de.lmu.ifi.dbs.elki.database.query |
Database queries - computing distances, neighbors, similarities - API and general documentation.
|
de.lmu.ifi.dbs.elki.database.query.distance |
Prepared queries for distances.
|
de.lmu.ifi.dbs.elki.database.query.knn |
Prepared queries for k nearest neighbor (kNN) queries.
|
de.lmu.ifi.dbs.elki.database.query.range |
Prepared queries for ε-range queries.
|
de.lmu.ifi.dbs.elki.database.query.rknn |
Prepared queries for reverse k nearest neighbor (rkNN) queries.
|
de.lmu.ifi.dbs.elki.distance.distancefunction |
Distance functions for use within ELKI.
|
de.lmu.ifi.dbs.elki.distance.distancefunction.adapter |
Distance functions deriving distances from e.g. similarity measures
|
de.lmu.ifi.dbs.elki.distance.distancefunction.correlation |
Distance functions using correlations.
|
de.lmu.ifi.dbs.elki.distance.distancefunction.subspace |
Distance functions based on subspaces.
|
de.lmu.ifi.dbs.elki.index |
Index structure implementations
|
de.lmu.ifi.dbs.elki.index.preprocessed.knn |
Indexes providing KNN and rKNN data.
|
de.lmu.ifi.dbs.elki.index.tree.metrical |
Tree-based index structures for metrical vector spaces.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants |
M-Tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees |
Metrical index structures based on the concepts of the M-Tree
supporting processing of reverse k nearest neighbor queries by
using the k-nn distances of the entries.
|
de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants.mktrees.mkapp | |
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.mtree | |
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.metrical.mtreevariants.split |
Splitting strategies of nodes in an M-Tree (and variants).
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
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.rstar |
Modifier and Type | Method and Description |
---|---|
private D |
KNNJoin.processDataPages(DistanceQuery<V,D> distQ,
N pr,
N ps,
WritableDataStore<KNNHeap<D>> knnLists,
D pr_knn_distance)
Processes the two data pages pr and ps and determines the k-nearest
neighbors of pr in ps.
|
Modifier and Type | Method and Description |
---|---|
protected DistanceQuery<V,DoubleDistance> |
AbstractProjectedClustering.getDistanceQuery(Database database)
Returns the distance function.
|
Modifier and Type | Method and Description |
---|---|
private void |
SLINK.step2(DBID newID,
DBIDs processedIDs,
DistanceQuery<O,D> distFunc,
WritableDataStore<D> m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
Modifier and Type | Method and Description |
---|---|
private void |
ORCLUS.assign(Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
List<ORCLUS.ORCLUSCluster> clusters)
Creates a partitioning of the database by assigning each object to its
closest seed.
|
private void |
ERiC.buildHierarchy(SortedMap<Integer,List<Cluster<CorrelationModel<V>>>> clusterMap,
DistanceQuery<V,IntegerDistance> query) |
private Matrix |
ORCLUS.findBasis(Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
ORCLUS.ORCLUSCluster cluster,
int dim)
Finds the basis of the subspace of dimensionality
dim for the
specified cluster. |
ClusteringAlgorithm<Clustering<Model>> |
COPAC.getPartitionAlgorithm(DistanceQuery<V,D> query)
Returns the partition algorithm.
|
private void |
ORCLUS.merge(Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
List<ORCLUS.ORCLUSCluster> clusters,
int k_new,
int d_new,
IndefiniteProgress cprogress)
Reduces the number of seeds to k_new
|
private ORCLUS.ProjectedEnergy |
ORCLUS.projectedEnergy(Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
ORCLUS.ORCLUSCluster c_i,
ORCLUS.ORCLUSCluster c_j,
int i,
int j,
int dim)
Computes the projected energy of the specified clusters.
|
private Clustering<Model> |
COPAC.runPartitionAlgorithm(Relation<V> relation,
Map<Integer,DBIDs> partitionMap,
DistanceQuery<V,D> query)
Runs the partition algorithm and creates the result.
|
private ORCLUS.ORCLUSCluster |
ORCLUS.union(Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
ORCLUS.ORCLUSCluster c1,
ORCLUS.ORCLUSCluster c2,
int dim)
Returns the union of the two specified clusters.
|
Modifier and Type | Method and Description |
---|---|
private Map<DBID,Set<Integer>> |
PROCLUS.findDimensions(DBIDs medoids,
Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
RangeQuery<V,DoubleDistance> rangeQuery)
Determines the set of correlated dimensions for each medoid in the
specified medoid set.
|
private Map<DBID,List<DistanceResultPair<DoubleDistance>>> |
PROCLUS.getLocalities(DBIDs medoids,
Relation<V> database,
DistanceQuery<V,DoubleDistance> distFunc,
RangeQuery<V,DoubleDistance> rangeQuery)
Computes the localities of the specified medoids: for each medoid m the
objects in the sphere centered at m with radius minDist are determined,
where minDist is the minimum distance between medoid m and any other medoid
m_i.
|
private ModifiableDBIDs |
PROCLUS.greedy(DistanceQuery<V,DoubleDistance> distFunc,
DBIDs sampleSet,
int m,
Random random)
Returns a piercing set of k medoids from the specified sample set.
|
Modifier and Type | Method and Description |
---|---|
protected List<DistanceResultPair<D>> |
ReferenceBasedOutlierDetection.computeDistanceVector(V refPoint,
Relation<V> database,
DistanceQuery<V,D> distFunc)
Computes for each object the distance to one reference point.
|
protected DataStore<Double> |
DBOutlierDetection.computeOutlierScores(Database database,
DistanceQuery<O,D> distFunc,
D neighborhoodSize) |
protected abstract DataStore<Double> |
AbstractDBOutlier.computeOutlierScores(Database database,
DistanceQuery<O,D> distFunc,
D d)
computes an outlier score for each object of the database.
|
protected DataStore<Double> |
DBOutlierScore.computeOutlierScores(Database database,
DistanceQuery<O,D> distFunc,
D d) |
Modifier and Type | Method and Description |
---|---|
private DoubleMinMax |
DistanceStatisticsWithClasses.exactMinMax(Relation<O> database,
DistanceQuery<O,D> distFunc) |
private DoubleMinMax |
DistanceStatisticsWithClasses.sampleMinMax(Relation<O> database,
DistanceQuery<O,D> distFunc) |
Modifier and Type | Field and Description |
---|---|
private DistanceQuery<O,D> |
KNNExplorer.ExplorerWindow.distanceQuery
Holds the instance of the distance function specified by
KNNExplorer.DISTANCE_FUNCTION_ID . |
Modifier and Type | Method and Description |
---|---|
void |
KNNExplorer.ExplorerWindow.run(Database db,
DistanceQuery<O,D> distanceQuery)
Process the given Database and distance function.
|
Modifier and Type | Method and Description |
---|---|
static <O,D extends Distance<D>> |
QueryUtil.getDistanceQuery(Database database,
DistanceFunction<? super O,D> distanceFunction,
Object... hints)
Get a distance query for a given distance function, automatically choosing
a relation.
|
<O,D extends Distance<D>> |
AbstractDatabase.getDistanceQuery(Relation<O> objQuery,
DistanceFunction<? super O,D> distanceFunction,
Object... hints) |
<O,D extends Distance<D>> |
Database.getDistanceQuery(Relation<O> relation,
DistanceFunction<? super O,D> distanceFunction,
Object... hints)
Get the distance query for a particular distance function.
|
Modifier and Type | Method and Description |
---|---|
<O,D extends Distance<D>> |
AbstractDatabase.getKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
<O,D extends Distance<D>> |
Database.getKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a KNN query object for the given distance query.
|
static <O,D extends Distance<D>> |
QueryUtil.getLinearScanKNNQuery(DistanceQuery<O,D> distanceQuery)
Get a linear scan query for the given distance query.
|
static <O,D extends Distance<D>> |
QueryUtil.getLinearScanRangeQuery(DistanceQuery<O,D> distanceQuery)
Get a linear scan query for the given distance query.
|
<O,D extends Distance<D>> |
AbstractDatabase.getRangeQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
<O,D extends Distance<D>> |
Database.getRangeQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a range query object for the given distance query.
|
<O,D extends Distance<D>> |
AbstractDatabase.getRKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
<O,D extends Distance<D>> |
Database.getRKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a rKNN query object for the given distance query.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DistanceSimilarityQuery<O,D extends Distance<D>>
Interface that is a combination of distance and a similarity function.
|
Modifier and Type | Interface and Description |
---|---|
interface |
SpatialDistanceQuery<V extends SpatialComparable,D extends Distance<D>>
Query interface for spatial distance queries.
|
Modifier and Type | Class and Description |
---|---|
class |
AbstractDatabaseDistanceQuery<O,D extends Distance<D>>
Run a database query in a database context.
|
class |
AbstractDistanceQuery<O,D extends Distance<D>>
A distance query serves as adapter layer for database and primitive
distances.
|
class |
DBIDDistanceQuery<D extends Distance<D>>
Run a distance query based on DBIDs
|
class |
PrimitiveDistanceQuery<O,D extends Distance<D>>
Run a database query in a database context.
|
class |
PrimitiveDistanceSimilarityQuery<O,D extends Distance<D>>
Combination query class, for convenience.
|
class |
SpatialPrimitiveDistanceQuery<V extends SpatialComparable,D extends Distance<D>>
Distance query for spatial distance functions
|
Modifier and Type | Field and Description |
---|---|
protected DistanceQuery<O,D> |
AbstractDistanceKNNQuery.distanceQuery
Hold the distance function to be used.
|
Modifier and Type | Method and Description |
---|---|
DistanceQuery<O,D> |
KNNQuery.getDistanceQuery()
Get the distance query for this function.
|
DistanceQuery<O,D> |
PreprocessorKNNQuery.getDistanceQuery() |
DistanceQuery<O,D> |
AbstractDistanceKNNQuery.getDistanceQuery() |
Constructor and Description |
---|
AbstractDistanceKNNQuery(DistanceQuery<O,D> distanceQuery)
Constructor.
|
LinearScanKNNQuery(DistanceQuery<O,D> distanceQuery)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
protected DistanceQuery<O,D> |
AbstractDistanceRangeQuery.distanceQuery
Hold the distance function to be used.
|
Constructor and Description |
---|
AbstractDistanceRangeQuery(DistanceQuery<O,D> distanceQuery)
Constructor.
|
LinearScanRangeQuery(DistanceQuery<O,D> distanceQuery)
Constructor.
|
LinearScanRawDoubleDistanceRangeQuery(DistanceQuery<O,DoubleDistance> distanceQuery)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
protected DistanceQuery<O,D> |
AbstractRKNNQuery.distanceQuery
Hold the distance function to be used.
|
Constructor and Description |
---|
AbstractRKNNQuery(DistanceQuery<O,D> distanceQuery)
Constructor.
|
LinearScanRKNNQuery(DistanceQuery<O,D> distanceQuery,
KNNQuery<O,D> knnQuery,
Integer maxk)
Constructor.
|
Modifier and Type | Interface and Description |
---|---|
static interface |
FilteredLocalPCABasedDistanceFunction.Instance<T extends NumberVector<?,?>,I extends Index,D extends Distance<D>>
Instance produced by the distance function.
|
static interface |
IndexBasedDistanceFunction.Instance<T,I extends Index,D extends Distance<D>>
Instance interface for Index based distance functions.
|
Modifier and Type | Class and Description |
---|---|
static class |
AbstractDatabaseDistanceFunction.Instance<O,D extends Distance<D>>
The actual instance bound to a particular database.
|
static class |
AbstractIndexBasedDistanceFunction.Instance<O,I extends Index,D extends Distance<D>,F extends DistanceFunction<? super O,D>>
The actual instance bound to a particular database.
|
static class |
LocallyWeightedDistanceFunction.Instance<V extends NumberVector<?,?>>
Instance of this distance for a particular database.
|
class |
MinKDistance.Instance<T extends O>
Instance for an actual database.
|
static class |
SharedNearestNeighborJaccardDistanceFunction.Instance<T>
Actual instance for a dataset.
|
Modifier and Type | Field and Description |
---|---|
(package private) DistanceQuery<O,D> |
ProxyDistanceFunction.inner
Distance query
|
Modifier and Type | Method and Description |
---|---|
DistanceQuery<O,D> |
ProxyDistanceFunction.getDistanceQuery()
Get the inner query
|
<O extends DBID> |
AbstractDBIDDistanceFunction.instantiate(Relation<O> database) |
<T extends O> |
DistanceFunction.instantiate(Relation<T> relation)
Instantiate with a database to get the actual distance query.
|
<T extends O> |
MinKDistance.instantiate(Relation<T> relation) |
<T extends O> |
AbstractPrimitiveDistanceFunction.instantiate(Relation<T> relation)
Instantiate with a database to get the actual distance query.
|
Modifier and Type | Method and Description |
---|---|
static <O,D extends Distance<D>> |
ProxyDistanceFunction.proxy(DistanceQuery<O,D> inner)
Static method version.
|
void |
ProxyDistanceFunction.setDistanceQuery(DistanceQuery<O,D> inner) |
Constructor and Description |
---|
ProxyDistanceFunction(DistanceQuery<O,D> inner)
Constructor
|
Modifier and Type | Class and Description |
---|---|
static class |
AbstractSimilarityAdapter.Instance<O>
Inner proxy class for SNN distance function.
|
static class |
SimilarityAdapterArccos.Instance<O>
Distance function instance
|
static class |
SimilarityAdapterLinear.Instance<O>
Distance function instance
|
static class |
SimilarityAdapterLn.Instance<O>
Distance function instance
|
Modifier and Type | Method and Description |
---|---|
abstract <T extends O> |
AbstractSimilarityAdapter.instantiate(Relation<T> database) |
<T extends O> |
SimilarityAdapterLn.instantiate(Relation<T> database) |
<T extends O> |
SimilarityAdapterLinear.instantiate(Relation<T> database) |
<T extends O> |
SimilarityAdapterArccos.instantiate(Relation<T> database) |
Modifier and Type | Class and Description |
---|---|
static class |
ERiCDistanceFunction.Instance<V extends NumberVector<?,?>>
The actual instance bound to a particular database.
|
static class |
PCABasedCorrelationDistanceFunction.Instance<V extends NumberVector<?,?>>
The actual instance bound to a particular database.
|
Modifier and Type | Class and Description |
---|---|
static class |
AbstractPreferenceVectorBasedCorrelationDistanceFunction.Instance<V extends NumberVector<?,?>,P extends PreferenceVectorIndex<V>>
Instance to compute the distances on an actual database.
|
static class |
DiSHDistanceFunction.Instance<V extends NumberVector<?,?>>
The actual instance bound to a particular database.
|
static class |
HiSCDistanceFunction.Instance<V extends NumberVector<?,?>>
The actual instance bound to a particular database.
|
static class |
SubspaceDistanceFunction.Instance<V extends NumberVector<?,?>>
The actual instance bound to a particular database.
|
Modifier and Type | Method and Description |
---|---|
<D extends Distance<D>> |
KNNIndex.getKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a KNN query object for the given distance query and k.
|
<D extends Distance<D>> |
RangeIndex.getRangeQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a range query object for the given distance query and k.
|
<D extends Distance<D>> |
RKNNIndex.getRKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints)
Get a KNN query object for the given distance query and k.
|
Modifier and Type | Field and Description |
---|---|
protected DistanceQuery<O,D> |
AbstractMaterializeKNNPreprocessor.distanceQuery
The distance query we used.
|
Modifier and Type | Method and Description |
---|---|
DistanceQuery<O,D> |
AbstractMaterializeKNNPreprocessor.getDistanceQuery()
The distance query we used.
|
Modifier and Type | Method and Description |
---|---|
<S extends Distance<S>> |
AbstractMaterializeKNNPreprocessor.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MaterializeKNNAndRKNNPreprocessor.getRKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
Modifier and Type | Method and Description |
---|---|
abstract DistanceQuery<O,D> |
MetricalIndexTree.getDistanceQuery()
Returns the distance function of this metrical index.
|
Modifier and Type | Field and Description |
---|---|
protected DistanceQuery<O,D> |
AbstractMTree.distanceQuery
The distance query
|
Modifier and Type | Method and Description |
---|---|
DistanceQuery<O,D> |
AbstractMTree.getDistanceQuery() |
Constructor and Description |
---|
AbstractMTree(PageFile<N> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction)
Constructor.
|
Constructor and Description |
---|
AbstractMkTree(PageFile<N> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction)
Constructor.
|
AbstractMkTreeUnified(PageFile<N> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<S extends Distance<S>> |
MkAppTreeIndex.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkAppTreeIndex.getRangeQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkAppTreeIndex.getRKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
Constructor and Description |
---|
MkAppTree(PageFile<MkAppTreeNode<O,D>> pageFile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max,
int p,
boolean log)
Constructor.
|
MkAppTreeIndex(Relation<O> relation,
PageFile<MkAppTreeNode<O,D>> pageFile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max,
int p,
boolean log)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<O> D |
MkCoPDirectoryEntry.approximateConservativeKnnDistance(int k,
DistanceQuery<O,D> distanceFunction)
Returns the conservative approximated knn distance of the entry.
|
<O> D |
MkCoPEntry.approximateConservativeKnnDistance(int k,
DistanceQuery<O,D> distanceFunction)
Returns the conservative approximated knn distance of the entry.
|
<O> D |
MkCoPLeafEntry.approximateConservativeKnnDistance(int k,
DistanceQuery<O,D> distanceFunction)
Returns the conservative approximated knn distance of the entry.
|
<O> D |
MkCoPLeafEntry.approximateProgressiveKnnDistance(int k,
DistanceQuery<O,D> distanceFunction)
Returns the progressive approximated knn distance of the entry.
|
<O,D extends NumberDistance<D,?>> |
ApproximationLine.getApproximatedKnnDistance(int k,
DistanceQuery<O,D> distanceFunction)
Returns the approximated knn-distance at the specified k.
|
<S extends Distance<S>> |
MkCoPTreeIndex.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkCoPTreeIndex.getRangeQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkCoPTreeIndex.getRKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
Constructor and Description |
---|
MkCoPTree(PageFile<MkCoPTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
MkCoPTreeIndex(Relation<O> relation,
PageFile<MkCoPTreeNode<O,D>> pageFile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<S extends Distance<S>> |
MkMaxTreeIndex.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkMaxTreeIndex.getRangeQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkMaxTreeIndex.getRKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
protected D |
MkMaxTreeNode.kNNDistance(DistanceQuery<O,D> distanceFunction)
Determines and returns the k-nearest neighbor distance of this node as the
maximum of the k-nearest neighbor distances of all entries.
|
Constructor and Description |
---|
MkMaxTree(PageFile<MkMaxTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
MkMaxTreeIndex(Relation<O> relation,
PageFile<MkMaxTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<S extends Distance<S>> |
MkTabTreeIndex.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkTabTreeIndex.getRangeQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MkTabTreeIndex.getRKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
protected List<D> |
MkTabTreeNode.kNNDistances(DistanceQuery<O,D> distanceFunction)
Determines and returns the knn distance of this node as the maximum knn
distance of all entries.
|
Constructor and Description |
---|
MkTabTree(PageFile<MkTabTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
MkTabTreeIndex(Relation<O> relation,
PageFile<MkTabTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction,
int k_max)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<S extends Distance<S>> |
MTreeIndex.getKNNQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
<S extends Distance<S>> |
MTreeIndex.getRangeQuery(DistanceQuery<O,S> distanceQuery,
Object... hints) |
Constructor and Description |
---|
MTree(PageFile<MTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction)
Constructor.
|
MTreeIndex(Relation<O> relation,
PageFile<MTreeNode<O,D>> pagefile,
DistanceQuery<O,D> distanceQuery,
DistanceFunction<O,D> distanceFunction)
Constructor.
|
Constructor and Description |
---|
MetricalIndexKNNQuery(AbstractMTree<O,D,?,?> index,
DistanceQuery<O,D> distanceQuery)
Constructor.
|
MetricalIndexRangeQuery(AbstractMTree<O,D,?,?> index,
DistanceQuery<O,D> distanceQuery)
Constructor.
|
MkTreeRKNNQuery(AbstractMkTree<O,D,?,?> index,
DistanceQuery<O,D> distanceQuery)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
(package private) Assignments<D,E> |
MTreeSplit.balancedPartition(N node,
DBID routingObject1,
DBID routingObject2,
DistanceQuery<O,D> distanceFunction)
Creates a balanced partition of the entries of the specified node.
|
private void |
MLBDistSplit.promote(N node,
DistanceQuery<O,D> distanceFunction)
Selects the second object of the specified node to be promoted and stored
into the parent node and partitions the entries according to the M_LB_DIST
strategy.
|
private void |
MRadSplit.promote(N node,
DistanceQuery<O,D> distanceFunction)
Selects two objects of the specified node to be promoted and stored into
the parent node.
|
Constructor and Description |
---|
MLBDistSplit(N node,
DistanceQuery<O,D> distanceFunction)
Creates a new split object.
|
MRadSplit(N node,
DistanceQuery<O,D> distanceFunction)
Creates a new split object.
|
Modifier and Type | Method and Description |
---|---|
<D extends Distance<D>> |
DeLiCluTreeIndex.getKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
<D extends Distance<D>> |
DeLiCluTreeIndex.getRangeQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
Constructor and Description |
---|
DoubleDistanceRStarTreeKNNQuery(AbstractRStarTree<?,?> tree,
DistanceQuery<O,DoubleDistance> distanceQuery,
SpatialPrimitiveDoubleDistanceFunction<? super O> distanceFunction)
Constructor.
|
DoubleDistanceRStarTreeRangeQuery(AbstractRStarTree<?,?> tree,
DistanceQuery<O,DoubleDistance> distanceQuery,
SpatialPrimitiveDoubleDistanceFunction<? super O> distanceFunction)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
<D extends Distance<D>> |
RStarTreeIndex.getKNNQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |
<D extends Distance<D>> |
RStarTreeIndex.getRangeQuery(DistanceQuery<O,D> distanceQuery,
Object... hints) |