1973
DOI: 10.1145/362248.362263
|View full text |Cite
|
Sign up to set email alerts
|

A computer generated aid for cluster analysis

Abstract: 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 clustering, sho… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
48
0
2

Year Published

1984
1984
2023
2023

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 97 publications
(50 citation statements)
references
References 6 publications
0
48
0
2
Order By: Relevance
“…These regions can readily be interpreted as semantic clusters. Manually re-arranging items can become extremely tedious for larger sets, but can be automated by recording the order of iterative aggregation steps during HCA and imposing this order onto the similarity matrix (Ling 1973). Compared to dendrograms, ordered heatmaps have the particular advantage of conveying the full information on similarity.…”
Section: Finding Clustersmentioning
confidence: 99%
“…These regions can readily be interpreted as semantic clusters. Manually re-arranging items can become extremely tedious for larger sets, but can be automated by recording the order of iterative aggregation steps during HCA and imposing this order onto the similarity matrix (Ling 1973). Compared to dendrograms, ordered heatmaps have the particular advantage of conveying the full information on similarity.…”
Section: Finding Clustersmentioning
confidence: 99%
“…Sneath (1957) was perhaps the earliest advocate for this graphic. Ling (1973) introduced a computer program, called SHADE, for implementing Sneath's idea. Ling's program used overstrikes on a character printer to represent different degrees of shading.…”
Section: Hierarchical Clusteringmentioning
confidence: 99%
“…Hierarchical clustering algorithms do not determine a particular Figure 7. Permuted cluster display from Gower and Digby (1981), following Ling (1973). This display was designed to represent a symmetric similarity/dissimilarity matrix.…”
Section: Seriating a Binary Treementioning
confidence: 99%
“…9 spots were chosen for cluster analysis. Cluster analysis: heat map [10,11] was applied to evaluate the overall features of TLC fingerprint among the 10 batches of Bupleurum samples, and heat map-based feature selection was then used to reduce the number of features and to find impact factor of them. The greater of variance in the same group of the heat map cluster result was chosen and repeated this steps until the cluster result was changed.…”
Section: Hierarchical Clustering Analysis (Hca)mentioning
confidence: 99%