Reordering the Dendrogram According to the Class Labels

[Up] [Top]

Documentation for package ‘ReorderCluster’ version 2.0

Help Pages

ReorderCluster-package optimal reordering of the hierarchical tree according to class labels
CalcMerge Forms the binary vector to mark the nodes with identical class labels.
colorDendClass Makes the plot of the dendrogram, visualizing the class label information with different colors of dendrogram edges.
funMerge Recover the optimal sequence of leaves in the hierarchical tree according to available class labels.
leukemia Real biological dataset to perform the analysis.
leukemia72 Real biological dataset to perform the analysis.
OrderingJoseph Makes the calculation of the evaluation function for each subtree of the hierarchical tree using the dynamic programming approach
OrderingJosephC Makes the calculation of the evaluation function for each subtree of the hierarchical tree using the dynamic programming approach (C++ version)
RearrangeData Sample function to perform optimal reordering of the hierarchical tree according to class labels
RearrangeJoseph Makes the initialization of auxiliary matrices and calls to sequence of functions to perform the reordering of the elements (leaves) of the hierarchical tree according to class labels of the data objects.
ReorderCluster optimal reordering of the hierarchical tree according to class labels
SubTree Simplifies the initial hierarchical tree by reducing the number of nodes. Constructs the new merging matrix with some inner nodes substituted by one element from the coressponding subtree.
testBar For each node (subtree) of the hierarchical tree forms two vectors, consisting of elements of its left and write subtrees.
testData1 Simulates the dataset for analysis.
testData2 Simulates the dataset for analysis.