Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering |
Clustering algorithms
Clustering algorithms are supposed to implement the
Algorithm -Interface. |
de.lmu.ifi.dbs.elki.index.tree |
Tree-based index structures
|
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.util |
Utilities for R*-Tree and variants.
|
Modifier and Type | Method and Description |
---|---|
private void |
DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV,D> distFunction,
DeLiCluTree index,
List<TreeIndexPathComponent<DeLiCluEntry>> path,
DataStore<KNNList<D>> knns)
Reinserts the objects of the already expanded nodes.
|
private void |
DeLiClu.reinsertExpanded(SpatialPrimitiveDistanceFunction<NV,D> distFunction,
DeLiCluTree index,
List<TreeIndexPathComponent<DeLiCluEntry>> path,
int pos,
SpatialDirectoryEntry parentEntry,
DataStore<KNNList<D>> knns) |
Modifier and Type | Field and Description |
---|---|
private TreeIndexPathComponent<E> |
IndexTreePath.lastPathComponent
Last path component.
|
Modifier and Type | Method and Description |
---|---|
TreeIndexPathComponent<E> |
IndexTreePath.getLastPathComponent()
Returns the last component of this path.
|
TreeIndexPathComponent<E> |
IndexTreePath.getPathComponent(int element)
Returns the path component at the specified index.
|
Modifier and Type | Method and Description |
---|---|
List<TreeIndexPathComponent<E>> |
IndexTreePath.getPath()
Returns an ordered list of IndexPathComponents containing the components of
this IndexPath.
|
Modifier and Type | Method and Description |
---|---|
IndexTreePath<E> |
IndexTreePath.pathByAddingChild(TreeIndexPathComponent<E> child)
Returns a new path containing all the elements of this object plus
child . |
Constructor and Description |
---|
IndexTreePath(IndexTreePath<E> parent,
TreeIndexPathComponent<E> lastElement)
Constructs a new IndexPath, which is the path identified by
parent ending in lastElement . |
IndexTreePath(TreeIndexPathComponent<E> singlePath)
Constructs a IndexPath containing only a single element.
|
Constructor and Description |
---|
IndexTreePath(List<TreeIndexPathComponent<E>> path)
Constructs a path from a list of path components, uniquely identifying the
path from the root of the index to a specific node.
|
IndexTreePath(List<TreeIndexPathComponent<E>> path,
int length)
Constructs a new IndexPath with the identified path components of length
length . |
Modifier and Type | Method and Description |
---|---|
protected TreeIndexPathComponent<E> |
AbstractRStarTree.containedTest(N node,
SpatialComparable mbr)
Test on whether or not any child of
node contains
mbr . |
private TreeIndexPathComponent<E> |
AbstractRStarTree.getLeastEnlargement(N node,
SpatialComparable mbr)
Returns the path information of the entry of the specified node with the
least enlargement if the given mbr would be inserted into.
|
Modifier and Type | Method and Description |
---|---|
List<TreeIndexPathComponent<DeLiCluEntry>> |
DeLiCluTreeIndex.setHandled(DBID id,
O obj)
Marks the specified object as handled and returns the path of node ids from
the root to the objects's parent.
|
Modifier and Type | Field and Description |
---|---|
private TreeIndexPathComponent<E> |
Enlargement.pathComponent
The path information of the entry representing the node.
|
Modifier and Type | Method and Description |
---|---|
<N extends Node<E>,E extends SpatialEntry> |
ApproximateLeastOverlapInsertionStrategy.findInsertChild(N node,
SpatialComparable mbr)
Returns the path information of the entry of the specified node which needs
least overlap enlargement if the given mbr would be inserted into.
|
<N extends Node<E>,E extends SpatialEntry> |
InsertionStrategy.findInsertChild(N node,
SpatialComparable mbr)
Find the child to insert into.
|
<N extends Node<E>,E extends SpatialEntry> |
LeastOverlapInsertionStrategy.findInsertChild(N node,
SpatialComparable mbr)
Returns the path information of the entry of the specified node which needs
least overlap enlargement if the given mbr would be inserted into.
|
TreeIndexPathComponent<E> |
Enlargement.getPathComponent()
Returns the path information of the entry representing the node.
|
Constructor and Description |
---|
Enlargement(TreeIndexPathComponent<E> pathComponent,
double volume,
double volInc,
double overlapInc)
Creates an new Enlargement object with the specified parameters.
|