UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Validating visual clusters in large datasets: Fixed point clusters of spectral features

Hennig, C; Christlieb, N; (2002) Validating visual clusters in large datasets: Fixed point clusters of spectral features. Computational Statistics and Data Analysis , 40 (4) pp. 723-739. 10.1016/S0167-9473(02)00077-4.

Full text not available from this repository.

Abstract

Finding clusters in large datasets is a difficult task. Almost all computationally feasible methods are related to k-means and need a clear partition structure of the data, while most such datasets contain masking outliers and other deviations from the usual models of partitioning cluster analysis. It is possible to look for clusters informally using graphic tools like the grand tour, but the meaning and the validity of such patterns is unclear. In this paper, a three-step-approach is suggested: In the first step, data visualization methods like the grand tour are used to find cluster candidate subsets of the data. In the second step, reproducible clusters are generated from them by means of fixed point clustering, a method to find a single cluster at a time based on the Mahalanobis distance. In the third step, the validity of the clusters is assessed by the use of classification plots. The approach is applied to an astronomical dataset of spectra from the Hamburg/ESO survey. © 2002 Elsevier Science B.V. All rights reserved.

Type: Article
Title: Validating visual clusters in large datasets: Fixed point clusters of spectral features
DOI: 10.1016/S0167-9473(02)00077-4
UCL classification: UCL > School of BEAMS
UCL > School of BEAMS > Faculty of Maths and Physical Sciences
URI: http://discovery.ucl.ac.uk/id/eprint/148271
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item