Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.biclustering |
Biclustering algorithms.
|
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.optics |
OPTICS family of clustering algorithms.
|
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.distance.similarityfunction.kernel |
Kernel functions.
|
de.lmu.ifi.dbs.elki.index.tree.spatial.kd |
K-d-tree and variants.
|
de.lmu.ifi.dbs.elki.math.dimensionsimilarity |
Functions to compute the similarity of dimensions (or the interestingness of the combination).
|
de.lmu.ifi.dbs.elki.utilities.datastructures |
Basic memory structures such as heaps and object hierarchies.
|
Modifier and Type | Field and Description |
---|---|
private DBIDArrayIter |
AbstractBiclustering.iter
Iterator to use for more efficient random access.
|
Modifier and Type | Field and Description |
---|---|
private DBIDArrayIter |
AbstractHDBSCAN.HDBSCANAdapter.p
Iterators for accessing the data objects.
|
private DBIDArrayIter |
AbstractHDBSCAN.HDBSCANAdapter.q
Iterators for accessing the data objects.
|
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 int |
AnderbergHierarchicalClustering.findMerge(int size,
double[] scratch,
DBIDArrayIter ix,
DBIDArrayIter iy,
double[] bestd,
int[] besti,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize)
Perform the next merge step.
|
protected int |
AGNES.findMerge(int size,
double[] scratch,
DBIDArrayIter ix,
DBIDArrayIter iy,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize)
Perform the next merge step in AGNES.
|
protected static <O> void |
AGNES.initializeDistanceMatrix(double[] scratch,
DistanceQuery<O> dq,
DBIDArrayIter ix,
DBIDArrayIter iy,
boolean square)
Initialize a distance matrix.
|
protected void |
AnderbergHierarchicalClustering.merge(int size,
double[] scratch,
DBIDArrayIter ix,
DBIDArrayIter iy,
double[] bestd,
int[] besti,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize,
double mindist,
int x,
int y)
Execute the cluster merge.
|
protected void |
AGNES.merge(int size,
double[] scratch,
DBIDArrayIter ix,
DBIDArrayIter iy,
WritableDBIDDataStore pi,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize,
double mindist,
int x,
int y)
Execute the cluster merge.
|
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 |
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 |
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.
|
protected void |
AnderbergHierarchicalClustering.updateMatrix(int size,
double[] scratch,
DBIDArrayIter ij,
double[] bestd,
int[] besti,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize,
double mindist,
int x,
int y,
int sizex,
int sizey)
Update the scratch distance matrix.
|
protected void |
AGNES.updateMatrix(int size,
double[] scratch,
DBIDArrayIter ij,
WritableDoubleDataStore lambda,
WritableIntegerDataStore csize,
double mindist,
int x,
int y,
int sizex,
int sizey)
Update the scratch distance matrix.
|
Modifier and Type | Method and Description |
---|---|
private int |
ExtractFlatClusteringFromHierarchy.findSplit(ArrayDBIDs order,
DBIDArrayIter it,
DoubleDataStore lambda)
Find the splitting point in the ordered DBIDs list.
|
Modifier and Type | Field and Description |
---|---|
private DBIDArrayIter |
OPTICSXi.SteepScanPosition.cur
Variable for accessing.
|
private DBIDArrayIter |
OPTICSXi.SteepScanPosition.next
Variable for accessing.
|
Modifier and Type | Method and Description |
---|---|
DBIDArrayIter |
ClusterOrder.iter()
Get an iterator.
|
Modifier and Type | Method and Description |
---|---|
int |
OPTICSList.Instance.findMin(DBIDArrayIter it)
Find the minimum in the candidates array.
|
Modifier and Type | Interface and Description |
---|---|
interface |
DBIDArrayMIter
Modifiable array iterator.
|
interface |
DoubleDBIDListIter
Iterator over double-DBID pairs results.
|
interface |
DoubleDBIDListMIter
Modifiable DBIDList iterator.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
EmptyDBIDs.EmptyDBIDIterator
Iterator for empty DBIDs-
|
Modifier and Type | Method and Description |
---|---|
DBIDArrayIter |
DBIDArrayIter.advance() |
DBIDArrayIter |
DBIDArrayIter.advance(int count) |
DBIDArrayIter |
ArrayDBIDs.iter()
Iterable
|
DBIDArrayIter |
DBIDArrayIter.retract() |
DBIDArrayIter |
DBIDArrayIter.seek(int off) |
Modifier and Type | Class and Description |
---|---|
private class |
KNNSubList.Itr
Iterator for the sublist.
|
(package private) class |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter
Make an existing DBIDMIter unmodifiable.
|
Modifier and Type | Field and Description |
---|---|
private DBIDArrayIter |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter.it
Wrapped iterator.
|
private DBIDArrayIter |
MaskedDBIDs.DBIDItr.iter
Array iterator, for referencing.
|
private DBIDArrayIter |
MaskedDBIDs.InvDBIDItr.iter
Array iterator, for referencing.
|
Modifier and Type | Method and Description |
---|---|
DBIDArrayIter |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter.advance() |
DBIDArrayIter |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter.advance(int count) |
DBIDArrayIter |
UnmodifiableArrayDBIDs.iter() |
DBIDArrayIter |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter.retract() |
DBIDArrayIter |
UnmodifiableArrayDBIDs.UnmodifiableDBIDArrayIter.seek(int off) |
Constructor and Description |
---|
UnmodifiableDBIDArrayIter(DBIDArrayIter it)
Constructor.
|
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.
|
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.
|
private class |
DoubleIntegerDBIDPairKNNListHeap.Itr
Iterator.
|
private class |
DoubleIntegerDBIDPairList.Itr
List iterator.
|
protected class |
IntegerDBID.Itr
Pseudo iterator for DBIDs interface.
|
private class |
IntegerDBIDKNNSubList.Itr
Iterator for the sublist.
|
private static class |
IntegerDBIDRange.Itr
Iterator in ELKI/C++ style.
|
protected class |
IntegerDBIDVar.Itr
Pseudo iterator for DBIDs interface.
|
(package private) class |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter
Make an existing DBIDMIter unmodifiable.
|
Modifier and Type | Method and Description |
---|---|
DBIDArrayIter |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter.advance() |
DBIDArrayIter |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter.advance(int count) |
DBIDArrayIter |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter.retract() |
DBIDArrayIter |
UnmodifiableIntegerArrayDBIDs.UnmodifiableDBIDIter.seek(int off) |
Modifier and Type | Method and Description |
---|---|
DBIDArrayIter |
KernelMatrix.DBIDMap.iter()
Get an array iterator, for scanning.
|
DBIDArrayIter |
KernelMatrix.RangeMap.iter() |
DBIDArrayIter |
KernelMatrix.SortedArrayMap.iter() |
Modifier and Type | Method and Description |
---|---|
private double |
MinimalisticMemoryKDTree.KDTreeKNNQuery.kdKNNSearch(int left,
int right,
int axis,
O query,
KNNHeap knns,
DBIDArrayIter iter,
double maxdist)
Perform a kNN search on the kd-tree.
|
private void |
MinimalisticMemoryKDTree.KDTreeRangeQuery.kdRangeSearch(int left,
int right,
int axis,
O query,
ModifiableDoubleDBIDList res,
DBIDArrayIter iter,
double radius)
Perform a kNN search on the kd-tree.
|
Modifier and Type | Method and Description |
---|---|
private void |
MCEDimensionSimilarity.divide(DBIDArrayIter it,
double[] data,
ArrayList<DBIDs> idx,
int start,
int end,
int depth,
Mean mean)
Recursive call to further subdivide the array.
|
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.
|
Copyright © 2015 ELKI Development Team, Lehr- und Forschungseinheit für Datenbanksysteme, Ludwig-Maximilians-Universität München. License information.