1980
DOI: 10.1016/0031-3203(80)90002-3
|View full text |Cite
|
Sign up to set email alerts
|

Monte Carlo comparisons of selected clustering procedures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
36
0

Year Published

1988
1988
2017
2017

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 92 publications
(36 citation statements)
references
References 9 publications
0
36
0
Order By: Relevance
“…In contrast to our previous findings, the k-means (W) and k-means (A) missclassification rates are highly similar despite the fact that the Ward's and group average rates are noticeably different. Apparently, Hartigan's k-means algorithm can recover from poor starting values when the data are highly structured (see Bayne, Beauchamp, Begovich & Kane, 1980;Milligan, 1980). We noted earlier that Milligan's cluster generation method often produces highly structured data with indicator validities that are greater than .90.…”
Section: Results Of Study IImentioning
confidence: 92%
“…In contrast to our previous findings, the k-means (W) and k-means (A) missclassification rates are highly similar despite the fact that the Ward's and group average rates are noticeably different. Apparently, Hartigan's k-means algorithm can recover from poor starting values when the data are highly structured (see Bayne, Beauchamp, Begovich & Kane, 1980;Milligan, 1980). We noted earlier that Milligan's cluster generation method often produces highly structured data with indicator validities that are greater than .90.…”
Section: Results Of Study IImentioning
confidence: 92%
“…Very few Monte Carlo studies have been performed which have used clustering methods from any of the other families of clustering techniques described earlier (cf. Bayne et a!., 1980;Boake, 1983). Also there has been relatively little comparison of the various similarity measures and their effects on the empirical performance of clustering techniques (cf.…”
Section: Choosing the Best Methods Of Cluster Analysismentioning
confidence: 96%
“…A rational selection of the starting partition did little to improve this situation, but Milligan (1980) has demonstrated that the k-means pass, using an initial starting partition derived from average linkage clustering, provided superior recovery of known data structure when compared with the performance of other iterative and hierarchical clustering methods. Others have suggested that iterative methods produce optimal solutions regardless of the starting partition if the data are well structured (Everitt, 1980;Bayne, Beauchamp, Begovich, and Kane, 1980).…”
Section: Iterative Partitioning Methodsmentioning
confidence: 98%
“…However, in the context of SA, we do not directly observe these underlying variables but only a diffuse summary measure: a distance between sequences. Bayne, Beauchamp, Begovich and Kane (1980), using bivariate distributions, tested thirteen different techniques for their classification accuracy. Their last, concluding sentence is "However, as the complexity of the distributions increases, the differences between all of these methods decrease".…”
Section: Endnotesmentioning
confidence: 99%