MixSim: Simulating Data to Study Performance of Clustering Algorithms MixSim allows simulating mixtures of Gaussian distributions with different levels of overlap between mixture components. Pairwise overlap, defined as a sum of two misclassification probabilities, measures the degree of interaction between components and can be readily employed to control the clustering complexity of datasets simulated from mixtures. These datasets can then be used for systematic performance investigation of clustering and finite mixture modeling algorithms. Among other capabilities of MixSim, there are computing the exact overlap for Gaussian mixtures, simulating Gaussian and non-Gaussian data, simulating outliers and noise variables, calculating various measures of agreement between two partitionings, and constructing parallel distribution plots for the graphical display of finite mixture models.

References in zbMATH (referenced in 15 articles )

Showing results 1 to 15 of 15.
Sorted by year (citations)

  1. Foss, Alex; Markatou, Marianthi; Ray, Bonnie; Heching, Aliza: A semiparametric method for clustering mixed data (2016)
  2. Lin, Tsung-I; McLachlan, Geoffrey J.; Lee, Sharon X.: Extending mixtures of factor models using the restricted multivariate skew-normal distribution (2016)
  3. Page, Garritt L.; Quintana, Fernando A.: Spatial product partition models (2016)
  4. Wang, Yanhong; Fang, Yixin; Wang, Junhui: Sparse optimal discriminant clustering (2016)
  5. Thuy, Ta Minh; An, Le Thi Hoai: An improvement of stability based method to clustering (2015) ioport
  6. Guerra, Luis; Bielza, Concha; Robles, Víctor; Larrañaga, Pedro: Semi-supervised projected model-based clustering (2014)
  7. Melnykov, Igor; Melnykov, Volodymyr: On $K$-means algorithm with the use of Mahalanobis distances (2014)
  8. Maitra, Ranjan: On the expectation-maximization algorithm for Rice-Rayleigh mixtures with application to noise parameter estimation in magnitude MR datasets (2013)
  9. Melnykov, Volodymyr: On the distribution of posterior probabilities in finite mixture models with application in clustering (2013)
  10. Chen, Jiahua; Li, Pengfei; Fu, Yuejiao: Inference on the order of a normal mixture (2012)
  11. Maitra, Ranjan; Melnykov, Volodymyr; Lahiri, Soumendra N.: Bootstrapping for significance of compact clusters in multidimensional datasets (2012)
  12. Melnykov, Volodymyr; Melnykov, Igor: Initializing the EM algorithm in Gaussian mixture models with an unknown number of components (2012)
  13. O’Hagan, Adrian; Murphy, Thomas Brendan; Gormley, Isobel Claire: Computational aspects of fitting mixture models via the expectation-maximization algorithm (2012)
  14. Seo, Byungtae; Kim, Daeyoung: Root selection in normal mixture models (2012)
  15. Melnykov, Volodymyr; Maitra, Ranjan: Finite mixture models and model-based clustering (2010)