Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.gdbscan |
Generalized DBSCAN.
|
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.uncertain |
Clustering algorithms for uncertain data.
|
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.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.relation |
Relations, materialized and virtual (views).
|
de.lmu.ifi.dbs.elki.index.preprocessed.fastoptics |
Preprocessed index used by the FastOPTICS algorithm.
|
de.lmu.ifi.dbs.elki.result |
Result types, representation and handling
|
Modifier and Type | Field and Description |
---|---|
protected DataStore<M> |
AbstractRangeQueryNeighborPredicate.Instance.storage
Model storage.
|
Modifier and Type | Method and Description |
---|---|
DataStore<M> |
AbstractRangeQueryNeighborPredicate.preprocess(Class<? super M> modelcls,
Relation<O> relation,
RangeQuery<O> query)
Perform the preprocessing step.
|
Constructor and Description |
---|
Instance(DBIDs ids,
DataStore<COPACNeighborPredicate.COPACModel> storage)
Constructor.
|
Instance(DBIDs ids,
DataStore<M> storage)
Constructor.
|
Instance(DBIDs ids,
DataStore<PCAFilteredResult> storage,
Relation<? extends NumberVector> relation)
Constructor.
|
Instance(DBIDs ids,
DataStore<PreDeConNeighborPredicate.PreDeConModel> storage)
Constructor.
|
Instance(DBIDs ids,
DataStore<PreDeConNeighborPredicate.PreDeConModel> storage)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
(package private) DataStore<? extends DBIDs> |
FastOPTICS.neighs
neighbors of a point
|
Modifier and Type | Method and Description |
---|---|
private void |
DeLiClu.expandLeafNodes(SpatialPrimitiveDistanceFunction<NV> distFunction,
DeLiCluNode node1,
DeLiCluNode node2,
DataStore<KNNList> knns)
Expands the specified leaf nodes.
|
private void |
DeLiClu.expandNodes(DeLiCluTree index,
SpatialPrimitiveDistanceFunction<NV> distFunction,
DeLiClu.SpatialObjectPair nodePair,
DataStore<KNNList> knns)
Expands the spatial nodes of the specified pair.
|
private void |
DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV> distFunction,
DeLiCluTree index,
IndexTreePath<DeLiCluEntry> path,
DataStore<KNNList> knns)
Reinserts the objects of the already expanded nodes.
|
private void |
DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV> distFunction,
DeLiCluTree index,
List<IndexTreePath<DeLiCluEntry>> path,
int pos,
DeLiCluEntry parentEntry,
DataStore<KNNList> knns) |
Modifier and Type | Method and Description |
---|---|
private DataStore<DoubleDBIDList> |
PROCLUS.getLocalities(DBIDs medoids,
Relation<V> database,
DistanceQuery<V> distFunc,
RangeQuery<V> rangeQuery)
Computes the localities of the specified medoids: for each medoid m the
objects in the sphere centered at m with radius minDist are determined,
where minDist is the minimum distance between medoid m and any other medoid
m_i.
|
Modifier and Type | Method and Description |
---|---|
protected C |
CenterOfMassMetaClustering.runClusteringAlgorithm(ResultHierarchy hierarchy,
Result parent,
DBIDs ids,
DataStore<DoubleVector> store,
int dim,
String title)
Run a clustering algorithm on a single instance.
|
protected Clustering<?> |
RepresentativeUncertainClustering.runClusteringAlgorithm(ResultHierarchy hierarchy,
Result parent,
DBIDs ids,
DataStore<DoubleVector> store,
int dim,
String title)
Run a clustering algorithm on a single instance.
|
Modifier and Type | Field and Description |
---|---|
private DataStore<? extends KNNList> |
SimplifiedLRDProcessor.knns
KNN store
|
private DataStore<? extends KNNList> |
LOFProcessor.knns
KNN store
|
private DataStore<? extends KNNList> |
LRDProcessor.knns
KNN store
|
Constructor and Description |
---|
LOFProcessor(DataStore<? extends KNNList> knns,
DoubleDataStore lrds,
boolean noself)
Constructor.
|
LRDProcessor(DataStore<? extends KNNList> knns,
DoubleDataStore kdists)
Constructor.
|
SimplifiedLRDProcessor(DataStore<? extends KNNList> knns)
Constructor.
|
Modifier and Type | Field and Description |
---|---|
protected DataStore<DBIDs> |
AbstractPrecomputedNeighborhood.store
The data
|
Modifier and Type | Method and Description |
---|---|
private DataStore<DBIDs> |
ExtendedNeighborhood.Factory.extendNeighborhood(Database database,
Relation<? extends O> relation)
Method to load the external neighbors.
|
private DataStore<DBIDs> |
ExternalNeighborhood.Factory.loadNeighbors(Database database,
Relation<?> relation)
Method to load the external neighbors.
|
Constructor and Description |
---|
AbstractPrecomputedNeighborhood(DataStore<DBIDs> store)
Constructor.
|
ExtendedNeighborhood(DataStore<DBIDs> store)
Constructor.
|
ExternalNeighborhood(DataStore<DBIDs> store)
Constructor.
|
PrecomputedKNearestNeighborNeighborhood(DataStore<DBIDs> store)
Constructor.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DBIDDataStore
DBID-valued data store (avoids boxing/unboxing).
|
interface |
DoubleDataStore
Double-valued data store (avoids boxing/unboxing).
|
interface |
IntegerDataStore
Integer-valued data store (avoids boxing/unboxing).
|
interface |
WritableDataStore<T>
Writable data store.
|
interface |
WritableDBIDDataStore
Data store specialized for doubles.
|
interface |
WritableDoubleDataStore
Data store specialized for doubles.
|
interface |
WritableIntegerDataStore
Data store specialized for doubles.
|
Modifier and Type | Method and Description |
---|---|
<T> DataStore<T> |
RecordStore.getStorage(int col,
Class<? super T> datatype)
Get a
DataStore instance for a particular record column. |
Modifier and Type | Class and Description |
---|---|
class |
ArrayDBIDStore
A class to answer representation queries using the stored Array.
|
class |
ArrayDoubleStore
A class to answer representation queries using the stored Array.
|
class |
ArrayIntegerStore
A class to answer representation queries using the stored Array.
|
protected class |
ArrayRecordStore.StorageAccessor<T>
Access a single record in the given data.
|
class |
ArrayStore<T>
A class to answer representation queries using the stored Array.
|
class |
MapIntegerDBIDDBIDStore
Writable data store for double values.
|
class |
MapIntegerDBIDDoubleStore
Writable data store for double values.
|
class |
MapIntegerDBIDIntegerStore
Writable data store for double values.
|
protected class |
MapIntegerDBIDRecordStore.StorageAccessor<T>
Access a single record in the given data.
|
class |
MapIntegerDBIDStore<T>
A class to answer representation queries using a map.
|
protected class |
MapRecordStore.StorageAccessor<T>
Access a single record in the given data.
|
class |
MapStore<T>
A class to answer representation queries using a map.
|
Modifier and Type | Field and Description |
---|---|
private DataStore<O> |
MaterializedRelation.content
Map to hold the objects of the database.
|
Constructor and Description |
---|
MaterializedRelation(SimpleTypeInformation<O> type,
DBIDs ids,
String name,
DataStore<O> content)
Constructor.
|
MaterializedRelation(String name,
String shortname,
SimpleTypeInformation<O> type,
DataStore<O> content,
DBIDs ids)
Constructor.
|
Modifier and Type | Method and Description |
---|---|
DataStore<? extends DBIDs> |
RandomProjectedNeighborssAndDensities.getNeighs()
Compute list of neighbors for each point from sets resulting from
projection
|
Modifier and Type | Field and Description |
---|---|
protected DataStore<? extends T> |
OrderingFromDataStore.map
HashMap with object values
|
Constructor and Description |
---|
OrderingFromDataStore(String name,
String shortname,
DBIDs ids,
DataStore<? extends T> map)
Minimal Constructor
|
OrderingFromDataStore(String name,
String shortname,
DBIDs ids,
DataStore<? extends T> map,
boolean descending)
Constructor without comparator
|
OrderingFromDataStore(String name,
String shortname,
DBIDs ids,
DataStore<? extends T> map,
Comparator<T> comparator,
boolean descending)
Constructor with comparator
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.