cal_length
(Package: dendsort) :
Recursive function to calculate the length of branches
cal_length is a code modified from plotNode() to calculate the length of lines to draw the branch of a dendrogram. This function was developed to evaluate the use of ink for visualization.
● Data Source:
CranContrib
● Keywords: internal
● Alias: cal_length
●
0 images
|
dendsort
(Package: dendsort) :
Sorting and reordering dendrogram nodes
dendsort sorts a dendrogram object which is typically a result of hierarchical clustering (hclust). The subtrees in the resulting dendrogram are sorted based on the average distance of subtrees at every merging point. The tighter cluster, in other words the cluster with smaller average distance, is placed on the left side of branch. When a leaf merge with a cluster, the leaf is placed on the right side.
● Data Source:
CranContrib
● Keywords: dendrogram
● Alias: dendsort
●
0 images
|
sort_average
(Package: dendsort) :
Sorting and reordering dendrogram nodes by average distances
sort_average sorts a dendrogram object based on the average distance of its subtrees, recursively. The tighter cluster, in other words the cluster with smaller average distance, is placed on the left side of branch. When a leaf merge with a cluster, the leaf is placed on the right side.
● Data Source:
CranContrib
● Keywords: internal
● Alias: sort_average
●
0 images
|
dendsort-package
(Package: dendsort) :
Modular Leaf Ordering Methods for Dendrogram Nodes
Modular Leaf Ordering Methods for Dendrogram Nodes
● Data Source:
CranContrib
● Keywords: package
● Alias: dendsort-package
●
0 images
|
cal_node_limit
(Package: dendsort) :
Calculate the x coordinates given a branch of dendrogram
cal_node_limit is a code modified from plotNodeLimit() to x coordinates of branches given a branch of dendrogram.
● Data Source:
CranContrib
● Keywords: internal
● Alias: cal_node_limit
●
0 images
|
sort_smallest
(Package: dendsort) :
Sorting and reordering dendrogram nodes by the smallest value
sort_smallest sorts a dendrogram object based on the smallest distance in its subtrees, recursively. The cluster with the smallest distance is placed on the left side of branch.When a leaf merge with a cluster, the leaf is placed on the right side.
● Data Source:
CranContrib
● Keywords: internal
● Alias: sort_smallest
●
0 images
|
cal_total_length
(Package: dendsort) :
Calculate the total length of lines to draw the dendrogram
cal_total_length is a code modified from plot.dendrogram() to calculate the total length of lines to draw a dendrogram. This function was developed to evaluate the use of ink for visualization.
● Data Source:
CranContrib
● Keywords: internal
● Alias: cal_total_length
●
0 images
|
sort_smallest_r
(Package: dendsort) :
Sorting and reordering dendrogram nodes by the smallest value in reverse
sort_smallest_r sorts a dendrogram object in reverse based on the smallest distance in its subtrees, recursively. The cluster with the smallest distance is placed on the right side of branch.When a leaf merge with a cluster, the leaf is placed on the left side.
● Data Source:
CranContrib
● Keywords: internal
● Alias: sort_smallest_r
●
0 images
|
sort_average_r
(Package: dendsort) :
Sorting and reordering dendrogram nodes by average distances in reverse
sort_average_r sorts a dendrogram object in reverse based on the average distance of its subtrees, recursively. The tighter cluster, in other words the cluster with smaller average distance, is placed on the right side of branch. When a leaf merge with a cluster, the leaf is placed on the left side.
● Data Source:
CranContrib
● Keywords: internal
● Alias: sort_average_r
●
0 images
|
providing 
.