The hardware and bandwidth for this mirror is donated by METANET, the Webhosting and Full Service-Cloud Provider.
If you wish to report a bug, or if you are interested in having us mirror your free-software or open-source project, please feel free to contact us at mirror[@]metanet.ch.
A 'C++' reimplementation of 'poLCA' - latent class analysis and latent class regression models for polytomous outcome variables, also known as latent structure analysis. It attempts to reproduce results and be as similar as possible to the original code, while running faster, especially with multiple repetitions, by utilising multiple threads. Further reading is available on the Queen Mary, University of London, IT Services Research blog <https://blog.hpc.qmul.ac.uk/speeding_up_r_packages/>.
| Version: | 1.2.6 |
| Depends: | R (≥ 3.0.2) |
| Imports: | Rcpp (≥ 1.0.7), scatterplot3d, MASS, parallel, poLCA |
| LinkingTo: | Rcpp, RcppArmadillo (≥ 0.12.4.1.0) |
| Suggests: | testthat (≥ 3.0.0), roxygen2, usethis |
| Published: | 2026-02-19 |
| DOI: | 10.32614/CRAN.package.poLCAParallel |
| Author: | Sherman Lo [aut, cre], Drew Linzer [aut], Jeffrey Lewis. [aut] |
| Maintainer: | Sherman Lo <s.lo at qmul.ac.uk> |
| License: | GPL-2 |
| URL: | https://github.com/QMUL/poLCAParallel |
| NeedsCompilation: | yes |
| Citation: | poLCAParallel citation info |
| Materials: | README |
| CRAN checks: | poLCAParallel results [issues need fixing before 2026-03-06] |
| Reference manual: | poLCAParallel.html , poLCAParallel.pdf |
| Package source: | poLCAParallel_1.2.6.tar.gz |
| Windows binaries: | r-devel: not available, r-release: poLCAParallel_1.2.6.zip, r-oldrel: poLCAParallel_1.2.6.zip |
| macOS binaries: | r-release (arm64): not available, r-oldrel (arm64): not available, r-release (x86_64): not available, r-oldrel (x86_64): not available |
Please use the canonical form https://CRAN.R-project.org/package=poLCAParallel to link to this page.
These binaries (installable software) and packages are in development.
They may not be fully stable and should be used with caution. We make no claims about them.