Simulating Data to Study Performance of Finite Mixture Modeling and Clustering Algorithms
Authors:
- 1 January 2010
- journal article
- Published by Taylor & Francis in Journal of Computational and Graphical Statistics
- Vol. 19 (2) , 354-376
Abstract
A new method is proposed to generate sample Gaussian mixture distributions according to prespecified overlap characteristics. Such methodology is useful in the context of evaluating performance of ...Keywords
This publication has 29 references indexed in Scilit:
- Tight Clustering: A Resampling‐Based Approach for Identifying Stable and Tight Patterns in DataBiometrics, 2005
- The global k-means clustering algorithmPattern Recognition, 2003
- Efficient Greedy Learning of Gaussian Mixture ModelsNeural Computation, 2003
- Model-Based Clustering, Discriminant Analysis, and Density EstimationJournal of the American Statistical Association, 2002
- Statistical theory in clusteringJournal of Classification, 1985
- Comparing partitionsJournal of Classification, 1985
- The plane with parallel coordinatesThe Visual Computer, 1985
- Algorithm AS 155: The Distribution of a Linear Combination of χ 2 Random VariablesJournal of the Royal Statistical Society Series C: Applied Statistics, 1980
- Linear Combinations of Non-Central Chi-Square VariatesThe Annals of Mathematical Statistics, 1966
- A note on tests of significance in multivariate analysisMathematical Proceedings of the Cambridge Philosophical Society, 1939