Methods for model-based clustering of multinomial counts under the presence of covariates using mixtures of multinomial logit models, as implemented in Papastamoulis (2023) <doi:10.1007/s11634-023-00547-5>. These models are estimated under a frequentist as well as a Bayesian setup using the Expectation-Maximization algorithm and Markov chain Monte Carlo sampling (MCMC), respectively. The (unknown) number of clusters is selected according to the Integrated Completed Likelihood criterion (for the frequentist model), and estimating the number of non-empty components using overfitting mixture models after imposing suitable sparse prior assumptions on the mixing proportions (in the Bayesian case), see Rousseau and Mengersen (2011) <doi:10.1111/j.1467-9868.2011.00781.x>. In the latter case, various MCMC chains run in parallel and are allowed to switch states. The final MCMC output is suitably post-processed in order to undo label switching using the Equivalence Classes Representatives (ECR) algorithm, as described in Papastamoulis (2016) <doi:10.18637/jss.v069.c01>.
Version: 1.1 Imports: Rcpp (≥ 1.0.8.3), MASS, doParallel, foreach, label.switching, ggplot2, coda, matrixStats, mvtnorm, RColorBrewer LinkingTo: Rcpp, RcppArmadillo Published: 2023-07-17 DOI: 10.32614/CRAN.package.multinomialLogitMix Author: Panagiotis Papastamoulis [aut, cre] Maintainer: Panagiotis Papastamoulis <papapast at yahoo.gr> License: GPL-2 NeedsCompilation: yes Citation: multinomialLogitMix citation info CRAN checks: multinomialLogitMix results Documentation: Downloads: Linking:Please use the canonical form https://CRAN.R-project.org/package=multinomialLogitMix to link to this page.
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4