Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.correlation |
Correlation clustering algorithms
|
de.lmu.ifi.dbs.elki.algorithm.clustering.gdbscan |
Generalized DBSCAN.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical |
Hierarchical agglomerative clustering (HAC).
|
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical.extraction |
Extraction of partitional clusterings from hierarchical results.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.kmeans.parallel |
Parallelized implementations of k-means.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.optics |
OPTICS family of 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.clustering.subspace.clique |
Helper classes for the
CLIQUE algorithm. |
de.lmu.ifi.dbs.elki.algorithm.clustering.trivial |
Trivial clustering algorithms: all in one, no clusters, label clusterings
These methods are mostly useful for providing a reference result in evaluation.
|
de.lmu.ifi.dbs.elki.algorithm.clustering.uncertain |
Clustering algorithms for uncertain data.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.anglebased |
Angle-based outlier detection algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.distance.parallel |
Parallel implementations of distance-based outlier detectors.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.lof |
LOF family of outlier detection algorithms.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.lof.parallel |
Parallelized variants of LOF.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood |
Spatial outlier neighborhood classes
|
de.lmu.ifi.dbs.elki.algorithm.outlier.spatial.neighborhood.weighted |
Weighted Neighborhood definitions.
|
de.lmu.ifi.dbs.elki.algorithm.outlier.subspace |
Subspace outlier detection methods.
|
de.lmu.ifi.dbs.elki.application.jsmap |
JavaScript based map client - server architecture.
|
de.lmu.ifi.dbs.elki.data |
Basic classes for different data types, database object types and label types.
|
de.lmu.ifi.dbs.elki.database |
ELKI database layer - loading, storing, indexing and accessing data
|
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.query.knn |
Prepared queries for k nearest neighbor (kNN) queries.
|
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.database.query.rknn |
Prepared queries for reverse k nearest neighbor (rkNN) queries.
|
de.lmu.ifi.dbs.elki.database.query.similarity |
Prepared queries for similarity functions.
|
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.adapter |
Distance functions deriving distances from e.g. similarity measures
|
de.lmu.ifi.dbs.elki.distance.similarityfunction |
Similarity functions.
|
de.lmu.ifi.dbs.elki.distance.similarityfunction.kernel |
Kernel functions.
|
de.lmu.ifi.dbs.elki.evaluation.scores.adapter |
Adapter classes for ranking and scoring measures.
|
de.lmu.ifi.dbs.elki.index |
Index structure implementations
|
de.lmu.ifi.dbs.elki.index.distancematrix |
Precomputed distance matrix.
|
de.lmu.ifi.dbs.elki.index.invertedlist |
Indexes using inverted lists.
|
de.lmu.ifi.dbs.elki.index.preprocessed |
Index structure based on preprocessors
|
de.lmu.ifi.dbs.elki.index.preprocessed.knn |
Indexes providing KNN and rKNN data.
|
de.lmu.ifi.dbs.elki.index.preprocessed.localpca |
Index using a preprocessed local PCA.
|
de.lmu.ifi.dbs.elki.index.preprocessed.preference |
Indexes storing preference vectors.
|
de.lmu.ifi.dbs.elki.index.preprocessed.snn |
Indexes providing nearest neighbor sets
|
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 |
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.spatial.kd |
K-d-tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants |
R*-Tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.flat | |
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.tree.spatial.rstarvariants.rstar | |
de.lmu.ifi.dbs.elki.parallel.processor |
Processor API of ELKI, and some essential shared processors.
|
de.lmu.ifi.dbs.elki.result |
Result types, representation and handling
|
de.lmu.ifi.dbs.elki.result.textwriter |
Text serialization (CSV, Gnuplot, Console, ...)
|
de.lmu.ifi.dbs.elki.utilities.datastructures |
Basic memory structures such as heaps and object hierarchies.
|
de.lmu.ifi.dbs.elki.visualization.style |
Style management for ELKI visualizations.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.pairsegments |
Visualizers for inspecting cluster differences using pair counting segments.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.parallel |
Visualizers based on parallel coordinates.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.parallel.selection |
Visualizers for object selection based on parallel projections.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot |
Visualizers based on scatterplots.
|
de.lmu.ifi.dbs.elki.visualization.visualizers.scatterplot.outlier |
Visualizers for outlier scores based on 2D projections.
|
tutorial.clustering |
Classes from the tutorial on implementing a custom k-means variation.
|
Modifier and Type | Method and Description |
---|---|
protected void |
DBSCAN.expandCluster(Relation<O> relation,
RangeQuery<O> rangeQuery,
DBIDRef startObjectID,
FiniteProgress objprog,
IndefiniteProgress clusprog)
DBSCAN-function expandCluster.
|
protected void |
SNNClustering.expandCluster(SimilarityQuery<O> snnInstance,
DBIDRef startObjectID,
FiniteProgress objprog,
IndefiniteProgress clusprog)
DBSCAN-function expandCluster adapted to SNN criterion.
|
protected ArrayModifiableDBIDs |
SNNClustering.findSNNNeighbors(SimilarityQuery<O> snnInstance,
DBIDRef queryObject)
Returns the shared nearest neighbors of the specified query object in the
given database.
|
Modifier and Type | Field and Description |
---|---|
(package private) Comparator<DBIDRef> |
HiCO.Instance.tmpcomp
Sort object by the temporary fields.
|
Modifier and Type | Method and Description |
---|---|
int |
HiCO.Instance.compare(DBIDRef o1,
DBIDRef o2) |
int |
HiCO.Instance.Sorter.compare(DBIDRef o1,
DBIDRef o2) |
protected void |
HiCO.Instance.expandDBID(DBIDRef id) |
protected void |
HiCO.Instance.initialDBID(DBIDRef id) |
Constructor and Description |
---|
ORCLUSCluster(V o,
DBIDRef id,
NumberVector.Factory<V> factory)
Creates a new cluster containing the specified object o.
|
Modifier and Type | Method and Description |
---|---|
protected abstract M |
AbstractRangeQueryNeighborPredicate.computeLocalModel(DBIDRef id,
DoubleDBIDList neighbors,
Relation<O> relation)
Method to compute the actual data model.
|
protected PreDeConNeighborPredicate.PreDeConModel |
FourCNeighborPredicate.computeLocalModel(DBIDRef id,
DoubleDBIDList neighbors,
Relation<V> relation) |
protected PreDeConNeighborPredicate.PreDeConModel |
PreDeConNeighborPredicate.computeLocalModel(DBIDRef id,
DoubleDBIDList neighbors,
Relation<V> relation) |
protected COPACNeighborPredicate.COPACModel |
COPACNeighborPredicate.computeLocalModel(DBIDRef id,
DoubleDBIDList knnneighbors,
Relation<V> relation)
COPAC model computation
|
boolean |
COPACNeighborPredicate.COPACModel.contains(DBIDRef o) |
int |
ERiCNeighborPredicate.Instance.dimensionality(DBIDRef id)
Get the correlation dimensionality of a single object.
|
int |
COPACNeighborPredicate.Instance.dimensionality(DBIDRef id)
Get the correlation dimensionality of a single object.
|
protected int |
GeneralizedDBSCAN.Instance.expandCluster(DBIDRef seed,
int clusterid,
WritableIntegerDataStore clusterids,
T neighbors,
ArrayModifiableDBIDs activeSet,
FiniteProgress progress)
Set-based expand cluster implementation.
|
T |
NeighborPredicate.Instance.getNeighbors(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
DBIDs |
ERiCNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
PreDeConNeighborPredicate.PreDeConModel |
FourCNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
DoubleDBIDList |
EpsilonNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
PreDeConNeighborPredicate.PreDeConModel |
PreDeConNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
COPACNeighborPredicate.COPACModel |
COPACNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
boolean |
MinPtsCorePredicate.Instance.isCorePoint(DBIDRef point,
DBIDs neighbors) |
boolean |
FourCCorePredicate.Instance.isCorePoint(DBIDRef point,
PreDeConNeighborPredicate.PreDeConModel model) |
boolean |
PreDeConCorePredicate.Instance.isCorePoint(DBIDRef point,
PreDeConNeighborPredicate.PreDeConModel model) |
boolean |
CorePredicate.Instance.isCorePoint(DBIDRef point,
T neighbors)
Decide whether the point is a core point, based on its neighborhood.
|
protected int |
GeneralizedDBSCAN.Instance.processCorePoint(DBIDRef seed,
T newneighbors,
int clusterid,
WritableIntegerDataStore clusterids,
ArrayModifiableDBIDs activeSet)
Process a single core point.
|
Modifier and Type | Method and Description |
---|---|
private void |
CLINK.clinkstep3(DBIDRef id,
DBIDArrayIter i,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
Third step: Determine the values for P and L
|
private void |
CLINK.clinkstep4567(DBIDRef id,
ArrayDBIDs ids,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
Fourth to seventh step of CLINK: find best insertion
|
private void |
CLINK.clinkstep8(DBIDRef id,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
Update hierarchy.
|
protected void |
SLINK.process(DBIDRef id,
ArrayDBIDs ids,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
SLINK main loop.
|
protected void |
CLINK.process(DBIDRef id,
ArrayDBIDs ids,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
CLINK main loop, based on the SLINK main loop.
|
private void |
SLINK.slinkstep3(DBIDRef id,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableDoubleDataStore m)
Third step: Determine the values for P and L
|
private void |
SLINK.slinkstep4(DBIDRef id,
DBIDArrayIter it,
int n,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda)
Fourth step: Actualize the clusters if necessary
|
private void |
SLINKHDBSCANLinearMemory.step1(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda)
First step: Initialize P(id) = id, L(id) = infinity.
|
private void |
SLINK.step2(DBIDRef id,
DBIDArrayIter it,
int n,
DistanceQuery<? super O> distQuery,
WritableDoubleDataStore m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
private void |
SLINKHDBSCANLinearMemory.step2(DBIDRef id,
DBIDs processedIDs,
DistanceQuery<? super O> distQuery,
DoubleDataStore coredists,
WritableDoubleDataStore m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
private void |
SLINK.step2primitive(DBIDRef id,
DBIDArrayIter it,
int n,
Relation<? extends O> relation,
PrimitiveDistanceFunction<? super O> distFunc,
WritableDoubleDataStore m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
private void |
SLINKHDBSCANLinearMemory.step3(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
DBIDs processedIDs,
WritableDoubleDataStore m)
Third step: Determine the values for P and L
|
private void |
SLINKHDBSCANLinearMemory.step4(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
DBIDs processedIDs)
Fourth step: Actualize the clusters if necessary
|
Modifier and Type | Method and Description |
---|---|
void |
SimplifiedHierarchyExtraction.TempCluster.add(DBIDRef id)
Add new objects to the cluster.
|
private void |
SimplifiedHierarchyExtraction.addSingleton(SimplifiedHierarchyExtraction.TempCluster clus,
DBIDRef id,
double dist,
boolean asCluster)
Add a singleton object, as point or cluster.
|
HDBSCANHierarchyExtraction.TempCluster |
HDBSCANHierarchyExtraction.TempCluster.grow(double dist,
DBIDRef id)
Add new objects to the cluster.
|
HDBSCANHierarchyExtraction.TempCluster |
HDBSCANHierarchyExtraction.TempCluster.grow(double dist,
HDBSCANHierarchyExtraction.TempCluster other,
DBIDRef id)
Join the contents of another cluster.
|
private Cluster<DendrogramModel> |
ExtractFlatClusteringFromHierarchy.makeCluster(DBIDRef lead,
double depth,
DBIDs members)
Make the cluster for the given object
|
private Cluster<DendrogramModel> |
SimplifiedHierarchyExtraction.makeSingletonCluster(DBIDRef lead,
double depth)
Make the cluster for the given object
|
private Cluster<DendrogramModel> |
SimplifiedHierarchyExtraction.TempCluster.toCluster(Clustering<DendrogramModel> clustering,
DBIDRef lead)
Make the cluster for the given object
|
Constructor and Description |
---|
TempCluster(double dist,
DBIDRef a)
Constructor.
|
TempCluster(double dist,
DBIDRef a,
DBIDRef b)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
void |
KMeansProcessor.Instance.map(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
void |
ClusterOrder.add(DBIDRef id,
double reach,
DBIDRef pre)
Add an object to the cluster order.
|
int |
GeneralizedOPTICS.Instance.compare(DBIDRef o1,
DBIDRef o2) |
protected void |
OPTICSList.Instance.expandClusterOrder(DBIDRef objectID)
OPTICS-function expandClusterOrder.
|
protected void |
OPTICSHeap.Instance.expandClusterOrder(DBIDRef objectID)
OPTICS-function expandClusterOrder.
|
protected abstract void |
GeneralizedOPTICS.Instance.expandDBID(DBIDRef id)
Add the current DBID to the cluster order, and expand its neighbors if
minPts and similar conditions are satisfied.
|
int |
CorrelationClusterOrder.getCorrelationValue(DBIDRef id)
Get the correlation dimensionality.
|
double |
CorrelationClusterOrder.getEuclideanValue(DBIDRef id)
Get the Euclidean distance in the orthogonal space.
|
void |
ClusterOrder.getPredecessor(DBIDRef id,
DBIDVar out)
Get the predecessor.
|
double |
ClusterOrder.getReachability(DBIDRef id)
Get the reachability of an object.
|
protected abstract void |
GeneralizedOPTICS.Instance.initialDBID(DBIDRef id)
Initialize for a new DBID.
|
Modifier and Type | Field and Description |
---|---|
(package private) Comparator<DBIDRef> |
DiSH.Instance.tmpcomp
Sort object by the temporary fields.
|
Modifier and Type | Method and Description |
---|---|
int |
DiSH.Instance.compare(DBIDRef o1,
DBIDRef o2) |
int |
DiSH.Instance.Sorter.compare(DBIDRef o1,
DBIDRef o2) |
int |
HiSC.Instance.compare(DBIDRef o1,
DBIDRef o2) |
protected void |
DiSH.Instance.expandDBID(DBIDRef id) |
protected void |
HiSC.Instance.expandDBID(DBIDRef id) |
long[] |
DiSH.DiSHClusterOrder.getCommonPreferenceVector(DBIDRef id)
Get the common subspace.
|
protected void |
DiSH.Instance.initialDBID(DBIDRef id) |
protected void |
HiSC.Instance.initialDBID(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
boolean |
CLIQUEUnit.addFeatureVector(DBIDRef id,
V vector)
Adds the id of the specified feature vector to this unit, if this unit
contains the feature vector.
|
Modifier and Type | Method and Description |
---|---|
private void |
ByLabelHierarchicalClustering.assign(HashMap<String,DBIDs> labelMap,
String label,
DBIDRef id)
Assigns the specified id to the labelMap according to its label
|
private void |
ByLabelClustering.assign(HashMap<String,DBIDs> labelMap,
String label,
DBIDRef id)
Assigns the specified id to the labelMap according to its label
|
Modifier and Type | Method and Description |
---|---|
DBIDs |
FDBSCANNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
Modifier and Type | Method and Description |
---|---|
protected double |
ABOD.computeABOF(Relation<V> relation,
KernelMatrix kernelMatrix,
DBIDRef pA,
MeanVariance s)
Compute the exact ABOF value.
|
Modifier and Type | Method and Description |
---|---|
void |
KNNWeightProcessor.Instance.map(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
protected double |
LOF.computeLOFScore(KNNQuery<O> knnq,
DBIDRef cur,
DoubleDataStore lrds)
Compute a single LOF score.
|
Modifier and Type | Method and Description |
---|---|
void |
SimplifiedLRDProcessor.Instance.map(DBIDRef id) |
void |
LOFProcessor.Instance.map(DBIDRef id) |
void |
LRDProcessor.Instance.map(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
DBIDs |
NeighborSetPredicate.getNeighborDBIDs(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
DBIDs |
AbstractPrecomputedNeighborhood.getNeighborDBIDs(DBIDRef reference) |
Modifier and Type | Method and Description |
---|---|
Collection<DoubleDBIDPair> |
LinearWeightedExtendedNeighborhood.getWeightedNeighbors(DBIDRef reference) |
Collection<DoubleDBIDPair> |
UnweightedNeighborhoodAdapter.getWeightedNeighbors(DBIDRef reference) |
Collection<DoubleDBIDPair> |
WeightedNeighborSetPredicate.getWeightedNeighbors(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
Modifier and Type | Method and Description |
---|---|
private DBIDs |
SOD.getNearestNeighbors(Relation<V> relation,
SimilarityQuery<V> simQ,
DBIDRef queryObject)
Get the k nearest neighbors in terms of the shared nearest neighbor
distance.
|
double |
OUTRES.outresScore(int s,
long[] subspace,
DBIDRef id,
OUTRES.KernelDensityEstimator kernel)
Main loop of OUTRES.
|
private DoubleDBIDList |
OUTRES.subsetNeighborhoodQuery(DoubleDBIDList neighc,
DBIDRef dbid,
PrimitiveDistanceFunction<? super V> df,
double adjustedEps,
OUTRES.KernelDensityEstimator kernel)
Refine neighbors within a subset.
|
Modifier and Type | Method and Description |
---|---|
protected void |
JSONWebServer.bundleToJSON(JSONBuffer re,
DBIDRef id)
Serialize an object bundle to JSON.
|
Modifier and Type | Method and Description |
---|---|
int |
VectorUtil.SortDBIDsBySingleDimension.compare(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
SingleObjectBundle |
HashmapDatabase.delete(DBIDRef id)
Removes the object from the database (by calling
HashmapDatabase.doDelete(DBIDRef)
) and indexes and fires a deletion event. |
SingleObjectBundle |
UpdatableDatabase.delete(DBIDRef id)
Removes and returns the specified objects with the given ids from the
database.
|
private void |
HashmapDatabase.doDelete(DBIDRef id)
Removes the object with the specified id from this database.
|
private void |
DatabaseEventManager.fireObjectChanged(DBIDRef object,
DatabaseEventManager.Type type)
Handles a DataStoreEvent with the specified type.
|
void |
DatabaseEventManager.fireObjectInserted(DBIDRef insertion)
Event when a new object was inserted.
|
protected void |
DatabaseEventManager.fireObjectRemoved(DBIDRef deletion)
Event when an objects was removed / deleted.
|
void |
DatabaseEventManager.fireObjectsUpdated(DBIDRef update)
Event when an object was changed / updated.
|
SingleObjectBundle |
Database.getBundle(DBIDRef id)
Returns the DatabaseObject represented by the specified id.
|
SingleObjectBundle |
AbstractDatabase.getBundle(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
DBIDVar |
DBIDDataStore.assignVar(DBIDRef id,
DBIDVar var)
Retrieves an object from the storage.
|
int |
DataStoreUtil.AscendingByDoubleDataStore.compare(DBIDRef id1,
DBIDRef id2) |
int |
DataStoreUtil.DescendingByDoubleDataStore.compare(DBIDRef id1,
DBIDRef id2) |
void |
WritableDataStore.delete(DBIDRef id)
Delete the contents for a particular ID and notifies the registered
listeners.
|
double |
DoubleDataStore.doubleValue(DBIDRef id)
Retrieves an object from the storage.
|
Double |
DoubleDataStore.get(DBIDRef id)
Deprecated.
Use
DoubleDataStore.doubleValue(de.lmu.ifi.dbs.elki.database.ids.DBIDRef) instead, to avoid boxing/unboxing cost. |
T |
DataStore.get(DBIDRef id)
Retrieves an object from the storage.
|
Integer |
IntegerDataStore.get(DBIDRef id)
Deprecated.
Use
IntegerDataStore.intValue(de.lmu.ifi.dbs.elki.database.ids.DBIDRef) instead, to avoid boxing/unboxing cost. |
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. |
void |
WritableDoubleDataStore.increment(DBIDRef id,
double value)
Increment the specified value with the specified id in this storage.
|
void |
WritableIntegerDataStore.increment(DBIDRef id,
int adjust)
Increment a value.
|
int |
IntegerDataStore.intValue(DBIDRef id)
Retrieves a value from the storage.
|
int |
DataStoreIDMap.mapDBIDToOffset(DBIDRef dbid)
Map a DBID to an array offset.
|
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. |
void |
WritableDBIDDataStore.put(DBIDRef id,
DBIDRef value)
Associates the specified value with the specified id in this storage.
|
double |
WritableDoubleDataStore.put(DBIDRef id,
double value)
Associates the specified value with the specified id in this storage.
|
Double |
WritableDoubleDataStore.put(DBIDRef id,
Double value)
Deprecated.
Use
WritableDoubleDataStore.putDouble(de.lmu.ifi.dbs.elki.database.ids.DBIDRef, double) instead, to avoid boxing/unboxing cost. |
int |
WritableIntegerDataStore.put(DBIDRef id,
int value)
Associates the specified value with the specified id in this storage.
|
Integer |
WritableIntegerDataStore.put(DBIDRef id,
Integer value)
Deprecated.
Use
WritableIntegerDataStore.putInt(de.lmu.ifi.dbs.elki.database.ids.DBIDRef, int) instead, to avoid boxing/unboxing cost. |
T |
WritableDataStore.put(DBIDRef id,
T value)
Associates the specified value with the specified id in this storage.
|
void |
WritableDBIDDataStore.putDBID(DBIDRef id,
DBIDRef value)
Associates the specified value with the specified id in this storage.
|
double |
WritableDoubleDataStore.putDouble(DBIDRef id,
double value)
Associates the specified value with the specified id in this storage.
|
int |
WritableIntegerDataStore.putInt(DBIDRef id,
int value)
Associates the specified value with the specified id in this storage.
|
boolean |
WritableRecordStore.remove(DBIDRef id)
Remove an object from the store, all columns.
|
Modifier and Type | Method and Description |
---|---|
DBIDVar |
MapIntegerDBIDDBIDStore.assignVar(DBIDRef id,
DBIDVar var) |
DBIDVar |
ArrayDBIDStore.assignVar(DBIDRef id,
DBIDVar var) |
void |
MapIntegerDBIDDBIDStore.delete(DBIDRef id) |
void |
ArrayStore.delete(DBIDRef id) |
void |
MapIntegerDBIDRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
MapIntegerDBIDIntegerStore.delete(DBIDRef id) |
void |
ArrayIntegerStore.delete(DBIDRef id) |
void |
MapIntegerDBIDStore.delete(DBIDRef id) |
void |
ArrayRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
ArrayDBIDStore.delete(DBIDRef id) |
void |
ArrayDoubleStore.delete(DBIDRef id) |
void |
MapIntegerDBIDDoubleStore.delete(DBIDRef id) |
void |
MapRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
MapStore.delete(DBIDRef id) |
double |
ArrayDoubleStore.doubleValue(DBIDRef id) |
double |
MapIntegerDBIDDoubleStore.doubleValue(DBIDRef id) |
DBID |
MapIntegerDBIDDBIDStore.get(DBIDRef id)
Deprecated.
|
T |
ArrayStore.get(DBIDRef id) |
T |
MapIntegerDBIDRecordStore.StorageAccessor.get(DBIDRef id) |
Integer |
MapIntegerDBIDIntegerStore.get(DBIDRef id)
Deprecated.
|
Integer |
ArrayIntegerStore.get(DBIDRef id)
Deprecated.
|
T |
MapIntegerDBIDStore.get(DBIDRef id) |
T |
ArrayRecordStore.StorageAccessor.get(DBIDRef id) |
DBID |
ArrayDBIDStore.get(DBIDRef id)
Deprecated.
|
Double |
ArrayDoubleStore.get(DBIDRef id)
Deprecated.
|
Double |
MapIntegerDBIDDoubleStore.get(DBIDRef id)
Deprecated.
|
T |
MapRecordStore.StorageAccessor.get(DBIDRef id) |
T |
MapStore.get(DBIDRef id) |
protected <T> T |
MapIntegerDBIDRecordStore.get(DBIDRef id,
int index)
Actual getter.
|
protected <T> T |
ArrayRecordStore.get(DBIDRef id,
int index)
Actual getter
|
protected <T> T |
MapRecordStore.get(DBIDRef id,
int index)
Actual getter.
|
void |
ArrayDoubleStore.increment(DBIDRef id,
double value) |
void |
MapIntegerDBIDDoubleStore.increment(DBIDRef id,
double value) |
void |
MapIntegerDBIDIntegerStore.increment(DBIDRef id,
int adjust) |
void |
ArrayIntegerStore.increment(DBIDRef id,
int adjust) |
int |
MapIntegerDBIDIntegerStore.intValue(DBIDRef id) |
int |
ArrayIntegerStore.intValue(DBIDRef id) |
DBID |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
DBID |
ArrayDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
void |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBIDRef value) |
void |
ArrayDBIDStore.put(DBIDRef id,
DBIDRef value) |
double |
ArrayDoubleStore.put(DBIDRef id,
double value) |
double |
MapIntegerDBIDDoubleStore.put(DBIDRef id,
double value) |
Double |
ArrayDoubleStore.put(DBIDRef id,
Double value)
Deprecated.
|
Double |
MapIntegerDBIDDoubleStore.put(DBIDRef id,
Double value)
Deprecated.
|
int |
MapIntegerDBIDIntegerStore.put(DBIDRef id,
int value) |
int |
ArrayIntegerStore.put(DBIDRef id,
int value) |
Integer |
MapIntegerDBIDIntegerStore.put(DBIDRef id,
Integer value)
Deprecated.
|
Integer |
ArrayIntegerStore.put(DBIDRef id,
Integer value)
Deprecated.
|
T |
ArrayStore.put(DBIDRef id,
T value) |
T |
MapIntegerDBIDRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
T |
MapIntegerDBIDStore.put(DBIDRef id,
T value) |
T |
ArrayRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
T |
MapRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
T |
MapStore.put(DBIDRef id,
T value) |
void |
MapIntegerDBIDDBIDStore.putDBID(DBIDRef id,
DBIDRef value) |
void |
ArrayDBIDStore.putDBID(DBIDRef id,
DBIDRef value) |
double |
ArrayDoubleStore.putDouble(DBIDRef id,
double value) |
double |
MapIntegerDBIDDoubleStore.putDouble(DBIDRef id,
double value) |
int |
MapIntegerDBIDIntegerStore.putInt(DBIDRef id,
int value) |
int |
ArrayIntegerStore.putInt(DBIDRef id,
int value) |
boolean |
MapIntegerDBIDRecordStore.remove(DBIDRef id) |
boolean |
ArrayRecordStore.remove(DBIDRef id) |
boolean |
MapRecordStore.remove(DBIDRef id) |
protected <T> T |
MapIntegerDBIDRecordStore.set(DBIDRef id,
int index,
T value)
Actual setter.
|
protected <T> T |
ArrayRecordStore.set(DBIDRef id,
int index,
T value)
Actual setter
|
protected <T> T |
MapRecordStore.set(DBIDRef id,
int index,
T value)
Actual setter.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DBID
Database ID object.
|
interface |
DBIDArrayIter
Array iterators that can also go backwards and seek.
|
interface |
DBIDArrayMIter
Modifiable array iterator.
|
interface |
DBIDIter
Iterator for DBIDs.
|
interface |
DBIDMIter
Modifiable DBID iterator.
|
interface |
DBIDVar
(Persistent) variable storing a DBID reference.
|
interface |
DoubleDBIDListIter
Iterator over double-DBID pairs results.
|
interface |
DoubleDBIDListMIter
Modifiable DBIDList iterator.
|
interface |
DoubleDBIDPair
Pair of a double value and a DBID.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
EmptyDBIDs.EmptyDBIDIterator
Iterator for empty DBIDs-
|
Modifier and Type | Method and Description |
---|---|
DBIDRef |
DBIDFactory.invalid()
Get the invalid DBID value, usable as "undefined" placeholder.
|
static DBIDRef |
DBIDUtil.invalid()
Get the invalid special ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ModifiableDBIDs.add(DBIDRef id)
Add a single DBID to the collection.
|
void |
ModifiableDoubleDBIDList.add(double distance,
DBIDRef id)
Add an object to this result.
|
static int |
DBIDUtil.asInteger(DBIDRef id)
Export a DBID as int.
|
int |
EmptyDBIDs.binarySearch(DBIDRef key) |
int |
ArrayDBIDs.binarySearch(DBIDRef key)
Search for the position of the given key, assuming that the data set is
sorted.
|
int |
DBIDFactory.compare(DBIDRef a,
DBIDRef b)
Compare two DBIDs, for sorting.
|
static int |
DBIDUtil.compare(DBIDRef id1,
DBIDRef id2)
Compare two DBIDs.
|
int |
DBID.compareTo(DBIDRef other)
Compare two DBIDs for ordering.
|
boolean |
EmptyDBIDs.contains(DBIDRef o) |
boolean |
DBIDs.contains(DBIDRef o)
Test whether an ID is contained.
|
void |
DBIDFactory.deallocateSingleDBID(DBIDRef id)
Return a single DBID for reuse.
|
static DBID |
DBIDUtil.deref(DBIDRef ref)
Dereference a DBID reference.
|
boolean |
DBIDFactory.equal(DBIDRef a,
DBIDRef b)
Compare two DBIDs, for equality testing.
|
static boolean |
DBIDUtil.equal(DBIDRef id1,
DBIDRef id2)
Test two DBIDs for equality.
|
DBIDVar |
DBIDVar.from(DBIDDataStore store,
DBIDRef ref)
Update variable from a data store.
|
int |
DBIDRange.getOffset(DBIDRef dbid)
Get offset in the array for a particular DBID.
|
double |
KNNHeap.insert(double distance,
DBIDRef id)
Add a distance-id pair to the heap unless the distance is too large.
|
void |
ArrayModifiableDBIDs.insert(int i,
DBIDRef newval)
Insert at position i (starting at 0, moving the remainder by one position).
|
DBIDPair |
DBIDFactory.newPair(DBIDRef id1,
DBIDRef id2)
Make a DBID pair from two existing DBIDs.
|
static DBIDPair |
DBIDUtil.newPair(DBIDRef id1,
DBIDRef id2)
Make a DBID pair.
|
DoubleDBIDPair |
DBIDFactory.newPair(double val,
DBIDRef id)
Make a double-DBID pair.
|
static DoubleDBIDPair |
DBIDUtil.newPair(double val,
DBIDRef id)
Make a DoubleDBIDPair.
|
DBIDVar |
DBIDFactory.newVar(DBIDRef val)
Make a new DBID variable.
|
static DBIDVar |
DBIDUtil.newVar(DBIDRef val)
Make a new DBID variable.
|
boolean |
ModifiableDBIDs.remove(DBIDRef id)
Remove a single DBID from the collection.
|
void |
DBIDVar.set(DBIDRef ref)
Assign a new value for the reference.
|
DBID |
ArrayModifiableDBIDs.set(int i,
DBIDRef newval)
Replace the i'th entry (starting at 0)
|
void |
DoubleDBIDListMIter.setDBID(DBIDRef ref)
Update the current DBID value.
|
String |
DBIDFactory.toString(DBIDRef id)
Print a DBID as string.
|
static String |
DBIDUtil.toString(DBIDRef id)
Format a DBID as string.
|
Modifier and Type | Method and Description |
---|---|
void |
ArrayModifiableDBIDs.sort(Comparator<? super DBIDRef> comparator)
Sort the DBID set.
|
void |
ArrayModifiableDBIDs.sort(int start,
int end,
Comparator<? super DBIDRef> comparator)
Sort the DBID set.
|
Modifier and Type | Class and Description |
---|---|
private class |
KNNSubList.Itr
Iterator for the sublist.
|
protected class |
MaskedDBIDs.DBIDItr
Iterator over set bits.
|
protected class |
MaskedDBIDs.InvDBIDItr
Iterator over set bits.
|
(package private) class |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter
Make an existing DBIDMIter unmodifiable.
|
(package private) class |
UnmodifiableDBIDs.UnmodifiableDBIDIter
Make an existing DBIDMIter unmodifiable.
|
Modifier and Type | Method and Description |
---|---|
int |
UnmodifiableArrayDBIDs.binarySearch(DBIDRef key) |
boolean |
KNNSubList.contains(DBIDRef o) |
boolean |
UnmodifiableArrayDBIDs.contains(DBIDRef o) |
boolean |
UnmodifiableDBIDs.contains(DBIDRef o) |
boolean |
MaskedDBIDs.contains(DBIDRef o) |
Modifier and Type | Interface and Description |
---|---|
interface |
DoubleIntegerDBIDListIter
Combination interface of the DoubleDBIDListIter with IntegerDBIDIter.
|
(package private) interface |
DoubleIntegerDBIDListMIter
Combination interface for modifiable iterators.
|
(package private) interface |
IntegerDBIDArrayIter
Modifiable integer array iterator.
|
(package private) interface |
IntegerDBIDArrayMIter
Modifiable integer array iterator.
|
(package private) interface |
IntegerDBIDIter
Iterator for integer DBIDs.
|
(package private) interface |
IntegerDBIDMIter
Modifiable iterator interface for integer DBIDs.
|
(package private) interface |
IntegerDBIDRef
DBID reference that references an integer value.
|
Modifier and Type | Class and Description |
---|---|
private class |
ArrayModifiableIntegerDBIDs.Itr
Iterator class.
|
private class |
ArrayModifiableIntegerDBIDs.Slice.SliceItr
Iterator class.
|
protected class |
ArrayStaticIntegerDBIDs.Itr
DBID iterator in ELKI/C style.
|
private class |
ArrayStaticIntegerDBIDs.Slice.SliceItr
Iterator class.
|
private class |
DoubleIntegerDBIDList.Itr
List iterator.
|
(package private) class |
DoubleIntegerDBIDPair
Pair containing a double value and an integer DBID.
|
private class |
DoubleIntegerDBIDPairKNNListHeap.Itr
Iterator.
|
private class |
DoubleIntegerDBIDPairList.Itr
List iterator.
|
(package private) class |
IntegerDBID
Database ID object.
|
protected class |
IntegerDBID.Itr
Pseudo iterator for DBIDs interface.
|
private class |
IntegerDBIDKNNSubList.Itr
Iterator for the sublist.
|
private static class |
IntegerDBIDPair.Itr
Iterator.
|
private static class |
IntegerDBIDRange.Itr
Iterator in ELKI/C++ style.
|
(package private) class |
IntegerDBIDVar
Variable for storing a single DBID reference.
|
protected class |
IntegerDBIDVar.Itr
Pseudo iterator for DBIDs interface.
|
protected static class |
TroveHashSetModifiableDBIDs.Itr
Iterator over trove hashs.
|
(package private) class |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter
Make an existing DBIDMIter unmodifiable.
|
(package private) class |
UnmodifiableIntegerDBIDs.UnmodifiableDBIDIter
Make an existing DBIDMIter unmodifiable.
|
Modifier and Type | Method and Description |
---|---|
DBIDRef |
AbstractIntegerDBIDFactory.invalid() |
Modifier and Type | Method and Description |
---|---|
boolean |
TroveHashSetModifiableDBIDs.add(DBIDRef e) |
boolean |
ArrayModifiableIntegerDBIDs.add(DBIDRef e) |
void |
DoubleIntegerDBIDListKNNHeap.add(double dist,
DBIDRef id) |
void |
DoubleIntegerDBIDPairList.add(double dist,
DBIDRef id) |
void |
DoubleIntegerDBIDList.add(double dist,
DBIDRef id) |
int |
UnmodifiableIntegerArrayDBIDs.binarySearch(DBIDRef key) |
int |
IntegerDBID.binarySearch(DBIDRef key) |
int |
IntegerDBIDVar.binarySearch(DBIDRef key) |
int |
IntegerDBIDRange.binarySearch(DBIDRef key) |
int |
ArrayModifiableIntegerDBIDs.binarySearch(DBIDRef key) |
int |
ArrayModifiableIntegerDBIDs.Slice.binarySearch(DBIDRef key) |
int |
ArrayStaticIntegerDBIDs.binarySearch(DBIDRef key) |
int |
ArrayStaticIntegerDBIDs.Slice.binarySearch(DBIDRef key) |
int |
AbstractIntegerDBIDFactory.compare(DBIDRef a,
DBIDRef b) |
int |
IntegerDBID.compareTo(DBIDRef o) |
boolean |
TroveHashSetModifiableDBIDs.contains(DBIDRef o) |
boolean |
UnmodifiableIntegerArrayDBIDs.contains(DBIDRef o) |
boolean |
IntegerDBIDPair.contains(DBIDRef o) |
boolean |
IntegerDBID.contains(DBIDRef o) |
boolean |
IntegerDBIDVar.contains(DBIDRef o) |
boolean |
UnmodifiableIntegerDBIDs.contains(DBIDRef o) |
boolean |
IntegerDBIDRange.contains(DBIDRef o) |
boolean |
DoubleIntegerDBIDPairList.contains(DBIDRef o) |
boolean |
IntegerDBIDKNNSubList.contains(DBIDRef o) |
boolean |
DoubleIntegerDBIDList.contains(DBIDRef o) |
boolean |
ArrayModifiableIntegerDBIDs.contains(DBIDRef o) |
boolean |
ArrayModifiableIntegerDBIDs.Slice.contains(DBIDRef o) |
boolean |
DoubleIntegerDBIDPairKNNListHeap.contains(DBIDRef o) |
boolean |
ArrayStaticIntegerDBIDs.contains(DBIDRef o) |
boolean |
ArrayStaticIntegerDBIDs.Slice.contains(DBIDRef o) |
void |
TrivialDBIDFactory.deallocateSingleDBID(DBIDRef id) |
void |
ReusingDBIDFactory.deallocateSingleDBID(DBIDRef id) |
void |
SimpleDBIDFactory.deallocateSingleDBID(DBIDRef id) |
boolean |
AbstractIntegerDBIDFactory.equal(DBIDRef a,
DBIDRef b) |
DBIDVar |
IntegerDBIDVar.from(DBIDDataStore store,
DBIDRef ref) |
int |
IntegerDBIDRange.getOffset(DBIDRef dbid)
For storage array offsets.
|
double |
DoubleIntegerDBIDKNNHeap.insert(double distance,
DBIDRef id) |
double |
DoubleIntegerDBIDListKNNHeap.insert(double dist,
DBIDRef id) |
double |
DoubleIntegerDBIDPairKNNListHeap.insert(double distance,
DBIDRef id) |
void |
ArrayModifiableIntegerDBIDs.insert(int i,
DBIDRef newval) |
int |
IntegerDBIDRange.mapDBIDToOffset(DBIDRef dbid) |
DBIDPair |
AbstractIntegerDBIDFactory.newPair(DBIDRef first,
DBIDRef second) |
DoubleDBIDPair |
AbstractIntegerDBIDFactory.newPair(double val,
DBIDRef id) |
DBIDVar |
AbstractIntegerDBIDFactory.newVar(DBIDRef val) |
boolean |
TroveHashSetModifiableDBIDs.remove(DBIDRef o) |
boolean |
ArrayModifiableIntegerDBIDs.remove(DBIDRef o) |
void |
IntegerDBIDVar.set(DBIDRef ref) |
DBID |
ArrayModifiableIntegerDBIDs.set(int index,
DBIDRef element) |
void |
DoubleIntegerDBIDPairList.Itr.setDBID(DBIDRef ref) |
void |
DoubleIntegerDBIDList.Itr.setDBID(DBIDRef ref) |
String |
AbstractIntegerDBIDFactory.toString(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
private static int |
IntegerDBIDArrayQuickSort.compare(IntegerDBIDVar i1,
int p1,
IntegerDBIDVar i2,
int p2,
Comparator<? super DBIDRef> comp)
Compare two elements.
|
private static void |
IntegerDBIDArrayQuickSort.quickSort(int[] data,
int start,
int end,
Comparator<? super DBIDRef> comp,
IntegerDBIDVar vl,
IntegerDBIDVar vk,
IntegerDBIDVar vr)
Actual recursive sort function.
|
void |
ArrayModifiableIntegerDBIDs.sort(Comparator<? super DBIDRef> comparator) |
static void |
IntegerDBIDArrayQuickSort.sort(int[] data,
Comparator<? super DBIDRef> comp)
Sort the full array using the given comparator.
|
static void |
IntegerDBIDArrayQuickSort.sort(int[] data,
int start,
int end,
Comparator<? super DBIDRef> comp)
Sort the array using the given comparator.
|
void |
ArrayModifiableIntegerDBIDs.sort(int start,
int end,
Comparator<? super DBIDRef> comparator) |
Constructor and Description |
---|
IntegerDBIDVar(DBIDRef val)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
double |
DBIDDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
double |
DBIDRangeDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
double |
PrimitiveDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
double |
DistanceQuery.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
abstract double |
AbstractDistanceQuery.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
PrimitiveDistanceQuery.distance(DBIDRef id1,
O o2) |
double |
DistanceQuery.distance(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
double |
AbstractDatabaseDistanceQuery.distance(DBIDRef id1,
O o2) |
abstract double |
AbstractDistanceQuery.distance(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
double |
PrimitiveDistanceQuery.distance(O o1,
DBIDRef id2) |
double |
DistanceQuery.distance(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
AbstractDatabaseDistanceQuery.distance(O o1,
DBIDRef id2) |
abstract double |
AbstractDistanceQuery.distance(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
PrimitiveDistanceSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2) |
double |
PrimitiveDistanceSimilarityQuery.similarity(DBIDRef id1,
O o2) |
double |
PrimitiveDistanceSimilarityQuery.similarity(O o1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
KNNList |
KNNQuery.getKNNForDBID(DBIDRef id,
int k)
Get the k nearest neighbors for a particular id.
|
KNNList |
LinearScanPrimitiveDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNList |
PreprocessorKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNList |
LinearScanEuclideanDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNList |
LinearScanDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNList |
AbstractDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
Modifier and Type | Method and Description |
---|---|
DoubleDBIDList |
LinearScanPrimitiveDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range) |
DoubleDBIDList |
LinearScanEuclideanDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range) |
DoubleDBIDList |
RangeQuery.getRangeForDBID(DBIDRef id,
double range)
Get the neighbors for a particular id in a given query range
|
DoubleDBIDList |
LinearScanDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range) |
DoubleDBIDList |
AbstractDistanceRangeQuery.getRangeForDBID(DBIDRef id,
double range) |
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) |
Modifier and Type | Method and Description |
---|---|
DoubleDBIDList |
LinearScanRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
DoubleDBIDList |
PreprocessorRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
abstract DoubleDBIDList |
AbstractRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
DoubleDBIDList |
RKNNQuery.getRKNNForDBID(DBIDRef id,
int k)
Get the reverse k nearest neighbors for a particular id.
|
Modifier and Type | Method and Description |
---|---|
double |
PrimitiveSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2) |
abstract double |
AbstractSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
SimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2)
Returns the similarity between the two objects specified by their object
ids.
|
double |
PrimitiveSimilarityQuery.similarity(DBIDRef id1,
O o2) |
double |
AbstractDBIDSimilarityQuery.similarity(DBIDRef id1,
O o2) |
abstract double |
AbstractSimilarityQuery.similarity(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
double |
SimilarityQuery.similarity(DBIDRef id1,
O o2)
Returns the similarity between the two objects specified by their object
ids.
|
double |
PrimitiveSimilarityQuery.similarity(O o1,
DBIDRef id2) |
double |
AbstractDBIDSimilarityQuery.similarity(O o1,
DBIDRef id2) |
abstract double |
AbstractSimilarityQuery.similarity(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
SimilarityQuery.similarity(O o1,
DBIDRef id2)
Returns the similarity between the two objects specified by their object
ids.
|
Modifier and Type | Method and Description |
---|---|
int |
RelationUtil.AscendingByDoubleRelation.compare(DBIDRef id1,
DBIDRef id2) |
int |
RelationUtil.DescendingByDoubleRelation.compare(DBIDRef id1,
DBIDRef id2) |
void |
MaterializedRelation.delete(DBIDRef id)
Delete an objects values.
|
void |
ModifiableRelation.delete(DBIDRef id)
Delete an objects values.
|
void |
MaterializedDoubleRelation.delete(DBIDRef id)
Delete an objects values.
|
double |
DoubleRelation.doubleValue(DBIDRef id)
Get the representation of an object.
|
double |
MaterializedDoubleRelation.doubleValue(DBIDRef id) |
O |
MaterializedRelation.get(DBIDRef id) |
O |
ProxyView.get(DBIDRef id) |
String |
ConvertToStringView.get(DBIDRef id) |
O |
Relation.get(DBIDRef id)
Get the representation of an object.
|
DBID |
DBIDView.get(DBIDRef id) |
Double |
DoubleRelation.get(DBIDRef id)
Deprecated.
|
OUT |
ProjectedView.get(DBIDRef id) |
Double |
MaterializedDoubleRelation.get(DBIDRef id)
Deprecated.
|
void |
DoubleRelation.insert(DBIDRef id,
Double val)
Deprecated.
use
DoubleRelation.set(DBIDRef, double) instead. |
void |
MaterializedDoubleRelation.insert(DBIDRef id,
Double val)
Deprecated.
|
void |
MaterializedRelation.insert(DBIDRef id,
O val) |
void |
ModifiableRelation.insert(DBIDRef id,
O val)
Set (or insert) an object representation.
|
void |
DoubleRelation.set(DBIDRef id,
double val)
Set an object representation.
|
void |
MaterializedDoubleRelation.set(DBIDRef id,
double val) |
Modifier and Type | Method and Description |
---|---|
double |
SharedNearestNeighborJaccardDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2) |
double |
AbstractDBIDRangeDistanceFunction.distance(DBIDRef o1,
DBIDRef o2) |
double |
DBIDDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
double |
RandomStableDistanceFunction.distance(DBIDRef o1,
DBIDRef o2) |
Modifier and Type | Method and Description |
---|---|
double |
AbstractSimilarityAdapter.Instance.distance(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
double |
FractionalSharedNearestNeighborSimilarityFunction.Instance.similarity(DBIDRef id1,
DBIDRef id2) |
double |
SharedNearestNeighborSimilarityFunction.Instance.similarity(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
double |
KernelMatrix.getDistance(DBIDRef o1,
DBIDRef o2)
Returns the kernel distance between the two specified objects.
|
int |
KernelMatrix.DBIDMap.getOffset(DBIDRef id)
Get the offset of the DBID in the range.
|
int |
KernelMatrix.RangeMap.getOffset(DBIDRef id) |
int |
KernelMatrix.SortedArrayMap.getOffset(DBIDRef id) |
double |
KernelMatrix.getSimilarity(DBIDRef id1,
DBIDRef id2)
Get the kernel similarity for the given objects.
|
double |
KernelMatrix.getSquaredDistance(DBIDRef id1,
DBIDRef id2)
Returns the squared kernel distance between the two specified objects.
|
Matrix |
KernelMatrix.getSubColumn(DBIDRef i1,
DBIDs ids)
Deprecated.
|
Modifier and Type | Field and Description |
---|---|
(package private) DBIDRef |
FilteredDistanceResultAdapter.skip
DBID to skip (usually: query object).
|
Modifier and Type | Method and Description |
---|---|
DBIDRef |
OutlierScoreAdapter.getRef() |
DBIDRef |
DistanceResultAdapter.getRef() |
DBIDRef |
DBIDRefIter.getRef()
Get the current DBIDRef.
|
DBIDRef |
SimpleAdapter.getRef() |
Constructor and Description |
---|
FilteredDistanceResultAdapter(DoubleDBIDListIter iter,
DBIDRef skip)
Constructor
|
Modifier and Type | Method and Description |
---|---|
boolean |
DynamicIndex.delete(DBIDRef id)
Deletes the specified object from this index.
|
void |
DynamicIndex.insert(DBIDRef id)
Inserts the specified object into this index.
|
protected double |
AbstractRefiningIndex.AbstractRangeQuery.refine(DBIDRef id,
O q)
Refinement distance computation.
|
protected double |
AbstractRefiningIndex.AbstractKNNQuery.refine(DBIDRef id,
O q)
Refinement distance computation.
|
Modifier and Type | Method and Description |
---|---|
double |
PrecomputedDistanceMatrix.PrecomputedDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
double |
PrecomputedDistanceMatrix.PrecomputedDistanceQuery.distance(DBIDRef id1,
O o2) |
double |
PrecomputedDistanceMatrix.PrecomputedDistanceQuery.distance(O o1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
private void |
InMemoryInvertedIndex.indexDense(DBIDRef ref,
V obj)
Index a single (dense) instance.
|
private void |
InMemoryInvertedIndex.indexSparse(DBIDRef ref,
SparseNumberVector obj)
Index a single (sparse) instance.
|
Modifier and Type | Method and Description |
---|---|
P |
LocalProjectionIndex.getLocalProjection(DBIDRef id)
Get the precomputed local projection for a particular object ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
MaterializeKNNPreprocessor.delete(DBIDRef id) |
KNNList |
AbstractMaterializeKNNPreprocessor.get(DBIDRef id)
Get the k nearest neighbors.
|
KNNList |
SpacefillingKNNPreprocessor.SpaceFillingKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNList |
NaiveProjectedKNNPreprocessor.NaiveProjectedKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DoubleDBIDList |
MaterializeKNNAndRKNNPreprocessor.getRKNN(DBIDRef id)
Returns the materialized RkNNs of the specified id.
|
void |
MaterializeKNNPreprocessor.insert(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
PCAFilteredResult |
AbstractFilteredPCAIndex.getLocalProjection(DBIDRef objid) |
PCAFilteredResult |
FilteredLocalPCAIndex.getLocalProjection(DBIDRef objid)
Get the precomputed local PCA for a particular object ID.
|
protected abstract DoubleDBIDList |
AbstractFilteredPCAIndex.objectsForPCA(DBIDRef id)
Returns the objects to be considered within the PCA for the specified query
object.
|
protected KNNList |
KNNQueryFilteredPCAIndex.objectsForPCA(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
private long[] |
HiSCPreferenceVectorIndex.determinePreferenceVector(Relation<V> relation,
DBIDRef id,
DBIDs neighborIDs,
StringBuilder msg)
Determines the preference vector according to the specified neighbor ids.
|
long[] |
AbstractPreferenceVectorIndex.getPreferenceVector(DBIDRef objid) |
long[] |
PreferenceVectorIndex.getPreferenceVector(DBIDRef id)
Get the precomputed preference vector for a particular object ID.
|
Modifier and Type | Method and Description |
---|---|
ArrayDBIDs |
SharedNearestNeighborIndex.getNearestNeighborSet(DBIDRef id)
Get the precomputed nearest neighbors
|
ArrayDBIDs |
SharedNearestNeighborPreprocessor.getNearestNeighborSet(DBIDRef objid) |
Modifier and Type | Method and Description |
---|---|
KNNList |
ProjectedIndex.ProjectedKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DoubleDBIDList |
ProjectedIndex.ProjectedRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
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 double |
AbstractCoverTree.distance(DBIDRef a,
DBIDRef b)
Compute a distance (and count).
|
protected double |
AbstractCoverTree.distance(O a,
DBIDRef b)
Compute a distance (and count).
|
Constructor and Description |
---|
Node(DBIDRef r,
double maxDist)
Constructor.
|
Node(DBIDRef r,
double maxDist,
double parentDist)
Constructor.
|
Node(DBIDRef r,
double maxDist,
DoubleDBIDList singletons)
Constructor for leaf node.
|
Node(DBIDRef r,
double maxDist,
double parentDist,
DoubleDBIDList singletons)
Constructor for leaf node.
|
Modifier and Type | Method and Description |
---|---|
abstract double |
AbstractMTree.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two specified ids.
|
Modifier and Type | Method and Description |
---|---|
double |
AbstractMkTree.distance(DBIDRef id1,
DBIDRef id2) |
abstract DoubleDBIDList |
AbstractMkTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
DoubleDBIDList |
MkAppTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
private void |
MkCoPTree.doReverseKNNQuery(int k,
DBIDRef q,
ModifiableDoubleDBIDList result,
ModifiableDBIDs candidates)
Performs a reverse knn query.
|
DoubleDBIDList |
MkCoPTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
MkMaxTreeIndex.delete(DBIDRef id)
Throws an UnsupportedOperationException since deletion of objects is not
yet supported by an M-Tree.
|
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() . |
void |
MkMaxTreeIndex.insert(DBIDRef id) |
DoubleDBIDList |
MkMaxTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
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.
|
DoubleDBIDList |
MkTabTree.reverseKNNQuery(DBIDRef id,
int k) |
Modifier and Type | Method and Description |
---|---|
boolean |
MTreeIndex.delete(DBIDRef id)
Throws an UnsupportedOperationException since deletion of objects is not
yet supported by an M-Tree.
|
double |
MTreeIndex.distance(DBIDRef id1,
DBIDRef id2) |
void |
MTreeIndex.insert(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
DoubleDBIDList |
MkTreeRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
Modifier and Type | Method and Description |
---|---|
int |
MinimalisticMemoryKDTree.CountSortAccesses.compare(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
protected IndexTreePath<E> |
AbstractRStarTree.findPathToObject(IndexTreePath<E> subtree,
SpatialComparable mbr,
DBIDRef id)
Returns the path to the leaf entry in the specified subtree that represents
the data object with the specified mbr and id.
|
Modifier and Type | Method and Description |
---|---|
boolean |
DeLiCluTreeIndex.delete(DBIDRef id)
Deletes the specified object from this index.
|
void |
DeLiCluTreeIndex.insert(DBIDRef id)
Inserts the specified real vector object into this index.
|
Modifier and Type | Method and Description |
---|---|
boolean |
FlatRStarTreeIndex.delete(DBIDRef id)
Deletes the specified object from this index.
|
void |
FlatRStarTreeIndex.insert(DBIDRef id)
Inserts the specified real vector object into this index.
|
Modifier and Type | Method and Description |
---|---|
KNNList |
RStarTreeKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DoubleDBIDList |
RStarTreeRangeQuery.getRangeForDBID(DBIDRef id,
double range) |
void |
RStarTreeRangeQuery.getRangeForDBID(DBIDRef id,
double range,
ModifiableDoubleDBIDList result) |
Modifier and Type | Method and Description |
---|---|
boolean |
RdKNNTree.delete(DBIDRef id)
Deletes the specified object from this index.
|
void |
RdKNNTree.insert(DBIDRef id)
Inserts the specified real vector object into this index.
|
Modifier and Type | Method and Description |
---|---|
protected SpatialPointLeafEntry |
RStarTreeIndex.createNewLeafEntry(DBIDRef id)
Create a new leaf entry.
|
boolean |
RStarTreeIndex.delete(DBIDRef id)
Deletes the specified object from this index.
|
void |
RStarTreeIndex.insert(DBIDRef id)
Inserts the specified reel vector object into this index.
|
Modifier and Type | Method and Description |
---|---|
void |
WriteDataStoreProcessor.Instance.map(DBIDRef id) |
void |
KDistanceProcessor.Instance.map(DBIDRef id) |
void |
WriteDoubleDataStoreProcessor.Instance.map(DBIDRef id) |
void |
Processor.Instance.map(DBIDRef id)
Process ("map") a single object
|
void |
KNNProcessor.Instance.map(DBIDRef id) |
abstract void |
AbstractDoubleProcessor.Instance.map(DBIDRef id) |
void |
WriteIntegerDataStoreProcessor.Instance.map(DBIDRef id) |
void |
DoubleMinMaxProcessor.Instance.map(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
int |
OrderingFromDataStore.ImpliedComparator.compare(DBIDRef id1,
DBIDRef id2) |
int |
OrderingFromDataStore.DerivedComparator.compare(DBIDRef id1,
DBIDRef id2) |
private StringBuilder |
KMLOutputHandler.makeDescription(Collection<Relation<?>> relations,
DBIDRef id)
Make an HTML description.
|
Modifier and Type | Method and Description |
---|---|
private void |
TextWriter.printObject(TextWriterStream out,
Database db,
DBIDRef objID,
List<Relation<?>> ra) |
Modifier and Type | Method and Description |
---|---|
private static void |
QuickSelect.insertionSort(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
int start,
int end,
DBIDArrayIter iter1,
DBIDArrayIter iter2)
Sort a small array using repetitive insertion sort.
|
static int |
QuickSelect.median(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
QuickSelect.median(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
int begin,
int end)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
QuickSelect.quantile(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
double quant)
Compute the median of an array efficiently using the QuickSelect method.
|
static int |
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 void |
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.
|
static void |
QuickSelect.quickSelect(ArrayModifiableDBIDs data,
Comparator<? super DBIDRef> comparator,
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.
|
Modifier and Type | Method and Description |
---|---|
int |
StylingPolicy.getColorForDBID(DBIDRef id)
Get the color for an individual object.
|
int |
ClusterStylingPolicy.getColorForDBID(DBIDRef id) |
int |
ClassStylingPolicy.getStyleForDBID(DBIDRef id)
Get the style number for a particular object
|
int |
ClusterStylingPolicy.getStyleForDBID(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
int |
SegmentsStylingPolicy.getColorForDBID(DBIDRef id) |
int |
SegmentsStylingPolicy.getStyleForDBID(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
private Element |
BoundingBoxVisualization.Instance.drawLine(DBIDRef iter)
Draw a single line.
|
private Element |
LineVisualization.Instance.drawLine(DBIDRef iter)
Draw a single line.
|
Modifier and Type | Method and Description |
---|---|
private Element |
SelectionLineVisualization.Instance.drawLine(DBIDRef iter)
Draw a single line.
|
Modifier and Type | Method and Description |
---|---|
protected abstract Element |
AbstractTooltipVisualization.makeTooltip(DBIDRef id,
double x,
double y,
double dotsize)
Make a tooltip Element for this id.
|
protected Element |
TooltipStringVisualization.Instance.makeTooltip(DBIDRef id,
double x,
double y,
double dotsize) |
protected Element |
TooltipScoreVisualization.Instance.makeTooltip(DBIDRef id,
double x,
double y,
double dotsize) |
Modifier and Type | Method and Description |
---|---|
protected double |
BubbleVisualization.Instance.getScaledForId(DBIDRef id)
Convenience method to apply scalings in the right order.
|
Modifier and Type | Method and Description |
---|---|
protected void |
SameSizeKMeansAlgorithm.transfer(WritableDataStore<SameSizeKMeansAlgorithm.Meta> metas,
SameSizeKMeansAlgorithm.Meta meta,
ModifiableDBIDs src,
ModifiableDBIDs dst,
DBIDRef id,
Integer dstnum)
Transfer a single element from one cluster to another.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.