Package | Description |
---|---|
de.lmu.ifi.dbs.elki.algorithm.clustering.hierarchical |
Hierarchical agglomerative clustering (HAC).
|
Modifier and Type | Method and Description |
---|---|
protected static int |
MiniMax.findMerge(int end,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
DistanceQuery<?> dq)
Find the best merge.
|
protected int |
MiniMaxAnderberg.findMerge(int size,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
double[] bestd,
int[] besti,
DistanceQuery<O> dq)
Perform the next merge step.
|
protected int |
AnderbergHierarchicalClustering.findMerge(int size,
MatrixParadigm mat,
double[] bestd,
int[] besti,
PointerHierarchyRepresentationBuilder builder)
Perform the next merge step.
|
protected int |
AGNES.findMerge(int end,
MatrixParadigm mat,
PointerHierarchyRepresentationBuilder builder)
Perform the next merge step in AGNES.
|
static int |
NNChain.findUnlinked(int pos,
int end,
DBIDArrayIter ix,
PointerHierarchyRepresentationBuilder builder)
Find an unlinked object.
|
protected static void |
MiniMax.merge(int size,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
DistanceQuery<?> dq,
int x,
int y)
Merges two clusters given by x, y, their points with smallest IDs, and y to
keep
|
protected void |
MiniMaxAnderberg.merge(int size,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
DistanceQuery<O> dq,
double[] bestd,
int[] besti,
int x,
int y)
Execute the cluster merge
|
protected void |
AnderbergHierarchicalClustering.merge(int size,
MatrixParadigm mat,
double[] bestd,
int[] besti,
PointerHierarchyRepresentationBuilder builder,
double mindist,
int x,
int y)
Execute the cluster merge.
|
protected void |
AGNES.merge(int end,
MatrixParadigm mat,
PointerHierarchyRepresentationBuilder builder,
double mindist,
int x,
int y)
Execute the cluster merge.
|
private void |
MiniMaxNNChain.nnChainCore(MatrixParadigm mat,
DBIDArrayMIter prots,
DistanceQuery<O> dq,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters)
Uses NNChain as in "Modern hierarchical, agglomerative clustering
algorithms" by Daniel Müllner
|
private void |
NNChain.nnChainCore(MatrixParadigm mat,
PointerHierarchyRepresentationBuilder builder)
Uses NNChain as in "Modern hierarchical, agglomerative clustering
algorithms" by Daniel Müllner
|
protected static int |
AGNES.shrinkActiveSet(DBIDArrayIter ix,
PointerHierarchyRepresentationBuilder builder,
int end,
int x)
Shrink the active set: if the last x objects are all merged, we can reduce
the working size accordingly.
|
private void |
MiniMaxAnderberg.updateMatrices(int size,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
DistanceQuery<O> dq,
double[] bestd,
int[] besti,
int x,
int y)
Update the entries of the matrices that contain a distance to y, the newly
merged cluster.
|
protected static <O> void |
MiniMax.updateMatrices(int size,
MatrixParadigm mat,
DBIDArrayMIter prots,
PointerHierarchyRepresentationBuilder builder,
it.unimi.dsi.fastutil.ints.Int2ObjectOpenHashMap<ModifiableDBIDs> clusters,
DistanceQuery<O> dq,
int c)
Update the entries of the matrices that contain a distance to c, the newly
merged cluster.
|
protected void |
AnderbergHierarchicalClustering.updateMatrix(int size,
double[] scratch,
DBIDArrayIter ij,
double[] bestd,
int[] besti,
PointerHierarchyRepresentationBuilder builder,
double mindist,
int x,
int y,
int sizex,
int sizey)
Update the scratch distance matrix.
|
protected void |
AGNES.updateMatrix(int end,
MatrixParadigm mat,
PointerHierarchyRepresentationBuilder builder,
double mindist,
int x,
int y,
int sizex,
int sizey)
Update the scratch distance matrix.
|
Copyright © 2019 ELKI Development Team. License information.