Model-based clustering using S-PLUS
โ Scribed by Morven Leese; Sabine Landau
- Publisher
- John Wiley and Sons
- Year
- 2006
- Tongue
- English
- Weight
- 247 KB
- Volume
- 15
- Category
- Article
- ISSN
- 1049-8931
- DOI
- 10.1002/mpr.191
No coin nor oath required. For personal study only.
โฆ Synopsis
Abstract
Cluster analysis can be used to identify homogenous subgroups in many fields, including psychology and psychiatry. However, most clustering methods implemented in generalโpurpose statistical packages are heuristic and can be criticized in principle for their lack of an underlying statistical model. Furthermore correlations between variables are generally ignored by standard methods. The question addressed here is whether currently available commercial software (SโPLUS), which provides modelโbased methods for clustering correlated continuous data, should be used for clustering data derived from questionnaires. Such data may be either continuous or ordinal in nature and typically exhibit correlations. Performance is assessed in this study on simulated data sets containing distinct multivariate normal subpopulations, both before and after mapping the simulated data onto an ordinal scale. A practical example showing how correlated data can be clusterโanalysed using these methods is given. The conclusion is that modelโbased methods are certainly worthwhile for continuous data. However, their benefit, in particular their ability to deal with correlated data, is not marked for ordinal data. Simpler methods such as Ward's method may be almost as effective in this situation. Copyright ยฉ 2006 John Wiley & Sons, Ltd.
๐ SIMILAR VOLUMES
## Abstract In this paper we address the problem of classifying the conformations of __m__โmembered rings using experimental observations obtained by crystal structure analysis. After formulating a model for the data generation mechanism that is based on a multidimensional mixture model and takes i
Document clustering, the grouping of documents into several clusters, has been recognized as a means for improving efficiency and effectiveness of information retrieval and text mining. With the growing importance of electronic media for storing and exchanging large textual databases, document clust
Clustering is an important technique in data mining. In this paper, we introduce a new clustering algorithm. This algorithm, based on granular computing, constructs a hypergraph (simplicial complex) by the hypergraph bisection algorithm. It will discover the similarities and associations among docum
pp. 459-476) . Further evidence in support of their position can be found in the doctoral dissertation from Columbia University by Dr. Farideh Tehrani (Rutgers University Library) published as Negligence and Chaos: Bibliographical Access to Persian-Language Materials in the United States (Metuchen,