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.
Given constraints for right censored data, we use a recursive computational algorithm to calculate the the "constrained" Kaplan-Meier estimator. The constraint is assumed given in linear estimating equations or mean functions. We also illustrate how this leads to the empirical likelihood ratio test with right censored data and accelerated failure time model with given coefficients. EM algorithm from emplik package is used to get the initial value. The properties and performance of the EM algorithm is discussed in Mai Zhou and Yifan Yang (2015)<doi:10.1007/s00180-015-0567-9> and Mai Zhou and Yifan Yang (2017) <doi:10.1002/wics.1400>. More applications could be found in Mai Zhou (2015) <doi:10.1201/b18598>.
Version: | 0.4-2 |
Depends: | R (≥ 3.5), compiler, rootSolve, emplik |
LinkingTo: | Rcpp |
Suggests: | survival, ggplot2, tidyr, testthat (≥ 3.0.0) |
Published: | 2022-11-22 |
DOI: | 10.32614/CRAN.package.kmc |
Author: | Yifan Yang [aut, cre, cph], Mai Zhou [aut] |
Maintainer: | Yifan Yang <yfyang.86 at hotmail.com> |
License: | LGPL-3 |
URL: | https://github.com/yfyang86/kmc/ |
NeedsCompilation: | yes |
In views: | Survival |
CRAN checks: | kmc results |
Reference manual: | kmc.pdf |
Package source: | kmc_0.4-2.tar.gz |
Windows binaries: | r-devel: kmc_0.4-2.zip, r-release: kmc_0.4-2.zip, r-oldrel: kmc_0.4-2.zip |
macOS binaries: | r-release (arm64): kmc_0.4-2.tgz, r-oldrel (arm64): kmc_0.4-2.tgz, r-release (x86_64): kmc_0.4-2.tgz, r-oldrel (x86_64): kmc_0.4-2.tgz |
Old sources: | kmc archive |
Please use the canonical form https://CRAN.R-project.org/package=kmc 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.