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.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.outlier |
Outlier detection algorithms
|
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.application.visualization |
Visualization applications in ELKI.
|
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.
|
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.distancefunction.correlation |
Distance functions using correlations.
|
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.distanceresultlist |
Classes for building and storing the results of distance-based queries
The classes in this package essentially form three groups:
KNNHeap for building kNN results. |
de.lmu.ifi.dbs.elki.distance.similarityfunction |
Similarity functions.
|
de.lmu.ifi.dbs.elki.evaluation.roc |
Evaluation of rankings using ROC AUC (Receiver Operation Characteristics - Area Under Curve)
|
de.lmu.ifi.dbs.elki.index |
Index structure implementations
|
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.preprocessed.subspaceproj |
Index using a preprocessed local subspaces.
|
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.rstarvariants |
R*-Tree and variants.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.deliclu | |
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.query |
Queries on the R-Tree family of indexes: kNN and range queries.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.rstar | |
de.lmu.ifi.dbs.elki.result |
Result types, representation and handling
|
de.lmu.ifi.dbs.elki.result.optics |
Result classes for OPTICS.
|
de.lmu.ifi.dbs.elki.result.outlier |
Outlier result classes
|
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.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 |
---|---|
int |
SLINK.CompareByLambda.compare(DBIDRef id1,
DBIDRef id2) |
int |
SLINK.CompareByDoubleLambda.compare(DBIDRef id1,
DBIDRef id2) |
protected void |
DBSCAN.expandCluster(Relation<O> relation,
RangeQuery<O,D> rangeQuery,
DBIDRef startObjectID,
FiniteProgress objprog,
IndefiniteProgress clusprog)
DBSCAN-function expandCluster.
|
double[] |
EM.getProbClusterIGivenX(DBIDRef index)
Get the probabilities for a given point.
|
private Cluster<DendrogramModel<D>> |
SLINK.makeCluster(DBIDRef lead,
D depth,
DBIDs members,
ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier)
Make the cluster for the given object
|
private void |
SLINK.step1(DBIDRef id,
WritableDBIDDataStore pi,
WritableDataStore<D> lambda)
First step: Initialize P(id) = id, L(id) = infinity.
|
private void |
SLINK.step1double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda)
First step: Initialize P(id) = id, L(id) = infinity.
|
private void |
SLINK.step2(DBIDRef id,
DBIDs processedIDs,
DistanceQuery<O,D> distFunc,
WritableDataStore<D> m)
Second step: Determine the pairwise distances from all objects in the
pointer representation to the new object with the specified id.
|
private void |
SLINK.step2double(DBIDRef id,
DBIDs processedIDs,
Relation<? extends O> relation,
PrimitiveDoubleDistanceFunction<? super O> distFunc,
WritableDoubleDistanceDataStore 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.step3(DBIDRef id,
WritableDBIDDataStore pi,
WritableDataStore<D> lambda,
DBIDs processedIDs,
WritableDataStore<D> m)
Third step: Determine the values for P and L
|
private void |
SLINK.step3double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda,
DBIDs processedIDs,
WritableDoubleDistanceDataStore m)
Third step: Determine the values for P and L
|
private void |
SLINK.step4(DBIDRef id,
WritableDBIDDataStore pi,
WritableDataStore<D> lambda,
DBIDs processedIDs)
Fourth step: Actualize the clusters if necessary
|
private void |
SLINK.step4double(DBIDRef id,
WritableDBIDDataStore pi,
WritableDoubleDistanceDataStore lambda,
DBIDs processedIDs)
Fourth step: Actualize the clusters if necessary
|
Constructor and Description |
---|
ORCLUS.ORCLUSCluster(V o,
DBIDRef id,
NumberVector.Factory<V,?> factory)
Creates a new cluster containing the specified object o.
|
Modifier and Type | Method and Description |
---|---|
DistanceDBIDResult<D> |
EpsilonNeighborPredicate.Instance.getNeighbors(DBIDRef reference) |
T |
NeighborPredicate.Instance.getNeighbors(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
boolean |
MinPtsCorePredicate.Instance.isCorePoint(DBIDRef point,
DBIDs neighbors) |
boolean |
CorePredicate.Instance.isCorePoint(DBIDRef point,
T neighbors)
Decide whether the point is a core point, based on its neighborhood.
|
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 |
ByLabelClustering.assign(HashMap<String,DBIDs> labelMap,
String label,
DBIDRef id)
Assigns the specified id to the labelMap according to its label
|
private void |
ByLabelHierarchicalClustering.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 |
---|---|
private double |
ABOD.calcCos(KernelMatrix kernelMatrix,
DBIDRef aKey,
DBIDRef bKey)
Compute the cosinus value between vectors aKey and bKey.
|
private double |
ABOD.calcDenominator(KernelMatrix kernelMatrix,
DBIDRef aKey,
DBIDRef bKey,
DBIDRef cKey) |
private Heap<DoubleDBIDPair> |
ABOD.calcDistsandNN(Relation<V> data,
KernelMatrix kernelMatrix,
int sampleSize,
DBIDRef aKey,
WritableDoubleDataStore dists) |
private Heap<DoubleDBIDPair> |
ABOD.calcDistsandRNDSample(Relation<V> data,
KernelMatrix kernelMatrix,
int sampleSize,
DBIDRef aKey,
WritableDoubleDataStore dists) |
private double[] |
ABOD.calcFastNormalization(DBIDRef x,
WritableDoubleDataStore dists,
DBIDs ids) |
private double |
ABOD.calcNumerator(KernelMatrix kernelMatrix,
DBIDRef aKey,
DBIDRef bKey,
DBIDRef cKey) |
private void |
ABOD.generateExplanation(StringBuilder buf,
Relation<V> data,
DBIDRef key,
DBIDs expList) |
private double |
ABOD.getAbofFilter(KernelMatrix kernelMatrix,
DBIDRef aKey,
WritableDoubleDataStore dists,
double fulCounter,
double counter,
DBIDs neighbors) |
private int |
ABOD.mapDBID(DBIDRef aKey) |
Modifier and Type | Method and Description |
---|---|
DBIDs |
AbstractPrecomputedNeighborhood.getNeighborDBIDs(DBIDRef reference) |
DBIDs |
NeighborSetPredicate.getNeighborDBIDs(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
Modifier and Type | Method and Description |
---|---|
Collection<DoubleDBIDPair> |
UnweightedNeighborhoodAdapter.getWeightedNeighbors(DBIDRef reference) |
Collection<DoubleDBIDPair> |
LinearWeightedExtendedNeighborhood.getWeightedNeighbors(DBIDRef reference) |
Collection<DoubleDBIDPair> |
WeightedNeighborSetPredicate.getWeightedNeighbors(DBIDRef reference)
Get the neighbors of a reference object for DBSCAN.
|
Modifier and Type | Method and Description |
---|---|
void |
SOD.SODProxyScoreResult.delete(DBIDRef id) |
Double |
SOD.SODProxyScoreResult.get(DBIDRef objID) |
private DBIDs |
SOD.getNearestNeighbors(Relation<V> relation,
SimilarityQuery<V,D> simQ,
DBIDRef queryObject)
Provides the k nearest neighbors in terms of the shared nearest neighbor
distance.
|
double |
OUTRES.outresScore(int s,
BitSet subspace,
DBIDRef id,
OUTRES.KernelDensityEstimator kernel)
Main loop of OUTRES.
|
void |
SOD.SODProxyScoreResult.set(DBIDRef id,
Double val) |
private DoubleDistanceDBIDList |
OUTRES.subsetNeighborhoodQuery(DistanceDBIDResult<DoubleDistance> neighc,
DBIDRef dbid,
PrimitiveDoubleDistanceFunction<? 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 |
---|---|
private Element |
KNNExplorer.ExplorerWindow.plotSeries(DBIDRef idx,
int resolution)
Plot a single time series.
|
Modifier and Type | Method and Description |
---|---|
int |
VectorUtil.SortDBIDsBySingleDimension.compare(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
SingleObjectBundle |
UpdatableDatabase.delete(DBIDRef id)
Removes and returns the specified objects with the given ids from the
database.
|
SingleObjectBundle |
HashmapDatabase.delete(DBIDRef id)
Removes the object from the database (by calling
HashmapDatabase.doDelete(DBIDRef) )
and indexes and fires a deletion event. |
private void |
HashmapDatabase.doDelete(DBIDRef id)
Removes the object with the specified id from this database.
|
private void |
DatabaseEventManager.fireObjectChanged(DBIDRef object,
DataStoreEvent.Type type)
Handles a DataStoreEvent with the specified type.
|
void |
DatabaseEventManager.fireObjectInserted(DBIDRef insertion)
Convenience method, calls
fireObjectChanged(insertion,
DataStoreEvent.Type.INSERT) . |
protected void |
DatabaseEventManager.fireObjectRemoved(DBIDRef deletion)
Convenience method, calls
fireObjectChanged(deletion,
DataStoreEvent.Type.DELETE) . |
SingleObjectBundle |
AbstractDatabase.getBundle(DBIDRef id) |
SingleObjectBundle |
Database.getBundle(DBIDRef id)
Returns the DatabaseObject represented by the specified id.
|
Modifier and Type | Method and Description |
---|---|
void |
DBIDDataStore.assignVar(DBIDRef id,
DBIDVar var)
Retrieves an object from the storage.
|
void |
WritableDataStore.delete(DBIDRef id)
Delete the contents for a particular ID and notifies the registered
listeners.
|
double |
DoubleDistanceDataStore.doubleValue(DBIDRef id)
Retrieves an object from the storage.
|
double |
DoubleDataStore.doubleValue(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. |
T |
DataStore.get(DBIDRef id)
Retrieves an object from the storage.
|
DoubleDistance |
DoubleDistanceDataStore.get(DBIDRef id)
Deprecated.
Use
DoubleDistanceDataStore.doubleValue(de.lmu.ifi.dbs.elki.database.ids.DBIDRef) instead, to avoid boxing/unboxing cost. |
Double |
DoubleDataStore.get(DBIDRef id)
Deprecated.
Use
DoubleDataStore.doubleValue(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. |
int |
IntegerDataStore.intValue(DBIDRef id)
Retrieves an object 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 |
WritableDoubleDistanceDataStore.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. |
DoubleDistance |
WritableDoubleDistanceDataStore.put(DBIDRef id,
DoubleDistance value)
Deprecated.
Use
WritableDoubleDistanceDataStore.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.
|
double |
WritableDoubleDistanceDataStore.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 |
---|---|
void |
ArrayDBIDStore.assignVar(DBIDRef id,
DBIDVar var) |
void |
MapIntegerDBIDDBIDStore.assignVar(DBIDRef id,
DBIDVar var) |
void |
MapIntegerDBIDDoubleDistanceStore.delete(DBIDRef id) |
void |
MapIntegerDBIDIntegerStore.delete(DBIDRef id) |
void |
MapIntegerDBIDStore.delete(DBIDRef id) |
void |
ArrayDoubleStore.delete(DBIDRef id) |
void |
ArrayStore.delete(DBIDRef id) |
void |
MapRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
MapStore.delete(DBIDRef id) |
void |
MapIntegerDBIDRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
ArrayRecordStore.StorageAccessor.delete(DBIDRef id) |
void |
ArrayIntegerStore.delete(DBIDRef id) |
void |
ArrayDBIDStore.delete(DBIDRef id) |
void |
ArrayDoubleDistanceStore.delete(DBIDRef id) |
void |
MapIntegerDBIDDBIDStore.delete(DBIDRef id) |
void |
MapIntegerDBIDDoubleStore.delete(DBIDRef id) |
double |
MapIntegerDBIDDoubleDistanceStore.doubleValue(DBIDRef id) |
double |
ArrayDoubleStore.doubleValue(DBIDRef id) |
double |
ArrayDoubleDistanceStore.doubleValue(DBIDRef id) |
double |
MapIntegerDBIDDoubleStore.doubleValue(DBIDRef id) |
DoubleDistance |
MapIntegerDBIDDoubleDistanceStore.get(DBIDRef id)
Deprecated.
|
Integer |
MapIntegerDBIDIntegerStore.get(DBIDRef id)
Deprecated.
|
T |
MapIntegerDBIDStore.get(DBIDRef id) |
Double |
ArrayDoubleStore.get(DBIDRef id)
Deprecated.
|
T |
ArrayStore.get(DBIDRef id) |
T |
MapRecordStore.StorageAccessor.get(DBIDRef id) |
T |
MapStore.get(DBIDRef id) |
T |
MapIntegerDBIDRecordStore.StorageAccessor.get(DBIDRef id) |
T |
ArrayRecordStore.StorageAccessor.get(DBIDRef id) |
Integer |
ArrayIntegerStore.get(DBIDRef id)
Deprecated.
|
DBID |
ArrayDBIDStore.get(DBIDRef id)
Deprecated.
|
DoubleDistance |
ArrayDoubleDistanceStore.get(DBIDRef id)
Deprecated.
|
DBID |
MapIntegerDBIDDBIDStore.get(DBIDRef id)
Deprecated.
|
Double |
MapIntegerDBIDDoubleStore.get(DBIDRef id)
Deprecated.
|
protected <T> T |
MapRecordStore.get(DBIDRef id,
int index)
Actual getter.
|
protected <T> T |
MapIntegerDBIDRecordStore.get(DBIDRef id,
int index)
Actual getter.
|
protected <T> T |
ArrayRecordStore.get(DBIDRef id,
int index)
Actual getter
|
int |
MapIntegerDBIDIntegerStore.intValue(DBIDRef id) |
int |
ArrayIntegerStore.intValue(DBIDRef id) |
DBID |
ArrayDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
DBID |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBID value)
Deprecated.
|
void |
ArrayDBIDStore.put(DBIDRef id,
DBIDRef value) |
void |
MapIntegerDBIDDBIDStore.put(DBIDRef id,
DBIDRef value) |
double |
MapIntegerDBIDDoubleDistanceStore.put(DBIDRef id,
double value) |
double |
ArrayDoubleStore.put(DBIDRef id,
double value) |
double |
ArrayDoubleDistanceStore.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.
|
DoubleDistance |
MapIntegerDBIDDoubleDistanceStore.put(DBIDRef id,
DoubleDistance value)
Deprecated.
|
DoubleDistance |
ArrayDoubleDistanceStore.put(DBIDRef id,
DoubleDistance 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 |
MapIntegerDBIDStore.put(DBIDRef id,
T value) |
T |
ArrayStore.put(DBIDRef id,
T value) |
T |
MapRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
T |
MapStore.put(DBIDRef id,
T value) |
T |
MapIntegerDBIDRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
T |
ArrayRecordStore.StorageAccessor.put(DBIDRef id,
T value) |
void |
ArrayDBIDStore.putDBID(DBIDRef id,
DBIDRef value) |
void |
MapIntegerDBIDDBIDStore.putDBID(DBIDRef id,
DBIDRef value) |
double |
MapIntegerDBIDDoubleDistanceStore.putDouble(DBIDRef id,
double value) |
double |
ArrayDoubleStore.putDouble(DBIDRef id,
double value) |
double |
ArrayDoubleDistanceStore.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 |
MapRecordStore.remove(DBIDRef id) |
boolean |
MapIntegerDBIDRecordStore.remove(DBIDRef id) |
boolean |
ArrayRecordStore.remove(DBIDRef id) |
protected <T> T |
MapRecordStore.set(DBIDRef id,
int index,
T value)
Actual setter.
|
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
|
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 |
DistanceDBIDPair<D extends Distance<D>>
Pair containing a distance an an object ID
Note: there is no getter for the object, as this is a
DBIDRef . |
interface |
DoubleDBIDPair
Pair of a double value and a DBID
|
interface |
DoubleDistanceDBIDPair
Pair containing a double distance a DBID.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
EmptyDBIDs.EmptyDBIDIterator
Iterator for empty DBIDs-
|
Modifier and Type | Method and Description |
---|---|
static DBIDRef |
DBIDUtil.invalid()
Get the invalid special ID.
|
DBIDRef |
DBIDFactory.invalid()
Get the invalid DBID value, usable as "undefined" placeholder.
|
Modifier and Type | Method and Description |
---|---|
boolean |
ModifiableDBIDs.add(DBIDRef id)
Add a single DBID to the collection.
|
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.
|
static int |
DBIDUtil.compare(DBIDRef id1,
DBIDRef id2)
Compare two DBIDs.
|
int |
DBIDFactory.compare(DBIDRef a,
DBIDRef b)
Compare two DBIDs, for sorting.
|
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.
|
static boolean |
DBIDUtil.equal(DBIDRef id1,
DBIDRef id2)
Test two DBIDs for equality.
|
boolean |
DBIDFactory.equal(DBIDRef a,
DBIDRef b)
Compare two DBIDs, for equality testing.
|
int |
DBIDRange.getOffset(DBIDRef dbid)
Get offset in the array for a particular DBID.
|
static <D extends Distance<D>> |
DBIDUtil.newDistancePair(D dist,
DBIDRef id)
Make a DistanceDBIDPair.
|
<D extends Distance<D>> |
DBIDFactory.newDistancePair(D val,
DBIDRef id)
Make a new distance-DBID pair.
|
static DoubleDistanceDBIDPair |
DBIDUtil.newDistancePair(double dist,
DBIDRef id)
Make a DoubleDistanceDBIDPair.
|
DoubleDistanceDBIDPair |
DBIDFactory.newDistancePair(double val,
DBIDRef id)
Make a new distance-DBID pair.
|
static DBIDPair |
DBIDUtil.newPair(DBIDRef id1,
DBIDRef id2)
Make a DBID pair.
|
DBIDPair |
DBIDFactory.newPair(DBIDRef id1,
DBIDRef id2)
Make a DBID pair from two existing DBIDs.
|
static DoubleDBIDPair |
DBIDUtil.newPair(double val,
DBIDRef id)
Make a DoubleDBIDPair.
|
DoubleDBIDPair |
DBIDFactory.newPair(double val,
DBIDRef id)
Make a double-DBID pair.
|
static DBIDVar |
DBIDUtil.newVar(DBIDRef val)
Make a new DBID variable.
|
DBIDVar |
DBIDFactory.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)
|
static String |
DBIDUtil.toString(DBIDRef id)
Format a DBID as string.
|
String |
DBIDFactory.toString(DBIDRef id)
Print 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 |
---|---|
class |
DBIDIterAdapter
Iterator for classic collections.
|
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 |
UnmodifiableArrayDBIDs.contains(DBIDRef o) |
boolean |
UnmodifiableDBIDs.contains(DBIDRef o) |
boolean |
MergedDBIDs.contains(DBIDRef o) |
boolean |
MaskedDBIDs.contains(DBIDRef o) |
Modifier and Type | Interface and Description |
---|---|
interface |
IntegerDBIDArrayIter
Modifiable integer array iterator.
|
interface |
IntegerDBIDArrayMIter
Modifiable integer array iterator.
|
interface |
IntegerDBIDIter
Iterator for integer DBIDs.
|
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 |
---|---|
(package private) class |
DistanceIntegerDBIDPair<D extends Distance<D>>
Class storing a double distance a DBID.
|
(package private) class |
DoubleDistanceIntegerDBIDPair
Class storing a double distance a DBID.
|
protected class |
IntArrayStaticDBIDs.DBIDItr
DBID iterator in ELKI/C style.
|
(package private) class |
IntegerDBID
Database ID object.
|
protected class |
IntegerDBID.DBIDItr
Pseudo iterator for DBIDs interface.
|
protected static class |
IntegerDBIDRange.DBIDItr
Iterator in ELKI/C++ style.
|
(package private) class |
IntegerDBIDVar
Variable for storing a single DBID reference.
|
protected class |
IntegerDBIDVar.DBIDItr
Pseudo iterator for DBIDs interface.
|
(package private) class |
IntegerDoubleDBIDPair
Pair containing a double value and an integer DBID.
|
protected static class |
TroveArrayDBIDs.DBIDItr
Iterate over a Trove IntList, ELKI/C-style.
|
protected static class |
TroveHashSetModifiableDBIDs.DBIDItr
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 |
SimpleDBIDFactory.invalid() |
DBIDRef |
TrivialDBIDFactory.invalid() |
Modifier and Type | Method and Description |
---|---|
boolean |
TroveArrayModifiableDBIDs.add(DBIDRef e) |
boolean |
TroveHashSetModifiableDBIDs.add(DBIDRef e) |
int |
TroveArrayDBIDs.binarySearch(DBIDRef key) |
int |
IntArrayStaticDBIDs.binarySearch(DBIDRef key) |
int |
UnmodifiableIntegerArrayDBIDs.binarySearch(DBIDRef key) |
int |
IntegerDBID.binarySearch(DBIDRef key) |
int |
IntegerDBIDVar.binarySearch(DBIDRef key) |
int |
IntegerDBIDRange.binarySearch(DBIDRef key) |
int |
SimpleDBIDFactory.compare(DBIDRef a,
DBIDRef b) |
int |
TrivialDBIDFactory.compare(DBIDRef a,
DBIDRef b) |
int |
IntegerDBID.compareTo(DBIDRef o) |
boolean |
TroveArrayDBIDs.contains(DBIDRef o) |
boolean |
IntArrayStaticDBIDs.contains(DBIDRef o) |
boolean |
UnmodifiableIntegerDBIDs.contains(DBIDRef o) |
boolean |
UnmodifiableIntegerArrayDBIDs.contains(DBIDRef o) |
boolean |
IntegerDBID.contains(DBIDRef o) |
boolean |
IntegerDBIDVar.contains(DBIDRef o) |
boolean |
IntegerDBIDRange.contains(DBIDRef o) |
boolean |
TroveHashSetModifiableDBIDs.contains(DBIDRef o) |
void |
ReusingDBIDFactory.deallocateSingleDBID(DBIDRef id) |
void |
SimpleDBIDFactory.deallocateSingleDBID(DBIDRef id) |
void |
TrivialDBIDFactory.deallocateSingleDBID(DBIDRef id) |
boolean |
SimpleDBIDFactory.equal(DBIDRef a,
DBIDRef b) |
boolean |
TrivialDBIDFactory.equal(DBIDRef a,
DBIDRef b) |
int |
IntegerDBIDRange.getOffset(DBIDRef dbid)
For storage array offsets.
|
int |
IntegerDBIDRange.mapDBIDToOffset(DBIDRef dbid) |
<D extends Distance<D>> |
SimpleDBIDFactory.newDistancePair(D val,
DBIDRef id) |
<D extends Distance<D>> |
TrivialDBIDFactory.newDistancePair(D val,
DBIDRef id) |
DoubleDistanceDBIDPair |
SimpleDBIDFactory.newDistancePair(double val,
DBIDRef id) |
DoubleDistanceDBIDPair |
TrivialDBIDFactory.newDistancePair(double val,
DBIDRef id) |
DBIDPair |
SimpleDBIDFactory.newPair(DBIDRef first,
DBIDRef second) |
DBIDPair |
TrivialDBIDFactory.newPair(DBIDRef first,
DBIDRef second) |
DoubleDBIDPair |
SimpleDBIDFactory.newPair(double val,
DBIDRef id) |
DoubleDBIDPair |
TrivialDBIDFactory.newPair(double val,
DBIDRef id) |
DBIDVar |
SimpleDBIDFactory.newVar(DBIDRef val) |
DBIDVar |
TrivialDBIDFactory.newVar(DBIDRef val) |
boolean |
TroveArrayModifiableDBIDs.remove(DBIDRef o) |
boolean |
TroveHashSetModifiableDBIDs.remove(DBIDRef o) |
void |
IntegerDBIDVar.set(DBIDRef ref) |
DBID |
TroveArrayModifiableDBIDs.set(int index,
DBIDRef element) |
String |
SimpleDBIDFactory.toString(DBIDRef id) |
String |
TrivialDBIDFactory.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 |
TroveArrayModifiableDBIDs.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 |
TroveArrayModifiableDBIDs.sort(int start,
int end,
Comparator<? super DBIDRef> comparator) |
Constructor and Description |
---|
IntegerDBIDVar(DBIDRef val)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
D |
PrimitiveDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
D |
DistanceQuery.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
abstract D |
AbstractDistanceQuery.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
D |
DBIDDistanceQuery.distance(DBIDRef id1,
DBIDRef id2) |
D |
PrimitiveDistanceQuery.distance(DBIDRef id1,
O o2) |
D |
AbstractDatabaseDistanceQuery.distance(DBIDRef id1,
O o2) |
D |
DistanceQuery.distance(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
abstract D |
AbstractDistanceQuery.distance(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
D |
PrimitiveDistanceQuery.distance(O o1,
DBIDRef id2) |
D |
AbstractDatabaseDistanceQuery.distance(O o1,
DBIDRef id2) |
D |
DistanceQuery.distance(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
abstract D |
AbstractDistanceQuery.distance(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
D |
PrimitiveDistanceSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2) |
D |
PrimitiveDistanceSimilarityQuery.similarity(DBIDRef id1,
O o2) |
D |
PrimitiveDistanceSimilarityQuery.similarity(O o1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
KNNResult<D> |
KNNQuery.getKNNForDBID(DBIDRef id,
int k)
Get the k nearest neighbors for a particular id.
|
KNNResult<DoubleDistance> |
LinearScanRawDoubleDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNResult<D> |
PreprocessorKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNResult<D> |
LinearScanKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
abstract KNNResult<D> |
AbstractDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNResult<D> |
LinearScanPrimitiveDistanceKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
Modifier and Type | Method and Description |
---|---|
DistanceDBIDResult<D> |
LinearScanPrimitiveDistanceRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
DistanceDBIDResult<D> |
RangeQuery.getRangeForDBID(DBIDRef id,
D range)
Get the nearest neighbors for a particular id in a given query range
|
abstract DistanceDBIDResult<D> |
AbstractDistanceRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
DistanceDBIDResult<D> |
LinearScanRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
DistanceDBIDResult<DoubleDistance> |
LinearScanRawDoubleDistanceRangeQuery.getRangeForDBID(DBIDRef id,
DoubleDistance range) |
Modifier and Type | Method and Description |
---|---|
DistanceDBIDResult<D> |
LinearScanRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
DistanceDBIDResult<D> |
RKNNQuery.getRKNNForDBID(DBIDRef id,
int k)
Get the reverse k nearest neighbors for a particular id.
|
DistanceDBIDResult<D> |
PreprocessorRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
abstract DistanceDBIDResult<D> |
AbstractRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
Modifier and Type | Method and Description |
---|---|
D |
SimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2)
Returns the similarity between the two objects specified by their object
ids.
|
D |
PrimitiveSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2) |
abstract D |
AbstractSimilarityQuery.similarity(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
D |
SimilarityQuery.similarity(DBIDRef id1,
O o2)
Returns the similarity between the two objects specified by their object
ids.
|
D |
PrimitiveSimilarityQuery.similarity(DBIDRef id1,
O o2) |
abstract D |
AbstractSimilarityQuery.similarity(DBIDRef id1,
O o2)
Returns the distance between the two objects specified by their object ids.
|
D |
AbstractDBIDSimilarityQuery.similarity(DBIDRef id1,
O o2) |
D |
SimilarityQuery.similarity(O o1,
DBIDRef id2)
Returns the similarity between the two objects specified by their object
ids.
|
D |
PrimitiveSimilarityQuery.similarity(O o1,
DBIDRef id2) |
abstract D |
AbstractSimilarityQuery.similarity(O o1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
D |
AbstractDBIDSimilarityQuery.similarity(O o1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
void |
ConvertToStringView.delete(DBIDRef id) |
void |
ProxyView.delete(DBIDRef id) |
void |
MaterializedRelation.delete(DBIDRef id)
Delete an objects values.
|
void |
DBIDView.delete(DBIDRef id) |
void |
ProjectedView.delete(DBIDRef id) |
void |
Relation.delete(DBIDRef id)
Delete an objects values.
|
String |
ConvertToStringView.get(DBIDRef id) |
O |
ProxyView.get(DBIDRef id) |
O |
MaterializedRelation.get(DBIDRef id) |
DBID |
DBIDView.get(DBIDRef id) |
OUT |
ProjectedView.get(DBIDRef id) |
O |
Relation.get(DBIDRef id)
Get the representation of an object.
|
void |
DBIDView.set(DBIDRef id,
DBID val) |
void |
ProxyView.set(DBIDRef id,
O val) |
void |
MaterializedRelation.set(DBIDRef id,
O val) |
void |
Relation.set(DBIDRef id,
O val)
Set an object representation.
|
void |
ProjectedView.set(DBIDRef id,
OUT val) |
void |
ConvertToStringView.set(DBIDRef id,
String val) |
Modifier and Type | Method and Description |
---|---|
abstract D |
AbstractDBIDDistanceFunction.distance(DBIDRef o1,
DBIDRef o2) |
D |
ProxyDistanceFunction.distance(DBIDRef o1,
DBIDRef o2) |
D |
MinKDistance.Instance.distance(DBIDRef id1,
DBIDRef id2) |
DoubleDistance |
SharedNearestNeighborJaccardDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2) |
D |
DBIDDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their object ids.
|
DoubleDistance |
LocallyWeightedDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2)
Computes the distance between two given real vectors according to this
distance function.
|
DoubleDistance |
RandomStableDistanceFunction.distance(DBIDRef o1,
DBIDRef o2) |
Modifier and Type | Method and Description |
---|---|
DoubleDistance |
AbstractSimilarityAdapter.Instance.distance(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
PCACorrelationDistance |
PCABasedCorrelationDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2) |
BitDistance |
ERiCDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2)
Note, that the pca of o1 must have equal ore more strong eigenvectors
than the pca of o2.
|
Modifier and Type | Method and Description |
---|---|
boolean |
NumberDistanceParser.containsKey(DBIDRef id1,
DBIDRef id2,
Map<DBIDPair,D> cache)
Returns true if the specified distance cache contains a distance
value for the specified ids.
|
DoubleDistance |
FileBasedDoubleDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their objects
ids.
|
FloatDistance |
FileBasedFloatDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their objects
ids.
|
DoubleDistance |
DiskCacheBasedDoubleDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their objects
ids.
|
FloatDistance |
DiskCacheBasedFloatDistanceFunction.distance(DBIDRef id1,
DBIDRef id2)
Returns the distance between the two objects specified by their objects
ids.
|
Modifier and Type | Method and Description |
---|---|
PreferenceVectorBasedCorrelationDistance |
AbstractPreferenceVectorBasedCorrelationDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2) |
SubspaceDistance |
LocalSubspaceDistanceFunction.Instance.distance(DBIDRef id1,
DBIDRef id2)
Note, that the pca of o1 must have equal ore more strong eigenvectors
than the pca of o2.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DistanceDBIDResultIter<D extends Distance<D>>
Iterator over distance-based query results.
|
interface |
DoubleDistanceDBIDResultIter
Iterator for double valued distance-based query results.
|
Modifier and Type | Class and Description |
---|---|
protected class |
DoubleDistanceDBIDList.Iter
Iterator class.
|
private class |
DoubleDistanceKNNList.Itr
Iterator.
|
protected class |
GenericDistanceDBIDList.Iter
Iterator class.
|
private class |
GenericKNNList.Itr
Iterator.
|
private class |
KNNUtil.KNNSubList.Itr
Iterator for the sublist.
|
Modifier and Type | Method and Description |
---|---|
void |
GenericKNNHeap.add(D distance,
DBIDRef id) |
void |
KNNHeap.add(D distance,
DBIDRef id)
Add a distance-id pair to the heap unless the distance is too large.
|
void |
GenericDistanceDBIDList.add(D dist,
DBIDRef id) |
void |
ModifiableDistanceDBIDResult.add(D distance,
DBIDRef id)
Add an object to this result.
|
void |
DoubleDistanceKNNHeap.add(double distance,
DBIDRef id)
Add a distance-id pair to the heap unless the distance is too large.
|
void |
DoubleDistanceDBIDList.add(double dist,
DBIDRef id)
Add an element.
|
void |
DoubleDistanceKNNHeap.add(Double distance,
DBIDRef id)
Add a distance-id pair to the heap unless the distance is too large.
|
void |
DoubleDistanceKNNHeap.add(DoubleDistance dist,
DBIDRef id)
Deprecated.
if you know your distances are double-valued, you should be
using the primitive type.
|
void |
DoubleDistanceDBIDList.add(DoubleDistance dist,
DBIDRef id)
Deprecated.
Pass a double value instead.
|
boolean |
GenericDistanceDBIDList.contains(DBIDRef o) |
boolean |
KNNUtil.KNNSubList.contains(DBIDRef o) |
boolean |
DoubleDistanceDBIDList.contains(DBIDRef o) |
boolean |
DoubleDistanceKNNList.contains(DBIDRef o) |
boolean |
GenericKNNList.contains(DBIDRef o) |
Modifier and Type | Method and Description |
---|---|
DoubleDistance |
FractionalSharedNearestNeighborSimilarityFunction.Instance.similarity(DBIDRef id1,
DBIDRef id2) |
IntegerDistance |
SharedNearestNeighborSimilarityFunction.Instance.similarity(DBIDRef id1,
DBIDRef id2) |
Modifier and Type | Method and Description |
---|---|
Pair<D,DBIDRef> |
ROC.DistanceResultAdapter.next() |
Modifier and Type | Method and Description |
---|---|
static <C extends Comparable<? super C>> |
ROC.materializeROC(int size,
SetDBIDs ids,
Iterator<? extends PairInterface<C,? extends DBIDRef>> nei)
Compute a ROC curve given a set of positive IDs and a sorted list of
(comparable, ID)s, where the comparable object is used to decided when two
objects are interchangeable.
|
Modifier and Type | Method and Description |
---|---|
boolean |
AbstractIndex.delete(DBIDRef id) |
boolean |
Index.delete(DBIDRef id)
Deletes the specified object from this index.
|
KNNResult<D> |
AbstractRefiningIndex.AbstractKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DistanceDBIDResult<D> |
AbstractRefiningIndex.AbstractRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
void |
AbstractIndex.insert(DBIDRef id) |
void |
Index.insert(DBIDRef id)
Inserts the specified object into this index.
|
protected D |
AbstractRefiningIndex.AbstractRangeQuery.refine(DBIDRef id,
O q)
Refinement distance computation.
|
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) |
KNNResult<D> |
AbstractMaterializeKNNPreprocessor.get(DBIDRef id)
Get the k nearest neighbors.
|
GenericDistanceDBIDList<D> |
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 DistanceDBIDResult<DoubleDistance> |
AbstractFilteredPCAIndex.objectsForPCA(DBIDRef id)
Returns the objects to be considered within the PCA for the specified query
object.
|
protected KNNResult<DoubleDistance> |
KNNQueryFilteredPCAIndex.objectsForPCA(DBIDRef id) |
protected DistanceDBIDResult<DoubleDistance> |
RangeQueryFilteredPCAIndex.objectsForPCA(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
private BitSet |
HiSCPreferenceVectorIndex.determinePreferenceVector(Relation<V> relation,
DBIDRef id,
DBIDs neighborIDs,
StringBuilder msg)
Determines the preference vector according to the specified neighbor ids.
|
BitSet |
AbstractPreferenceVectorIndex.getPreferenceVector(DBIDRef objid) |
BitSet |
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 |
---|---|
protected abstract P |
AbstractSubspaceProjectionIndex.computeProjection(DBIDRef id,
DistanceDBIDResult<D> neighbors,
Relation<NV> relation)
This method implements the type of variance analysis to be computed for a
given point.
|
protected SubspaceProjectionResult |
PreDeConSubspaceIndex.computeProjection(DBIDRef id,
DistanceDBIDResult<D> neighbors,
Relation<V> database) |
protected PCAFilteredResult |
FourCSubspaceIndex.computeProjection(DBIDRef id,
DistanceDBIDResult<D> neighbors,
Relation<V> database) |
P |
SubspaceProjectionIndex.getLocalProjection(DBIDRef objid)
Get the precomputed local subspace for a particular object ID.
|
P |
AbstractSubspaceProjectionIndex.getLocalProjection(DBIDRef objid) |
Modifier and Type | Method and Description |
---|---|
abstract DistanceDBIDResult<D> |
AbstractMkTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
MkAppTreeIndex.delete(DBIDRef id)
Throws an UnsupportedOperationException since deletion of objects is not
yet supported by an M-Tree.
|
void |
MkAppTreeIndex.insert(DBIDRef id) |
DistanceDBIDResult<D> |
MkAppTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
MkCoPTreeIndex.delete(DBIDRef id)
Throws an UnsupportedOperationException since deletion of objects is not
yet supported by an M-Tree.
|
private void |
MkCoPTree.doReverseKNNQuery(int k,
DBIDRef q,
GenericDistanceDBIDList<D> result,
ModifiableDBIDs candidates)
Performs a reverse knn query.
|
void |
MkCoPTreeIndex.insert(DBIDRef id) |
DistanceDBIDResult<D> |
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,D> node,
MkMaxEntry<D> node_entry,
ModifiableDistanceDBIDResult<D> result)
Performs a reverse k-nearest neighbor query in the specified subtree for
the given query object with k =
AbstractMkTreeUnified.k_max . |
void |
MkMaxTreeIndex.insert(DBIDRef id) |
DistanceDBIDResult<D> |
MkMaxTree.reverseKNNQuery(DBIDRef id,
int k)
Performs a reverse k-nearest neighbor query for the given object ID.
|
Modifier and Type | Method and Description |
---|---|
boolean |
MkTabTreeIndex.delete(DBIDRef id)
Throws an UnsupportedOperationException since deletion of objects is not
yet supported by an M-Tree.
|
private void |
MkTabTree.doReverseKNNQuery(int k,
DBIDRef q,
MkTabEntry<D> node_entry,
MkTabTreeNode<O,D> node,
GenericDistanceDBIDList<D> result)
Performs a k-nearest neighbor query in the specified subtree for the given
query object and the given parameter k.
|
void |
MkTabTreeIndex.insert(DBIDRef id) |
DistanceDBIDResult<D> |
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.
|
void |
MTreeIndex.insert(DBIDRef id) |
Modifier and Type | Method and Description |
---|---|
KNNResult<D> |
MetricalIndexKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNResult<DoubleDistance> |
DoubleDistanceMetricalIndexKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DistanceDBIDResult<D> |
MetricalIndexRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
DistanceDBIDResult<DoubleDistance> |
DoubleDistanceMetricalIndexRangeQuery.getRangeForDBID(DBIDRef id,
DoubleDistance range) |
DistanceDBIDResult<D> |
MkTreeRKNNQuery.getRKNNForDBID(DBIDRef id,
int k) |
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 |
---|---|
DoubleDistanceKNNList |
DoubleDistanceRStarTreeKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
KNNResult<D> |
GenericRStarTreeKNNQuery.getKNNForDBID(DBIDRef id,
int k) |
DistanceDBIDResult<D> |
GenericRStarTreeRangeQuery.getRangeForDBID(DBIDRef id,
D range) |
DistanceDBIDResult<DoubleDistance> |
DoubleDistanceRStarTreeRangeQuery.getRangeForDBID(DBIDRef id,
DoubleDistance range) |
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 |
---|---|
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 |
---|---|
void |
ClusterOrderResult.ReachabilityDistanceAdapter.delete(DBIDRef id) |
void |
ClusterOrderResult.PredecessorAdapter.delete(DBIDRef id) |
D |
ClusterOrderResult.ReachabilityDistanceAdapter.get(DBIDRef objID) |
DBID |
ClusterOrderResult.PredecessorAdapter.get(DBIDRef objID) |
void |
ClusterOrderResult.ReachabilityDistanceAdapter.set(DBIDRef id,
D val) |
void |
ClusterOrderResult.PredecessorAdapter.set(DBIDRef id,
DBID val) |
Modifier and Type | Method and Description |
---|---|
int |
OrderingFromRelation.ImpliedComparator.compare(DBIDRef id1,
DBIDRef id2) |
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)
Sort a small array using repetitive insertion sort.
|
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.
|
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 |
ClusterStylingPolicy.getColorForDBID(DBIDRef id) |
int |
StylingPolicy.getColorForDBID(DBIDRef id)
Get the color for an individual object.
|
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 |
---|---|
protected Element |
TooltipScoreVisualization.Instance.makeTooltip(DBIDRef id,
double x,
double y,
double dotsize) |
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) |
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.
|