Package | Description |
---|---|
at.tuwien.ifs.somtoolbox.layers.quality |
Classes in this package implement various quality measures, indicating the quality of the SOM mapping.
|
at.tuwien.ifs.somtoolbox.reportgenerator | |
at.tuwien.ifs.somtoolbox.reportgenerator.output | |
at.tuwien.ifs.somtoolbox.visualization.clustering |
Contains classes implementing clustering methods on the SOM.
|
Constructor and Description |
---|
EntropyAndPurityCalculator(List<ClusterNode> clusters,
SOMLibClassInformation classInfo) |
Modifier and Type | Method and Description |
---|---|
ClusterNode |
TestRunResult.getClusterNodes(int level,
int numbClusters)
returns the cluster node representing the cluster at the specified level
|
Modifier and Type | Method and Description |
---|---|
Vector<String> |
DatasetInformation.getClusterName(ClusterNode node,
int clusterByValue,
int nodeDepth)
Tries to name a cluster by the input data mapped to units lying within the cluster For naming the cluster, some
very simple heuristics are used: First, if there are any labels of the clusters, which correpsond to 0/1
attributes, and their values are all 0 (or 1) in the cluster, the name of this attribute is included to the name
of the cluster.
|
Vector<double[]> |
TestRunResult.getStableClusters1(ClusterNode node,
int count,
int boundary,
Vector<double[]> stableClusterList)
Quality measure for clusters that didn't work
|
Vector<double[]> |
TestRunResult.getStableClusters2(ClusterNode node,
double parentValue,
int boundary,
Vector<double[]> stableClusterList)
tries to sort all possible clusters by their "stability" that is, tries to give a measure about how good a
cluster is.
|
Vector<double[]> |
TestRunResult.getStableClusters3(ClusterNode node,
double parentValue,
int boundary,
Vector<double[]> stableClusterList)
quality measure for clusters that didn't work
|
Modifier and Type | Method and Description |
---|---|
protected int[] |
SOMDescriptionHTML.printClusterNode(ClusterNode node,
int parentLevel,
int boundary,
int depth,
int[] nodeInfos)
outputs the subtree in one node of the cluster tree we add to the report.
|
Modifier and Type | Field and Description |
---|---|
private ClusterNode |
ClusterNode.child1 |
private ClusterNode |
ClusterNode.child2 |
private ClusterNode |
ColoredClusterPNode.correspondingCluster |
(package private) ClusterNode |
NodeDistance.n1 |
(package private) ClusterNode |
NodeDistance.n2 |
private ClusterNode |
ClusteringTree.topNode |
Modifier and Type | Method and Description |
---|---|
ClusterNode |
ClusteringTree.findClusterOf(GeneralUnitPNode unitPNode,
int level)
Find the
ClusterNode that contains the given GeneralUnitPNode at the given level. |
ClusterNode |
ClusteringTree.findNode(ClusterNode start,
int lvl) |
ClusterNode |
ClusteringTree.findNode(int lvl) |
ClusterNode |
ClusterNode.getChild1()
returns the first child cluster
|
ClusterNode |
ClusterNode.getChild2()
returns the second child cluster
|
ClusterNode[] |
UnitKMeans.getClusterNodes(int level)
Returns the ClusterNodes for the given level.
|
Modifier and Type | Method and Description |
---|---|
ArrayList<ClusterNode> |
ClusteringTree.getNodesAtLevel(int level) |
Modifier and Type | Method and Description |
---|---|
protected double |
AbstractWardsLinkageTreeBuilder.calcESSincrease(ClusterNode n1,
ClusterNode n2)
Calculates the increase of the Error Sum of Squares if the two Clusters are united.
|
static void |
LabelPositioning.center(ClusterNode cluster,
edu.umd.cs.piccolo.PNode label)
Place the label in the center of the surrounding rectangle of the cluster.
|
static void |
LabelPositioning.centroid(ClusterNode cluster,
edu.umd.cs.piccolo.PNode label)
Place the label in the centroid of the cluster.
|
ClusterNode |
ClusteringTree.findNode(ClusterNode start,
int lvl) |
private void |
ClusteringTree.getAllChildrenUntil(int level,
ClusterNode start,
ArrayList<ClusterNode> store)
Searches the clusters that are less or equal lvl and stores their children (ClusterNodes) which are > lvl.
|
void |
ClusteringTree.printTree(ClusterNode start,
int x) |
private void |
ClusteringTree.recolorTree(Color[] col,
ClusterNode n)
Function for recursion in recolorTree()
|
Modifier and Type | Method and Description |
---|---|
private void |
ClusteringTree.getAllChildrenUntil(int level,
ClusterNode start,
ArrayList<ClusterNode> store)
Searches the clusters that are less or equal lvl and stores their children (ClusterNodes) which are > lvl.
|
Constructor and Description |
---|
ClusteringTree(ClusterNode top,
int width)
Initializes the tree with the given top Node.
|
ClusterNode(ClusterNode n1,
ClusterNode n2,
int level)
Connects two ClusterNodes to one cluster
|
ClusterNode(ClusterNode n1,
ClusterNode n2,
int level,
double mergeCost) |
ColoredClusterPNode(ClusterNode cluster) |
NodeDistance(ClusterNode no1,
ClusterNode no2,
double d) |