Skip to main content
Log in

Generation of Random Clusters with Specified Degree of Separation

  • Published:
Journal of Classification Aims and scope Submit manuscript

Abstract

We propose a random cluster generation algorithm that has the desired features: (1) the population degree of separation between clusters and the nearest neighboring clusters can be set to a specified value, based on a separation index; (2) no constraint is imposed on the isolation among clusters in each dimension; (3) the covariance matrices correspond to different shapes, diameters and orientations; (4) the full cluster structures generally could not be detected simply from pair-wise scatterplots of variables; (5) noisy variables and outliers can be imposed to make the cluster structures harder to be recovered. This algorithm is an improvement on the method used in Milligan (1985).

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Weiliang Qiu.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Qiu, W., Joe, H. Generation of Random Clusters with Specified Degree of Separation. Journal of Classification 23, 315–334 (2006). https://doi.org/10.1007/s00357-006-0018-y

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00357-006-0018-y

Keywords

Navigation