Cluster detection and clustering with random start forward searches

ABSTRACT

The forward search is a method of robust data analysis in which outlier free subsets of the data of increasing size are used in model fitting; the data are then ordered by closeness to the model. Here the forward search, with many random starts, is used to cluster multivariate data. These random starts lead to the diagnostic identification of tentative clusters. Application of the forward search to the proposed individual clusters leads to the establishment of cluster membership through the identification of non-cluster members as outlying. The method requires no prior information on the number of clusters and does not seek to classify all observations. These properties are illustrated by the analysis of 200 six-dimensional observations on Swiss banknotes. The importance of linked plots and brushing in elucidating data structures is illustrated. We also provide an automatic method for determining cluster centres and compare the behaviour of our method with model-based clustering. In a simulated example with eight clusters our method provides more stable and accurate solutions than model-based clustering. We consider the computational requirements of both procedures.

KEYWORDS:

• Brushing
• data structure
• forward search
• graphical methods
• linked plots
• Mahalanobis distance
• MM estimation
• outliers
• S estimation
• Tukey's biweight

AMS CLASSIFICATION CODES:

• 62H30
• 62P20
• 62F35

Disclosure statement

No potential conflict of interest was reported by the authors.