The History of the Cluster Heat Map

@article{Wilkinson2009TheHO,
  title={The History of the Cluster Heat Map},
  author={Leland Wilkinson and Michael Friendly},
  journal={The American Statistician},
  year={2009},
  volume={63},
  pages={179 - 184}
}
The cluster heat map is an ingenious display that simultaneously reveals row and column hierarchical cluster structure in a data matrix. It consists of a rectangular tiling, with each tile shaded on a color scale to represent the value of the corresponding element of the data matrix. The rows (columns) of the tiling are ordered such that similar rows (columns) are near each other. On the vertical and horizontal margins of the tiling are hierarchical cluster trees. This cluster heat map is a… 
InCHlib – interactive cluster heatmap for web applications
TLDR
InCHlib (Interactive Cluster Heatmap Library), a highly interactive and lightweight JavaScript library for cluster heatmap visualization and exploration, is developed and is a versatile tool which application domain is not limited to the life sciences only.
dendsort: modular leaf ordering methods for dendrogram representations in R
TLDR
Two modular leaf ordering methods are presented to encode both the monotonic order in which clusters are merged and the nested cluster relationships more faithfully in the resulting dendrogram structure.
dendsort: modular leaf ordering methods for dendrogram
TLDR
Two modular leaf ordering methods are presented to encode both the monotonic order in which clusters are merged and the nested cluster relationships more faithfully in the resulting dendrogram structure.
Using Dendritic Heat Maps to Simultaneously Display Genotype Divergence with Phenotype Divergence
TLDR
This work introduces dendritic heat maps that display heat map results over aligned DNA sequence clusters for a range of clustering cutoffs and makes a case for the divisive “top-down” centroid-based clustering methodology as being the best option to visualize the effects of changing factors on clustering hierarchy and relative abundance.
Phylogeny Visualization : iMap , an Interactive Heatmap
TLDR
iMap allows users to interact with their heatmap, creating a customized viewing experience, and can create customized heatmaps to better understand their results, and ultimately, communicate their findings to other researchers.
Quantification of Heat Map Data Displays for High-Throughput Analysis
TLDR
The author will suggest a modification to Plotnick’s approach using the underlying gliding box approach developed by Allain and Cloitre , but with an alteration in the means of counting features.
Dissimilarity Plots: A Visual Exploration Tool for Partitional Clustering
TLDR
(dissimilarity) matrix shading is extended with several reordering steps based on seriation techniques and it is shown that dissimilarity plots scale very well with increasing data dimensionality.
A new formulation of the coVAT algorithm for visual assessment of clustering tendency in rectangular data
TLDR
A new formulation of a matrix reordering algorithm, coVAT, is presented, which is the only known method for providing visual clustering information on all four types of cluster structure in rectangular relational data.
Statistics using R ( spring of 2017 ) Computer lab : Multivariate Plots , Principal Component Analysis and Discriminant Analysis April
  • Computer Science
  • 2017
TLDR
This work considers a data matrix X of real numbers with n rows and k columns and uses hierarchical clustering to display the result as trees in which observation vectors that are similar are displayed near to each other in the row sorting and highly correlated column patterns are also sorted together.
Dendrogramix: A hybrid tree-matrix visualization technique to support interactive exploration of dendrograms
TLDR
Dendrogramix is presented, a hybrid tree-matrix interactive visualization of dendrograms that superimposes the relationship between individual objects on to the hierarchy of clusters, enabling users to do tasks which involve both clusters and individual objects that are impracticable with the classical representation.
...
...

References

SHOWING 1-10 OF 67 REFERENCES
Clustan Graphics3 Interactive Graphics for Cluster Analysis
TLDR
Algorithms are proposed which optimize the rank correlation of the proximity matrix by seriation, compute cluster exemplars and truncate a large dendrogram and proximity matrix and the paper concludes with an overview.
Rearrangement Clustering: Pitfalls, Remedies, and Applications
TLDR
This paper points out two critical pitfalls that have been previously overlooked in rearrangement clustering and presents an algorithm that overcomes these pitfalls, based on a variation of the Traveling Salesman Problem, that identifies better clusters than those found by previous approaches in all five cases.
Dendrogram Seriation Using Simulated Annealing
TLDR
The seriation method presented here uses simulated annealing to find an approximately optimal dendrogram ordering by minimizing a penalty function and employs a ‘similarity weighted distance’ penalty function that tends to avoid artifacts introduced by the traveling salesman problem algorithms commonly used for dendrograms seriation.
Cluster analysis and display of genome-wide expression patterns
TLDR
A system of cluster analysis for genome-wide expression data from DNA microarray hybridization is described that uses standard statistical algorithms to arrange genes according to similarity in pattern of gene expression, finding that the standard correlation coefficient conforms well to the intuitive biological notion of what it means for two genes to be ‘‘coexpressed’’.
A computer generated aid for cluster analysis
TLDR
A well-known set of data consisting of the correlations of 24 psychological tests is used to illustrate the comparison of groupings by four methods of factor analysis and two methods of cluster analysis.
Corrgrams: Exploratory Displays for Correlation Matrices
TLDR
A set of techniques for rendering the value of a correlation to depict its sign and magnitude, and re-ordering the variables in a correlation matrix so that “similar” variables are positioned adjacently, facilitating perception are described.
Effect ordering for data displays
GENERALIZED ASSOCIATION PLOTS: INFORMATION VISUALIZATION VIA ITERATIVELY GENERATED CORRELATION MATRICES
Given a p-dimensional proximity matrix Dp×p, a sequence of correlation matrices, R =( R (1) ,R (2) ,...), is iteratively formed from it. Here R (1) is the correlation matrix of the original proximity
Robust singular value decomposition analysis of microarray data
TLDR
A robust analysis method is developed for the understanding of large-scale shifts in gene effects and the isolation of particular sample-by-gene effects that might be either unusual interactions or the result of experimental flaws.
Unclassed matrix shading and optimal ordering in hierarchical cluster analysis
TLDR
The procedure involves the use of computer generated shaded matrices based on unclassed choropleth mapping in conjunction with a strategy for matrix reorganization that incorporates a combination of techniques for seriation and the ordering of binary trees.
...
...