Algorithms for Clustering Data

[1]  M. C. Cooper,et al.  The effect of measurement error on determining the number of clusters in clusteranalysis , 1988 .

[2]  G. McLachlan.  On Bootstrapping the Likelihood Ratio Test Statistic for the Number of Components in a Normal Mixture , 1987 .

[3]  H. Bock.  On some significance tests in cluster analysis , 1985 .

[4]  W. DeSarbo,et al.  Optimal variable weighting for hierarchical clustering: An alternating least-squares algorithm , 1985 .

[5]  G. W. Milligan,et al.  An examination of procedures for determining the number of clusters in a data set , 1985 .

[6]  B. Silverman,et al.  Using Kernel Density Estimates to Investigate Multimodality , 1981 .

[7]  B. Everitt.  A Monte Carlo Investigation Of The Likelihood Ratio Test For The Number Of Components In A Mixture Of Normal Distributions. , 1981, Multivariate behavioral research.

[8]  D. Pollard.  Strong Consistency of $K$-Means Clustering , 1981 .

[9]  Riichiro Mizoguchi,et al.  A Nonparametric Algorithm for Detecting Clusters Using Hierarchical Structure , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[11]  L. Hubert.  Approximate Evaluation Techniques for the Single-Link and Complete-Link Hierarchical Clustering Procedures , 1974 .

[12]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[13]  Robin Sibson,et al.  SLINK: An Optimally Efficient Algorithm for the Single-Link Cluster Method , 1973, Comput. J..

[14]  Keinosuke Fukunaga,et al.  Asymptotic Analysis of a Nonparametric Clustering Technique , 1972, IEEE Transactions on Computers.

[15]  R. Prim.  Shortest connection networks and some generalizations , 1957 .