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.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.biclustering |
Biclustering algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation.cash |
Helper classes for the
CASH algorithm. |
de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans |
K-means clustering and variations.
|
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.application.jsmap |
JavaScript based map client - server architecture.
|
de.lmu.ifi.dbs.elki.data.model |
Cluster models classes for various algorithms.
|
de.lmu.ifi.dbs.elki.data.type |
Data type information, also used for type restrictions.
|
de.lmu.ifi.dbs.elki.database.datastore |
General data store layer API (along the lines of
Map<DBID, T> - use everywhere!) |
de.lmu.ifi.dbs.elki.database.datastore.memory |
Memory data store implementation for ELKI.
|
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.distance |
Prepared queries for distances.
|
de.lmu.ifi.dbs.elki.database.relation |
Relations, materialized and virtual (views).
|
de.lmu.ifi.dbs.elki.distance.distancefunction |
Distance functions for use within ELKI.
|
de.lmu.ifi.dbs.elki.distance.distancefunction.external |
Distance functions using external data sources.
|
de.lmu.ifi.dbs.elki.distance.distancefunction.subspace |
Distance functions based on subspaces.
|
de.lmu.ifi.dbs.elki.distance.similarityfunction |
Similarity functions.
|
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 |
Tree-based index structures
|
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.strategies.split |
Splitting strategies of nodes in an M-Tree (and variants).
|
de.lmu.ifi.dbs.elki.index.tree.query |
Classes related to generic tree queries.
|
de.lmu.ifi.dbs.elki.index.tree.spatial |
Tree-based index structures for spatial indexing.
|
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.vafile |
Vector Approximation File
|
de.lmu.ifi.dbs.elki.result.optics |
Result classes for OPTICS.
|
de.lmu.ifi.dbs.elki.utilities.datastructures |
Basic memory structures such as heaps and object hierarchies.
|
de.lmu.ifi.dbs.elki.utilities.datastructures.arraylike |
Common API for accessing objects that are "array-like", including lists, numerical vectors, database vectors and arrays.
|
de.lmu.ifi.dbs.elki.utilities.exceptions |
Exception classes and common exception messages.
|
Modifier and Type | Method and Description |
---|---|
CollectionResult<CTriple<DBID,DBID,Double>> |
MaterializeDistances.run(Database database,
Relation<O> relation)
Iterates over all points in the database.
|
CollectionResult<CTriple<DBID,DBID,Double>> |
MaterializeDistances.run(Database database,
Relation<O> relation)
Iterates over all points in the database.
|
Modifier and Type | Method and Description |
---|---|
private DBID |
DeLiClu.getStartObject(Relation<NV> relation)
Returns the id of the start object for the run method.
|
Modifier and Type | Method and Description |
---|---|
protected void |
AbstractProjectedDBSCAN.expandCluster(LocallyWeightedDistanceFunction.Instance<V> distFunc,
RangeQuery<V,DoubleDistance> rangeQuery,
DBID startObjectID,
FiniteProgress objprog,
IndefiniteProgress clusprog)
ExpandCluster function of DBSCAN.
|
protected void |
SNNClustering.expandCluster(SimilarityQuery<O,IntegerDistance> snnInstance,
DBID startObjectID,
FiniteProgress objprog,
IndefiniteProgress clusprog)
DBSCAN-function expandCluster adapted to SNN criterion.
|
protected void |
OPTICS.expandClusterOrder(ClusterOrderResult<D> clusterOrder,
Database database,
RangeQuery<O,D> rangeQuery,
DBID objectID,
D epsilon,
FiniteProgress progress)
OPTICS-function expandClusterOrder.
|
protected void |
OPTICS.expandClusterOrderDouble(ClusterOrderResult<DoubleDistance> clusterOrder,
Database database,
RangeQuery<O,DoubleDistance> rangeQuery,
DBID objectID,
DoubleDistance epsilon,
FiniteProgress progress)
OPTICS-function expandClusterOrder.
|
protected ArrayModifiableDBIDs |
SNNClustering.findSNNNeighbors(SimilarityQuery<O,IntegerDistance> snnInstance,
DBID queryObject)
Returns the shared nearest neighbors of the specified query object in the
given database.
|
Modifier and Type | Method and Description |
---|---|
protected DBID |
AbstractBiclustering.getRowDBID(int row)
Deprecated.
Expensive!
|
Modifier and Type | Field and Description |
---|---|
private Map<HyperBoundingBox,Map<DBID,Double>> |
CASHIntervalSplit.f_maxima
Caches maximum function values for given intervals, used for better split
performance.
|
private Map<HyperBoundingBox,Map<DBID,Double>> |
CASHIntervalSplit.f_minima
Caches minimum function values for given intervals, used for better split
performance.
|
Modifier and Type | Method and Description |
---|---|
protected double |
KMeansPlusPlusInitialMeans.initialWeights(double[] weights,
ArrayDBIDs ids,
DBID latest,
DistanceQuery<? super V,D> distQ)
Initialize the weight list.
|
protected double |
KMeansPlusPlusInitialMeans.updateWeights(double[] weights,
ArrayDBIDs ids,
DBID latest,
DistanceQuery<? super V,D> distQ)
Update the weight list.
|
protected double |
KMeansPlusPlusInitialMeans.updateWeights(double[] weights,
ArrayDBIDs ids,
DBID latest,
PrimitiveDoubleDistanceFunction<V> distF,
Relation<V> rel)
Update the weight list.
|
Modifier and Type | Method and Description |
---|---|
private Map<DBID,PROCLUS.PROCLUSCluster> |
PROCLUS.assignPoints(Map<DBID,gnu.trove.set.TIntSet> dimensions,
Relation<V> database)
Assigns the objects to the clusters.
|
private Map<DBID,gnu.trove.set.TIntSet> |
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,DistanceDBIDList<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.
|
Modifier and Type | Method and Description |
---|---|
private Map<DBID,PROCLUS.PROCLUSCluster> |
PROCLUS.assignPoints(Map<DBID,gnu.trove.set.TIntSet> dimensions,
Relation<V> database)
Assigns the objects to the clusters.
|
private ModifiableDBIDs |
PROCLUS.computeBadMedoids(Map<DBID,PROCLUS.PROCLUSCluster> clusters,
int threshold)
Computes the bad medoids, where the medoid of a cluster with less than the
specified threshold of objects is bad.
|
private double |
PROCLUS.evaluateClusters(Map<DBID,PROCLUS.PROCLUSCluster> clusters,
Map<DBID,gnu.trove.set.TIntSet> dimensions,
Relation<V> database)
Evaluates the quality of the clusters.
|
private double |
PROCLUS.evaluateClusters(Map<DBID,PROCLUS.PROCLUSCluster> clusters,
Map<DBID,gnu.trove.set.TIntSet> dimensions,
Relation<V> database)
Evaluates the quality of the clusters.
|
Modifier and Type | Field and Description |
---|---|
DBID |
HilOut.HilFeature.id
Object ID
|
Modifier and Type | Method and Description |
---|---|
protected void |
HilOut.HilFeature.insert(DBID id,
double dt,
int k)
insert function inserts a nearest neighbor into a features nn list and
its distance
|
private double |
HilOut.HilbertFeatures.maxDistLevel(DBID id,
int level)
maxDist function calculate the maximal Distance from Vector p to the
border of the corresponding r-region at the given level
|
private double |
HilOut.HilbertFeatures.minDistLevel(DBID id,
int level)
minDist function calculate the minimal Distance from Vector p to the
border of the corresponding r-region at the given level
|
Constructor and Description |
---|
HilOut.HilFeature(DBID id,
ObjectHeap<DoubleDistanceDBIDPair> nn)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
private DBID |
JSONWebServer.stringToDBID(String query)
Parse a string into a DBID.
|
Modifier and Type | Field and Description |
---|---|
private DBID |
MedoidModel.medoid
Cluster medoid
|
Modifier and Type | Method and Description |
---|---|
DBID |
MedoidModel.getMedoid() |
Modifier and Type | Method and Description |
---|---|
void |
MedoidModel.setMedoid(DBID medoid) |
Constructor and Description |
---|
MedoidModel(DBID medoid)
Constructor with medoid
|
Modifier and Type | Field and Description |
---|---|
static SimpleTypeInformation<DBID> |
TypeUtil.DBID
Database IDs.
|
Modifier and Type | Method and Description |
---|---|
DBID |
DBIDDataStore.get(DBIDRef id)
Deprecated.
Use
DBIDDataStore.assignVar(de.lmu.ifi.dbs.elki.database.ids.DBIDRef, de.lmu.ifi.dbs.elki.database.ids.DBIDVar) and a DBIDVar instead, to avoid boxing/unboxing cost. |
DBID |
WritableDBIDDataStore.put(DBIDRef id,
DBID value)
Deprecated.
Use
WritableDBIDDataStore.putDBID(de.lmu.ifi.dbs.elki.database.ids.DBIDRef, de.lmu.ifi.dbs.elki.database.ids.DBIDRef) instead, to avoid boxing/unboxing cost. |
Modifier and Type | Method and Description |
---|---|
DBID |
WritableDBIDDataStore.put(DBIDRef id,
DBID value)
Deprecated.
Use
WritableDBIDDataStore.putDBID(de.lmu.ifi.dbs.elki.database.ids.DBIDRef, de.lmu.ifi.dbs.elki.database.ids.DBIDRef) instead, to avoid boxing/unboxing cost. |
Modifier and Type | Field and Description |
---|---|
private Map<DBID,Object[]> |
MapRecordStore.data
Storage Map.
|
private Map<DBID,T> |
MapStore.data
Storage Map.
|
Modifier and Type | Method and Description |
---|---|
DBID |
MapIntegerDBIDDBIDStore.get(DBIDRef id)
Deprecated.
|
DBID |
ArrayDBIDStore.get(DBIDRef id)
Deprecated.
|
DBID |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
DBID |
ArrayDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
Modifier and Type | Method and Description |
---|---|
DBID |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
DBID |
ArrayDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
Constructor and Description |
---|
MapRecordStore(int rlen,
Map<DBID,Object[]> data)
Constructor with existing data.
|
MapStore(Map<DBID,T> data)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
static DBID |
DBIDUtil.deref(DBIDRef ref)
Dereference a DBID reference.
|
DBID |
DBIDFactory.generateSingleDBID()
Generate a single DBID.
|
static DBID |
DBIDUtil.generateSingleDBID()
Generate a single DBID.
|
DBID |
EmptyDBIDs.get(int i) |
DBID |
ArrayDBIDs.get(int i)
Get the i'th entry (starting at 0)
If possible, use an
DBIDArrayIter via ArrayDBIDs.iter() instead! |
DBID |
DBIDPair.getFirst()
Getter for first
|
DBID |
DBIDPair.getSecond()
Getter for second element in pair
|
DBID |
DoubleDBIDPair.getSecond()
Deprecated.
Avoid autoboxing! Use
DBIDRef interface! |
DBID |
DBIDFactory.importInteger(int id)
Import and integer as DBID.
|
static DBID |
DBIDUtil.importInteger(int id)
Import and integer as DBID.
|
DBID |
ArrayModifiableDBIDs.remove(int i)
Remove the i'th entry (starting at 0)
|
DBID |
ArrayModifiableDBIDs.set(int i,
DBIDRef newval)
Replace the i'th entry (starting at 0)
|
Modifier and Type | Method and Description |
---|---|
ByteBufferSerializer<DBID> |
DBIDFactory.getDBIDSerializer()
Get a serializer for DBIDs.
|
static ByteBufferSerializer<DBID> |
DBIDUtil.getDBIDSerializer()
Get a serializer for DBIDs.
|
FixedSizeByteBufferSerializer<DBID> |
DBIDFactory.getDBIDSerializerStatic()
Get a serializer for DBIDs with static size.
|
static ByteBufferSerializer<DBID> |
DBIDUtil.getDBIDSerializerStatic()
Get a serializer for DBIDs with static size.
|
Class<? extends DBID> |
DBIDFactory.getTypeRestriction()
Get type restriction.
|
Modifier and Type | Method and Description |
---|---|
static void |
DBIDUtil.deallocateSingleDBID(DBID id)
Return a single DBID for reuse.
|
Modifier and Type | Field and Description |
---|---|
(package private) DBID |
DBIDIterAdapter.cur
Current DBID.
|
Modifier and Type | Field and Description |
---|---|
(package private) Iterator<DBID> |
DBIDIterAdapter.iter
The real iterator.
|
Modifier and Type | Method and Description |
---|---|
DBID |
UnmodifiableArrayDBIDs.get(int i) |
Constructor and Description |
---|
DBIDIterAdapter(Iterator<DBID> iter)
Constructor.
|
Modifier and Type | Class and Description |
---|---|
(package private) class |
IntegerDBID
Database ID object.
|
Modifier and Type | Field and Description |
---|---|
(package private) DBID |
AbstractIntegerDBIDFactory.invalid
Invalid ID.
|
Modifier and Type | Field and Description |
---|---|
static ByteBufferSerializer<DBID> |
IntegerDBID.DYNAMIC_SERIALIZER
The public instance to use for dynamic serialization.
|
static FixedSizeByteBufferSerializer<DBID> |
IntegerDBID.STATIC_SERIALIZER
The public instance to use for static serialization.
|
Modifier and Type | Method and Description |
---|---|
DBID |
IntegerDBID.DynamicSerializer.fromByteBuffer(ByteBuffer buffer) |
DBID |
IntegerDBID.StaticSerializer.fromByteBuffer(ByteBuffer buffer) |
DBID |
TrivialDBIDFactory.generateSingleDBID() |
DBID |
ReusingDBIDFactory.generateSingleDBID() |
DBID |
SimpleDBIDFactory.generateSingleDBID() |
DBID |
UnmodifiableIntegerArrayDBIDs.get(int i) |
DBID |
IntegerDBID.get(int i) |
DBID |
IntegerDBIDVar.get(int i) |
DBID |
IntegerDBIDRange.get(int i) |
DBID |
ArrayModifiableIntegerDBIDs.get(int i) |
DBID |
ArrayModifiableIntegerDBIDs.Slice.get(int i) |
DBID |
ArrayStaticIntegerDBIDs.get(int i) |
DBID |
ArrayStaticIntegerDBIDs.Slice.get(int i) |
DBID |
IntegerDoubleDBIDPair.getSecond()
Deprecated.
|
DBID |
AbstractIntegerDBIDFactory.importInteger(int id) |
DBID |
ArrayModifiableIntegerDBIDs.remove(int index) |
DBID |
ArrayModifiableIntegerDBIDs.set(int index,
DBIDRef element) |
Modifier and Type | Method and Description |
---|---|
ByteBufferSerializer<DBID> |
AbstractIntegerDBIDFactory.getDBIDSerializer() |
FixedSizeByteBufferSerializer<DBID> |
AbstractIntegerDBIDFactory.getDBIDSerializerStatic() |
Class<? extends DBID> |
AbstractIntegerDBIDFactory.getTypeRestriction() |
Modifier and Type | Method and Description |
---|---|
int |
IntegerDBID.DynamicSerializer.getByteSize(DBID object) |
int |
IntegerDBID.StaticSerializer.getByteSize(DBID object) |
void |
IntegerDBID.DynamicSerializer.toByteBuffer(ByteBuffer buffer,
DBID object) |
void |
IntegerDBID.StaticSerializer.toByteBuffer(ByteBuffer buffer,
DBID object) |
Modifier and Type | Method and Description |
---|---|
D |
SpatialPrimitiveDistanceQuery.minDist(SpatialComparable mbr,
DBID id) |
D |
SpatialDistanceQuery.minDist(SpatialComparable mbr,
DBID id)
Computes the minimum distance between the given MBR and the FeatureVector
object according to this distance function.
|
Constructor and Description |
---|
DBIDDistanceQuery(Relation<DBID> relation,
DBIDDistanceFunction<D> distanceFunction)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
DBID |
DBIDView.get(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
SimpleTypeInformation<DBID> |
DBIDView.getDataTypeInformation() |
Modifier and Type | Method and Description |
---|---|
void |
DBIDView.set(DBIDRef id,
DBID val) |
Modifier and Type | Method and Description |
---|---|
<O extends DBID> |
AbstractDBIDDistanceFunction.instantiate(Relation<O> database) |
Modifier and Type | Method and Description |
---|---|
SimpleTypeInformation<DBID> |
AbstractDBIDDistanceFunction.getInputTypeRestriction() |
Modifier and Type | Method and Description |
---|---|
private void |
NumberDistanceParser.put(DBID id1,
DBID id2,
D distance,
Map<DBIDPair,D> cache)
Puts the specified distance value for the given ids to the distance cache.
|
Modifier and Type | Method and Description |
---|---|
double |
AbstractPreferenceVectorBasedCorrelationDistanceFunction.Instance.weightedDistance(DBID id1,
DBID id2,
BitSet weightVector)
Computes the weighted distance between the two specified vectors
according to the given preference vector.
|
double |
AbstractPreferenceVectorBasedCorrelationDistanceFunction.Instance.weightedPrefereneceVectorDistance(DBID id1,
DBID id2)
Computes the weighted distance between the two specified data vectors
according to their preference vectors.
|
Modifier and Type | Field and Description |
---|---|
protected Relation<? extends DBID> |
AbstractDBIDSimilarityFunction.database
The database we work on
|
Modifier and Type | Method and Description |
---|---|
D |
DBIDSimilarityFunction.similarity(DBID id1,
DBID id2)
Computes the similarity between two given DatabaseObjects according to this
similarity function.
|
Constructor and Description |
---|
AbstractDBIDSimilarityFunction(Relation<? extends DBID> database)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
protected O |
AbstractRefiningIndex.refine(DBID id)
Refine a given object (and count the refinement!).
|
protected D |
AbstractRefiningIndex.AbstractKNNQuery.refine(DBID id,
O q)
Refinement distance computation.
|
Modifier and Type | Method and Description |
---|---|
KNNList<D> |
MaterializeKNNAndRKNNPreprocessor.getKNN(DBID id)
Returns the materialized kNNs of the specified id.
|
Modifier and Type | Field and Description |
---|---|
private DBID |
AbstractLeafEntry.id
Holds the id of the object (node or data object) represented by this entry.
|
Modifier and Type | Method and Description |
---|---|
DBID |
AbstractLeafEntry.getDBID() |
DBID |
LeafEntry.getDBID()
Get the DBID of this leaf entry.
|
Constructor and Description |
---|
AbstractLeafEntry(DBID id)
Provides a new AbstractEntry with the specified id.
|
Modifier and Type | Field and Description |
---|---|
private DBID |
MTreeDirectoryEntry.routingObjectID
The id of routing object of this entry.
|
Modifier and Type | Method and Description |
---|---|
DBID |
MTreeLeafEntry.getRoutingObjectID()
Returns the id of the underlying data object of this entry.
|
DBID |
MTreeEntry.getRoutingObjectID()
Returns the id of the underlying database object of this entry, if this
entry is a leaf entry, the id of the routing object, otherwise.
|
DBID |
MTreeDirectoryEntry.getRoutingObjectID()
Returns the id of the routing object of this entry.
|
Modifier and Type | Method and Description |
---|---|
void |
AbstractMTreeNode.adjustEntry(E entry,
DBID routingObjectID,
double parentDistance,
AbstractMTree<O,D,N,E,?> mTree)
Adjusts the parameters of the entry representing this node (e.g. after
insertion of new objects).
|
double |
AbstractMTreeNode.coveringRadius(DBID routingObjectID,
AbstractMTree<O,D,N,E,?> mTree)
Determines and returns the covering radius of this node.
|
protected abstract E |
AbstractMTree.createNewDirectoryEntry(N node,
DBID routingObjectID,
double parentDistance)
Creates a new directory entry representing the specified node.
|
private IndexTreePath<E> |
AbstractMTree.createNewRoot(N oldRoot,
N newNode,
DBID firstRoutingObjectID,
DBID secondRoutingObjectID)
Creates a new root node that points to the two specified child nodes and
return the path to the new root.
|
protected List<DoubleIntPair> |
AbstractMTree.getSortedEntries(N node,
DBID q)
Sorts the entries of the specified node according to their minimum distance
to the specified object.
|
void |
MTreeLeafEntry.setRoutingObjectID(DBID objectID)
todo ok
|
void |
MTreeEntry.setRoutingObjectID(DBID objectID)
Sets the id of the underlying database object of this entry, if this entry
is a leaf entry, the id of the routing object, otherwise.
|
void |
MTreeDirectoryEntry.setRoutingObjectID(DBID objectID)
Sets the id of the routing object of this entry.
|
Constructor and Description |
---|
MTreeDirectoryEntry(DBID objectID,
double parentDistance,
Integer nodeID,
double coveringRadius)
Provides a new MTreeDirectoryEntry with the given parameters.
|
MTreeLeafEntry(DBID objectID,
double parentDistance)
Provides a new MTreeLeafEntry object with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
protected Map<DBID,KNNList<D>> |
AbstractMkTree.batchNN(N node,
DBIDs ids,
int kmax)
Deprecated.
Change to use by-object NN lookups instead.
|
Modifier and Type | Method and Description |
---|---|
protected abstract void |
AbstractMkTreeUnified.kNNdistanceAdjustment(E entry,
Map<DBID,KNNList<D>> knnLists)
Performs a distance adjustment in the subtree of the specified root entry.
|
Modifier and Type | Method and Description |
---|---|
void |
MkAppTreeNode.adjustEntry(MkAppEntry entry,
DBID routingObjectID,
double parentDistance,
AbstractMTree<O,D,MkAppTreeNode<O,D>,MkAppEntry,?> mTree)
Adjusts the parameters of the entry representing this node.
|
protected MkAppEntry |
MkAppTree.createNewDirectoryEntry(MkAppTreeNode<O,D> node,
DBID routingObjectID,
double parentDistance)
Creates a new directory entry representing the specified node.
|
protected MkAppEntry |
MkAppTreeIndex.createNewLeafEntry(DBID id,
O object,
double parentDistance)
Creates a new leaf entry representing the specified data object in the
specified subtree.
|
Modifier and Type | Method and Description |
---|---|
private void |
MkAppTree.adjustApproximatedKNNDistances(MkAppEntry entry,
Map<DBID,KNNList<D>> knnLists)
Adjusts the knn distance in the subtree of the specified root entry.
|
private List<D> |
MkAppTree.getMeanKNNList(DBIDs ids,
Map<DBID,KNNList<D>> knnLists) |
Constructor and Description |
---|
MkAppDirectoryEntry(DBID objectID,
double parentDistance,
Integer nodeID,
double coveringRadius,
PolynomialApproximation approximation)
Provides a new MkCoPDirectoryEntry with the given parameters.
|
MkAppLeafEntry(DBID objectID,
double parentDistance,
PolynomialApproximation approximation)
Provides a new MkAppLeafEntry with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
void |
MkCoPTreeNode.adjustEntry(MkCoPEntry entry,
DBID routingObjectID,
double parentDistance,
AbstractMTree<O,D,MkCoPTreeNode<O,D>,MkCoPEntry,?> mTree) |
protected MkCoPEntry |
MkCoPTree.createNewDirectoryEntry(MkCoPTreeNode<O,D> node,
DBID routingObjectID,
double parentDistance)
Creates a new directory entry representing the specified node.
|
protected MkCoPEntry |
MkCoPTreeIndex.createNewLeafEntry(DBID id,
O object,
double parentDistance)
Creates a new leaf entry representing the specified data object in the
specified subtree.
|
Modifier and Type | Method and Description |
---|---|
private void |
MkCoPTree.adjustApproximatedKNNDistances(MkCoPEntry entry,
Map<DBID,KNNList<D>> knnLists)
Adjusts the knn distance in the subtree of the specified root entry.
|
Constructor and Description |
---|
MkCoPDirectoryEntry(DBID objectID,
double parentDistance,
Integer nodeID,
double coveringRadius,
ApproximationLine conservativeApproximation)
Provides a new MkCoPDirectoryEntry with the given parameters.
|
MkCoPLeafEntry(DBID objectID,
double parentDistance,
ApproximationLine conservativeApproximation,
ApproximationLine progressiveApproximation)
Provides a new MkCoPLeafEntry with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
void |
MkMaxTreeNode.adjustEntry(MkMaxEntry entry,
DBID routingObjectID,
double parentDistance,
AbstractMTree<O,D,MkMaxTreeNode<O,D>,MkMaxEntry,?> mTree)
Calls the super method and adjust additionally the k-nearest neighbor
distance of this node as the maximum of the k-nearest neighbor distances of
all its entries.
|
protected MkMaxEntry |
MkMaxTree.createNewDirectoryEntry(MkMaxTreeNode<O,D> node,
DBID routingObjectID,
double parentDistance) |
protected MkMaxLeafEntry |
MkMaxTreeIndex.createNewLeafEntry(DBID id,
O object,
double parentDistance) |
Modifier and Type | Method and Description |
---|---|
protected void |
MkMaxTree.kNNdistanceAdjustment(MkMaxEntry entry,
Map<DBID,KNNList<D>> knnLists)
Adjusts the knn distance in the subtree of the specified root entry.
|
Constructor and Description |
---|
MkMaxDirectoryEntry(DBID objectID,
double parentDistance,
Integer nodeID,
double coveringRadius,
double knnDistance)
Provides a new MkMaxDirectoryEntry with the given parameters.
|
MkMaxLeafEntry(DBID objectID,
double parentDistance,
double knnDistance)
Provides a new MkMaxLeafEntry with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
void |
MkTabTreeNode.adjustEntry(MkTabEntry entry,
DBID routingObjectID,
double parentDistance,
AbstractMTree<O,D,MkTabTreeNode<O,D>,MkTabEntry,?> mTree) |
protected MkTabEntry |
MkTabTree.createNewDirectoryEntry(MkTabTreeNode<O,D> node,
DBID routingObjectID,
double parentDistance)
Creates a new directory entry representing the specified node.
|
protected MkTabEntry |
MkTabTreeIndex.createNewLeafEntry(DBID id,
O object,
double parentDistance)
Creates a new leaf entry representing the specified data object in the
specified subtree.
|
Modifier and Type | Method and Description |
---|---|
protected void |
MkTabTree.kNNdistanceAdjustment(MkTabEntry entry,
Map<DBID,KNNList<D>> knnLists) |
Constructor and Description |
---|
MkTabDirectoryEntry(DBID objectID,
double parentDistance,
Integer nodeID,
double coveringRadius,
double[] knnDistances)
Provides a new MkMaxDirectoryEntry with the given parameters.
|
MkTabLeafEntry(DBID objectID,
double parentDistance,
double[] knnDistances)
Provides a new MkMaxLeafEntry with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
protected MTreeEntry |
MTree.createNewDirectoryEntry(MTreeNode<O,D> node,
DBID routingObjectID,
double parentDistance) |
protected MTreeEntry |
MTreeIndex.createNewLeafEntry(DBID id,
O object,
double parentDistance) |
Modifier and Type | Method and Description |
---|---|
private void |
MetricalIndexRangeQuery.doRangeQuery(DBID o_p,
AbstractMTreeNode<O,D,?,?> node,
O q,
D r_q,
GenericDistanceDBIDList<D> result)
Performs a range query on the specified subtree.
|
private void |
DoubleDistanceMetricalIndexRangeQuery.doRangeQuery(DBID id_p,
AbstractMTreeNode<O,DoubleDistance,?,?> node,
O q,
double r_q,
ModifiableDoubleDistanceDBIDList result)
Performs a range query on the specified subtree.
|
Modifier and Type | Field and Description |
---|---|
private DBID |
Assignments.id1
The id of the first routing object.
|
private DBID |
Assignments.id2
The id of the second routing object.
|
Modifier and Type | Method and Description |
---|---|
DBID |
Assignments.getFirstRoutingObject()
Returns the id of the first routing object.
|
DBID |
Assignments.getSecondRoutingObject()
Returns the id of the second routing object.
|
Modifier and Type | Method and Description |
---|---|
(package private) Assignments<E> |
MTreeSplit.balancedPartition(AbstractMTree<O,D,N,E,?> tree,
N node,
DBID routingObject1,
DBID routingObject2)
Creates a balanced partition of the entries of the specified node.
|
Constructor and Description |
---|
Assignments(DBID id1,
DBID id2,
double firstCoveringRadius,
double secondCoveringRadius,
List<DistanceEntry<E>> firstAssignments,
List<DistanceEntry<E>> secondAssignments)
Provides an assignment during a split of an MTree node.
|
Modifier and Type | Field and Description |
---|---|
DBID |
GenericMTreeDistanceSearchCandidate.routingObjectID
The id of the routing object.
|
DBID |
DoubleMTreeDistanceSearchCandidate.routingObjectID
The id of the routing object.
|
Constructor and Description |
---|
DoubleMTreeDistanceSearchCandidate(double mindist,
int nodeID,
DBID routingObjectID,
double routingDistance)
Creates a new heap node with the specified parameters.
|
GenericMTreeDistanceSearchCandidate(double mindist,
int nodeID,
DBID routingObjectID)
Creates a new heap node with the specified parameters.
|
Constructor and Description |
---|
SpatialPointLeafEntry(DBID id,
double[] values)
Constructs a new LeafEntry object with the given parameters.
|
SpatialPointLeafEntry(DBID id,
NumberVector<?> vector)
Constructor from number vector.
|
Modifier and Type | Method and Description |
---|---|
protected DeLiCluLeafEntry |
DeLiCluTreeIndex.createNewLeafEntry(DBID id)
Creates a new leaf entry representing the specified data object.
|
List<TreeIndexPathComponent<DeLiCluEntry>> |
DeLiCluTreeIndex.setHandled(DBID id,
O obj)
Marks the specified object as handled and returns the path of node ids from
the root to the objects's parent.
|
Constructor and Description |
---|
DeLiCluLeafEntry(DBID id,
NumberVector<?> vector)
Constructs a new LeafEntry object with the given parameters.
|
Modifier and Type | Method and Description |
---|---|
protected void |
DoubleDistanceRStarTreeKNNQuery.batchNN(AbstractRStarTreeNode<?,?> node,
Map<DBID,DoubleDistanceKNNHeap> knnLists)
Performs a batch knn query.
|
protected void |
GenericRStarTreeKNNQuery.batchNN(AbstractRStarTreeNode<?,?> node,
Map<DBID,KNNHeap<D>> knnLists)
Performs a batch knn query.
|
Modifier and Type | Field and Description |
---|---|
protected DBID |
VectorApproximation.id
Object represented by this approximation
|
Modifier and Type | Method and Description |
---|---|
DBID |
PartialVAFile.PartialVACandidate.getId() |
DBID |
VectorApproximation.getId() |
Modifier and Type | Method and Description |
---|---|
VectorApproximation |
VAFile.calculateApproximation(DBID id,
V dv)
Calculate the VA file position given the existing borders.
|
protected VectorApproximation |
PartialVAFile.calculateFullApproximation(DBID id,
V dv)
Calculate the VA file position given the existing borders.
|
protected static VectorApproximation |
PartialVAFile.calculatePartialApproximation(DBID id,
NumberVector<?> dv,
List<DoubleObjPair<DAFile>> daFiles)
Calculate partial vector approximation.
|
Constructor and Description |
---|
VectorApproximation(DBID id,
int[] approximation)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
private DBID |
DoubleDistanceClusterOrderEntry.objectID
The id of the entry.
|
private DBID |
GenericClusterOrderEntry.objectID
The id of the entry.
|
private DBID |
DoubleDistanceClusterOrderEntry.predecessorID
The id of the entry's predecessor.
|
private DBID |
GenericClusterOrderEntry.predecessorID
The id of the entry's predecessor.
|
Modifier and Type | Method and Description |
---|---|
DBID |
ClusterOrderResult.PredecessorAdapter.get(DBIDRef objID) |
DBID |
DoubleDistanceClusterOrderEntry.getID()
Returns the object id of this entry.
|
DBID |
ClusterOrderEntry.getID()
Returns the object id of this entry.
|
DBID |
GenericClusterOrderEntry.getID()
Returns the object id of this entry.
|
DBID |
DoubleDistanceClusterOrderEntry.getPredecessorID()
Returns the id of the predecessor of this entry if this entry has a
predecessor, null otherwise.
|
DBID |
ClusterOrderEntry.getPredecessorID()
Returns the id of the predecessor of this entry if this entry has a
predecessor, null otherwise.
|
DBID |
GenericClusterOrderEntry.getPredecessorID()
Returns the id of the predecessor of this entry if this entry has a
predecessor, null otherwise.
|
Modifier and Type | Method and Description |
---|---|
SimpleTypeInformation<DBID> |
ClusterOrderResult.PredecessorAdapter.getDataTypeInformation() |
Modifier and Type | Method and Description |
---|---|
void |
ClusterOrderResult.add(DBID id,
DBID predecessor,
D reachability)
Add an object to the cluster order.
|
void |
ClusterOrderResult.PredecessorAdapter.set(DBIDRef id,
DBID val) |
Constructor and Description |
---|
DoubleDistanceClusterOrderEntry(DBID objectID,
DBID predecessorID,
double reachability)
Creates a new entry in a cluster order with the specified parameters.
|
GenericClusterOrderEntry(DBID objectID,
DBID predecessorID,
D reachability)
Creates a new entry in a cluster order with the specified parameters.
|
Modifier and Type | Method and Description |
---|---|
static DBID |
QuickSelect.median(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator)
Compute the median of an array efficiently using the QuickSelect method.
|
static DBID |
QuickSelect.median(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
int begin,
int end)
Compute the median of an array efficiently using the QuickSelect method.
|
static DBID |
QuickSelect.quantile(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
double quant)
Compute the median of an array efficiently using the QuickSelect method.
|
static DBID |
QuickSelect.quantile(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
int begin,
int end,
double quant)
Compute the median of an array efficiently using the QuickSelect method.
|
static DBID |
QuickSelect.quickSelect(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
int rank)
QuickSelect is essentially quicksort, except that we only "sort" that half
of the array that we are interested in.
|
Modifier and Type | Method and Description |
---|---|
DBID |
ArrayDBIDsAdapter.get(ArrayDBIDs array,
int off) |
Constructor and Description |
---|
ObjectNotFoundException(DBID id)
Object
|