You are not currently logged in.
Access JSTOR through your library or other institution:
Cluster Identification Using Projections
Daniel Peña and Francisco J. Prieto
Journal of the American Statistical Association
Vol. 96, No. 456 (Dec., 2001), pp. 1433-1445
Stable URL: http://www.jstor.org/stable/3085911
Page Count: 13
You can always find the topics here!Topics: Kurtosis, Covariance, Matrices, Statistics, Random variables, Gaussian distributions, Unit vectors, Computational statistics, Outliers, Scalars
Were these topics helpful?See something inaccurate? Let us know!
Select the topics that are inaccurate.
Preview not available
This article describes a procedure to identify clusters in multivariate data using information obtained from the univariate projections of the sample data onto certain directions. The directions are chosen as those that minimize and maximize the kurtosis coefficient of the projected data. It is shown that, under certain conditions, these directions provide the largest separation for the different clusters. The projected univariate data are used to group the observations according to the values of the gaps or spacings between consecutive-ordered observations. These groupings are then combined over all projection directions. The behavior of the method is tested on several examples, and compared to k-means, MCLUST, and the procedure proposed by Jones and Sibson in 1987. The proposed algorithm is iterative, affine equivariant, flexible, robust to outliers, fast to implement, and seems to work well in practice.
Journal of the American Statistical Association © 2001 American Statistical Association