Package | Description |
---|---|
at.tuwien.ifs.somtoolbox.clustering |
Modifier and Type | Field and Description |
---|---|
private HierarchicalCluster<E> |
HierarchicalCluster.leftNode |
private HierarchicalCluster<E> |
WardClustering.ClusterThread.mergedCluster |
private HierarchicalCluster<E> |
HierarchicalCluster.rightNode |
Modifier and Type | Field and Description |
---|---|
protected List<HierarchicalCluster<E>> |
WardClustering.clusters
Stores the clusters; starts from being a list of clusters containing only one element (n elements), up to a final
set of clusters; there will be at least one single cluster containing all elements (if the
WardClustering.targetSize or
WardClustering.threshold permit that), or potentially any other number m <= n. |
Modifier and Type | Method and Description |
---|---|
HierarchicalCluster<E> |
WardClustering.clusterStep(List<HierarchicalCluster<E>> clusters) |
private HierarchicalCluster<E> |
WardClustering.findOptiomalClusterMerger(List<HierarchicalCluster<E>> clusters) |
private HierarchicalCluster<E> |
WardClustering.findOptiomalClusterMerger(List<HierarchicalCluster<E>> clusters,
int startX,
int startY,
int endX,
int endY) |
HierarchicalCluster<E> |
HierarchicalCluster.getLeftNode() |
HierarchicalCluster<E> |
HierarchicalCluster.getRightNode() |
Modifier and Type | Method and Description |
---|---|
List<HierarchicalCluster<E>> |
WardClustering.doCluster(List<E> data) |
List<HierarchicalCluster<E>> |
WardClustering.getClusters() |
HashMap<Integer,ArrayList<HierarchicalCluster<E>>> |
HierarchicalClusteringAlgorithm.getClustersAtLevel()
Returns the clusters at all levels
|
HashMap<Integer,ArrayList<HierarchicalCluster<E>>> |
WardClustering.getClustersAtLevel() |
ArrayList<HierarchicalCluster<E>> |
HierarchicalClusteringAlgorithm.getClustersAtLevel(int num)
Returns the cluster at a certain level, where the level equals the number of clusters
|
ArrayList<HierarchicalCluster<E>> |
WardClustering.getClustersAtLevel(int num)
Returns the clustering at a certain level, where the level equals the number of clusters
|
ArrayList<HierarchicalCluster<E>> |
WardClustering.getClustersByRelativeThreshold(double percent)
Returns the clustering at a certain level indicated by the relative merge cost for that level, compared to the
costs of merging all data items
|
ArrayList<HierarchicalCluster<E>> |
WardClustering.getClustersByThreshold(double threshold)
Returns the clustering at a certain level indicated by the merge cost for that level
|
Modifier and Type | Method and Description |
---|---|
HierarchicalCluster<E> |
WardClustering.clusterStep(List<HierarchicalCluster<E>> clusters) |
private HierarchicalCluster<E> |
WardClustering.findOptiomalClusterMerger(List<HierarchicalCluster<E>> clusters) |
private HierarchicalCluster<E> |
WardClustering.findOptiomalClusterMerger(List<HierarchicalCluster<E>> clusters,
int startX,
int startY,
int endX,
int endY) |
private Indices2D[] |
WardClustering.getIndices(List<HierarchicalCluster<E>> clusters)
find matrix indices for starting & ending the symmetrical matrix indices
|
double |
WardClustering.getInitialMinESS(List<HierarchicalCluster<E>> clusters) |
Constructor and Description |
---|
HierarchicalCluster(HierarchicalCluster<E> cluster1,
HierarchicalCluster<E> cluster2) |
HierarchicalCluster(HierarchicalCluster<E> cluster1,
HierarchicalCluster<E> cluster2) |