
Abstract
Segmentation results derived using cluster analysis depend on (1) the structure of the data and (2) algorithm parameters. Typically neither the data structure is assessed in advance of clustering nor is the sensitivity of the analysis to changes in algorithm parameters. We propose a benchmarking framework based on bootstrapping techniques that accounts for sample and algorithm randomness. This provides much needed guidance both to data analysts and users of clustering solutions regarding the choice of the final clusters from computations which are exploratory in nature.
Item Type: | Paper |
---|---|
Keywords: | cluster analysis, mixture models, bootstrap |
Faculties: | Mathematics, Computer Science and Statistics > Statistics > Technical Reports |
Subjects: | 500 Science > 510 Mathematics |
URN: | urn:nbn:de:bvb:19-epub-10960-0 |
Language: | English |
Item ID: | 10960 |
Date Deposited: | 23. Jul 2009 07:27 |
Last Modified: | 04. Nov 2020 12:52 |