| Package | Description | 
|---|---|
| de.lmu.ifi.dbs.elki.algorithm.timeseries | 
 Algorithms for change point detection in time series. 
 | 
| de.lmu.ifi.dbs.elki.index.idistance | 
 iDistance is a distance based indexing technique, using a reference points embedding. 
 | 
| de.lmu.ifi.dbs.elki.index.tree.metrical.mtreevariants | 
 M-Tree and variants 
 | 
| de.lmu.ifi.dbs.elki.index.tree.spatial.rstarvariants.strategies.split | 
 Splitting strategies for R-Trees 
 | 
| de.lmu.ifi.dbs.elki.utilities.pairs | 
 Pairs utility classes
 
 A number of commonly needed primitive pairs are the following:
 
  
IntIntPair storing
 two int values
 DoubleIntPair
 storing one double and one int value. | 
| de.lmu.ifi.dbs.elki.visualization.parallel3d | 
 3DPC: 3D parallel coordinate plot visualization for ELKI. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
static DoubleIntPair | 
OfflineChangePointDetectionAlgorithm.bestChangeInMean(double[] sums,
                int begin,
                int end)
Find the best position to assume a change in mean. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
protected static <O> DoubleIntPair[] | 
InMemoryIDistanceIndex.rankReferencePoints(DistanceQuery<O> distanceQuery,
                   O obj,
                   ArrayDBIDs referencepoints)
Sort the reference points by distance to the query object 
 | 
| Modifier and Type | Method and Description | 
|---|---|
protected java.util.List<DoubleIntPair> | 
AbstractMTree.getSortedEntries(N node,
                DBID q)
Sorts the entries of the specified node according to their minimum distance
 to the specified object. 
 | 
| Modifier and Type | Field and Description | 
|---|---|
(package private) DoubleIntPair[] | 
TopologicalSplitter.Split.bestSorting
Indicates whether the sorting according to maximal or to minimal value
 has been used for choosing the split axis and split point. 
 | 
(package private) DoubleIntPair[] | 
TopologicalSplitter.Split.maxSorting
The entries sorted according to their max values of their MBRs. 
 | 
(package private) DoubleIntPair[] | 
TopologicalSplitter.Split.minSorting
The entries sorted according to their min values of their MBRs. 
 | 
| Modifier and Type | Method and Description | 
|---|---|
private E | 
TopologicalSplitter.Split.get(DoubleIntPair pair)
Get an entry. 
 | 
private ModifiableHyperBoundingBox | 
TopologicalSplitter.Split.mbr(DoubleIntPair[] sorting,
   int from,
   int to)
Computes and returns the mbr of the specified nodes, only the nodes
 between from and to index are considered. 
 | 
| Modifier and Type | Field and Description | 
|---|---|
static java.util.Comparator<DoubleIntPair> | 
DoubleIntPair.BYFIRST_COMPARATOR
Comparator to compare by first component only 
 | 
static java.util.Comparator<DoubleIntPair> | 
DoubleIntPair.BYSECOND_COMPARATOR
Comparator to compare by second component only 
 | 
static java.util.Comparator<DoubleIntPair> | 
DoubleIntPair.SWAPPED_COMPARATOR
Comparator to compare by swapped components 
 | 
| Modifier and Type | Method and Description | 
|---|---|
int | 
DoubleIntPair.compareSwappedTo(DoubleIntPair other)
Implementation of comparableSwapped interface, sorting by second then
 first. 
 | 
int | 
DoubleIntPair.compareTo(DoubleIntPair other)
Implementation of comparable interface, sorting by first then second. 
 | 
| Modifier and Type | Field and Description | 
|---|---|
(package private) DoubleIntPair[] | 
Parallel3DRenderer.axes
Axes sorting array. 
 | 
Copyright © 2019 ELKI Development Team. License information.