We design algorithms with linear time complexity with respect to the dimension for three commonly studied correlation structures, including exchangeable, decaying-product and K-dependent correlation structures, and extend the algorithms to generate binary data of general non-negative correlation matrices with quadratic time complexity. Jiang, W., Song, S., Hou, L. and Zhao, H. "A set of efficient methods to generate high-dimensional binary data with correlation structures." Submitted.
| Version: | 0.3.3 |
| Published: | 2019-10-19 |
| Author: | Shuang Song [aut, cre], Wei Jiang [aut], Lin Hou [aut] and Hongyu Zhao [aut] |
| Maintainer: | Shuang Song <song-s19 at mails.tsinghua.edu.cn> |
| License: | GPL-3 |
| NeedsCompilation: | no |
| CRAN checks: | CorBin results |
| Reference manual: | CorBin.pdf |
| Package source: | CorBin_0.3.3.tar.gz |
| Windows binaries: | r-devel: CorBin_0.3.3.zip, r-release: CorBin_0.3.3.zip, r-oldrel: CorBin_0.3.3.zip |
| macOS binaries: | r-release: CorBin_0.3.3.tgz, r-oldrel: CorBin_0.3.3.tgz |
| Old sources: | CorBin archive |
Please use the canonical form https://CRAN.R-project.org/package=CorBin to link to this page.