An aggressive dimensionality reduction and network estimation
    technique for a high-dimensional Gaussian graphical model (GGM). Please
    refer to: Efficient Dimensionality Reduction for High-Dimensional Network
    Estimation, Safiye Celik, Benjamin A. Logsdon, Su-In Lee, Proceedings of
    The 31st International Conference on Machine Learning, 2014, p. 1953--1961.

Inference of Multiscale graphical models with neighborhood
    selection approach.  The method is based on solving a convex
    optimization problem combining a Lasso and fused-group Lasso
    penalties.  This allows to infer simultaneously a conditional
    independence graph and a clustering partition. The optimization is
    based on the Continuation with Nesterov smoothing in a
    Shrinkage-Thresholding Algorithm solver (Hadj-Selem et al. 2018)
    <doi:10.1109/TMI.2018.2829802> implemented in python.

Provides functions that (1) fit multivariate discrete distributions, (2) generate random numbers from multivariate discrete distributions, and (3) run regression and penalized regression on the multivariate categorical response data.  Implemented models include: multinomial logit model, Dirichlet multinomial model, generalized Dirichlet multinomial model, and negative multinomial model. Making the best of the minorization-maximization (MM) algorithm and Newton-Raphson method, we derive and implement stable and efficient algorithms to find the maximum likelihood estimates. On a multi-core machine, multi-threading is supported.

Tools for univariate and multivariate generalized linear models with model averaging and null model technique.

Estimation of k-Order time-varying Mixed Graphical Models and mixed VAR(p) models via elastic-net regularized neighborhood regression. For details see Haslbeck & Waldorp (2020) <doi:10.18637/jss.v093.i08>.

Parameter estimation and classification for Gaussian Mixture Models (GMMs) in the presence of missing data. This package complements existing implementations by allowing for both missing elements in the input vectors and full (as opposed to strictly diagonal) covariance matrices. Estimation is performed using an expectation conditional maximization algorithm that accounts for missingness of both the cluster assignments and the vector components. The output includes the marginal cluster membership probabilities; the mean and covariance of each cluster; the posterior probabilities of cluster membership; and a completed version of the input data, with missing values imputed to their posterior expectations. For additional details, please see McCaw ZR, Julienne H, Aschard H. "Fitting Gaussian mixture models on incomplete data." <doi:10.1186/s12859-022-04740-9>.