# A computer generated aid for cluster analysis

@article{Ling1973ACG, title={A computer generated aid for cluster analysis}, author={Robert F. Ling}, journal={Commun. ACM}, year={1973}, volume={16}, pages={355-361} }

A computer generated graphic method, which can be used in conjunction with any hierarchical scheme of cluster analysis, is described and illustrated. The graphic principle used is the representation of the elements of a data matrix of similarities or dissimilarities by computer printed symbols (of character overstrikes) of various shades of darkness, where a dark symbol corresponds to a small dissimilarity. The plots, applied to a data matrix before clustering and to the rearranged matrix after…

## 109 Citations

Use of Computer Graphics and Cluster Analysis in Aiding Relational Judgment

- Computer Science
- 1992

The results indicated that the cluster-ordered displays greatly facilitated cluster detection performance in all but the 3D line scheme, and Matrix ordering had no effect on the value judgment task.

Dissimilarity Plots: A Visual Exploration Tool for Partitional Clustering

- Computer Science
- 2011

(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.

Visual Approaches for Exploratory Data Analysis: A Survey of the Visual Assessment of Clustering Tendency (VAT) Family of Algorithms

- Computer ScienceIEEE Systems, Man, and Cybernetics Magazine
- 2020

An important category of algorithms in this domain includes visual approaches, represented here by the visual assessment of tendency (VAT) algorithm, which reorders the pairwise dissimilarity matrix and then generates a reordered Dissimilarity image (RDI) or cluster heat map that shows possible clusters in the data by dark blocks along the diagonal.

Unclassed matrix shading and optimal ordering in hierarchical cluster analysis

- Computer Science
- 1984

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.

A new formulation of the coVAT algorithm for visual assessment of clustering tendency in rectangular data

- Computer ScienceInt. J. Intell. Syst.
- 2012

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.

GAP: A graphical environment for matrix visualization and cluster analysis

- Computer ScienceComput. Stat. Data Anal.
- 2010

An Efficient Visual Analysis Method for Cluster Tendency Evaluation, Data Partitioning and Internal Cluster Validation

- Computer ScienceComput. Informatics
- 2013

This paper proposes an enhanced visual analysis method for cluster tendency assessment, where D is mapped to D' by graph based analysis and then reordered to overlineD' using E-VAT resulting graph based Enhanced Visual Assessment Tendency (GE-Vat).

Enhanced Visual Analysis for Cluster Tendency Assessment and Data Partitioning

- Computer ScienceIEEE Transactions on Knowledge and Data Engineering
- 2010

A Spectral VAT algorithm is proposed, where D is mapped to D' in a graph embedding space and then reordered to D̃' using the VAT algorithm, as well as a visual method for cluster formation from I(D̃') based on the difference between diagonal blocks and off-diagonal blocks.

Clustering in ordered dissimilarity data

- Computer ScienceInt. J. Intell. Syst.
- 2009

It is proved that the set of aligned partitions is exponentially smaller than the set that needs to be searched if clusters are sought in D, and the objective function combines measures of contrast and edginess and is optimized by particle swarm optimization.

## References

SHOWING 1-10 OF 16 REFERENCES

A Probability Theory of Cluster Analysis

- Mathematics
- 1973

Abstract An explicit definition of a (k, r)-cluster is proposed. Each (k, r)-cluster has the property that each of its elements is within a distance r of at least k other elements of the same cluster…

A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems

- Computer ScienceComput. J.
- 1967

It is shown that the computational behaviour of a hierarchical sorting-strategy depends on three properties, which are established for five conventional strategies and four measures. The conventional…

Principles Of Numerical Taxonomy

- Psychology
- 1963

This new edition continues the story of psychology with added research and enhanced content from the most dynamic areas of the field--cognition, gender and diversity studies, neuroscience and more,…

The Dendrograph

- Computer Contrib. 48. U. of Kansas, Kansas Geol. Surv.,
- 1970

Modern Factor Analysis

- Art
- 1968

This thoroughly revised third edition of Harry H. Harman's authoritative text incorporates the many new advances made in computer science and technology over the last ten years. The author gives full…

Adaptive Hierarchical Clustering Schemes

- Computer Science
- 1970

This paper is concerned with a brief review of some of the techniques of summarizing phenetic similarities that have been proposed for use in numerical taxonomy and new procedures which allow for elongated and curvilinear clusters are proposed.

A general theory of classificatory sorting strategies: II. Clustering systems

- Computer ScienceComput. J.
- 1967