GMCM: Unsupervised clustering and meta-analysis using gaussian mixture copula models

Methods for clustering in unsupervised learning are an important part of the statistical toolbox in numerous scientific disciplines. tewari,giering,and raghunathan (2011) proposed to use so-called gaussian mixture copula models (gmcm) for general unsupervised learning based on clustering. li,brown,huang,and bickel (2011) independently discussed a special case of these gmcms as a novel approach to meta-analysis in highdimensional settings. gmcms have attractive properties which make them highly flexible and therefore interesting alternatives to other well-established methods. however,parameter estimation is hard because of intrinsic identifiability issues and intractable likelihood functions. both aforementioned papers discuss similar expectation-maximization-like algorithms as their pseudo maximum likelihood estimation procedure. we present and discuss an improved implementation in r of both classes of gmcms along with various alternative optimization routines to the em algorithm. the software is freely available in the r package gmcm. the implementation is fast,general,and optimized for very large numbers of observations. we demonstrate the use of package gmcm through different applications. © 2016,american statistical association. all rights reserved.