1971
DOI: 10.2307/2344237
|View full text |Cite
|
Sign up to set email alerts
|

A Review of Classification

Abstract: Summary The summarization of large quantities of multivariate data by clusters, undefined a priori, is increasingly practiced, often irrelevantly and unjustifiably. This paper attempts to survey the burgeoning bibliography, restricting itself to published, freely available, references of known provenance. A plethora of definitions of similarity and of cluster are presented. The principles, but not details of implementation, of the many empirical classification techniques currently in use are discussed, and lim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

3
315
0
18

Year Published

1997
1997
2005
2005

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 686 publications
(348 citation statements)
references
References 184 publications
3
315
0
18
Order By: Relevance
“…Agglomerative hierarchical clustering algorithms are among the oldest and still most used methods of cluster analysis [23,49]. They proceed from an initial partition in N single-entity clusters by successive mergings of clusters until all entities belong to the same cluster.…”
Section: Agglomerative Hierarchical Clustering Algorithmsmentioning
confidence: 99%
See 2 more Smart Citations
“…Agglomerative hierarchical clustering algorithms are among the oldest and still most used methods of cluster analysis [23,49]. They proceed from an initial partition in N single-entity clusters by successive mergings of clusters until all entities belong to the same cluster.…”
Section: Agglomerative Hierarchical Clustering Algorithmsmentioning
confidence: 99%
“…Results of hierarchical clustering can be represented graphically on a dendrogram [23] or an espalier [69] as shown in Figure 1. Then vertical lines correspond Diameter to entities or clusters and horizontal lines joining endpoints of vertical lines to mergings of clusters.…”
Section: Global Criteriamentioning
confidence: 99%
See 1 more Smart Citation
“…Clustering algorithms divide SNPs into different clusters, where SNPs within the same cluster have a Cormack (1971) for a review). Two commonly used clustering algorithms are nearest neighbour and furthest neighbour.…”
Section: Clustering Algorithmsmentioning
confidence: 99%
“…This coefficient, being a concordance measure, allows comparison between the different results obtained from the six algorithms tried. It ranges from zero to one, and increases whenever the distortion decreases in value (Cormack, 1971); usually, it has values between 0.6 and 0.95 (Sneath and Sokal, 1973). 19.…”
Section: Among Applicative Examples Of a Direct Inclusion In The Localmentioning
confidence: 99%