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.result |
Result types, representation and handling
|
de.lmu.ifi.dbs.elki.utilities.datastructures.hierarchy |
Delegate implementation of a hierarchy.
|
Modifier and Type | Method and Description |
---|---|
private Cluster<DendrogramModel<D>> |
SLINK.createParent(String name,
Cluster<DendrogramModel<D>> leftChild,
Cluster<DendrogramModel<D>> rightChild,
D distance,
ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier) |
private Cluster<DendrogramModel<D>> |
SLINK.lastAncestor(Cluster<DendrogramModel<D>> cluster,
ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier)
Determines recursively the last ancestor of the specified cluster.
|
private Cluster<DendrogramModel<D>> |
SLINK.root(Map<DBID,ModifiableDBIDs> cluster_ids,
Map<DBID,D> cluster_distances,
DataStore<DBID> pi,
DataStore<D> lambda,
ModifiableHierarchy<Cluster<DendrogramModel<D>>> hier,
FiniteProgress progress) |
Modifier and Type | Class and Description |
---|---|
class |
ResultHierarchy
Class to store a hierarchy of result objects.
|
Modifier and Type | Class and Description |
---|---|
class |
HierarchyHashmapList<O>
Centralized hierarchy implementation, using a HashMap of Lists.
|