ctree

PURPOSE

Class implementing cluster hierarchy in tree data structure

SYNOPSIS

This is a script file.

DESCRIPTION

 Class implementing cluster hierarchy in tree data structure

 This class implements a tree data structure used to store cluster
 hierarchies. Nodes are mainly accessed through their index. The index of a
 node is returned when it is added to the ctree, and actually corresponds to
 the order of addition. 
 
  Based on MATLAB tree-class: Jean-Yves Tinevez <tinevez@pasteur.fr> March 2012
  Modified by: Nicos Pavlidis 2018

CROSS-REFERENCE INFORMATION

This function calls:

contentToString Function used to print ctree Node to terminal
fixLabels Enforces cluster labels to be in the range 1:K
ifelse Shorthand for ternary operator: if-then-else
mycrosstab Cross tabulation table for vectors X,Y
palette Determines colours used for visualisation
purity Computes purity (misclassification rate) of cluster assignment
success_ratio Quantifies accuracy with which a binary partition splits data containing two or more clusters
tree2clusters Assigns cluster labels from a cluster hierarchy (ctree object)
ctree Class implementing cluster hierarchy in tree data structure

This function is called by:

depddp density-enhanced Principal Direction Divisive Partitioning algorithm
gppdc Generic Projection Pursuit Divisive Clustering
mcdc Maximum Clusterability Divisive Clustering
mddc Minimum Density Divisive Clustering
ncutdc Minimum Normalised Cut Divisive Clustering
pddp Principal Direction Divisive Partitioning algorithm
scppdc Spectral Clustering Projection Pursuit Divisive Clustering
ctree Class implementing cluster hierarchy in tree data structure