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.

epandist: Statistical Functions for the Censored and Uncensored Epanechnikov Distribution

Analyzing censored variables usually requires the use of optimization algorithms. This package provides an alternative algebraic approach to the task of determining the expected value of a random censored variable with a known censoring point. Likewise this approach allows for the determination of the censoring point if the expected value is known. These results are derived under the assumption that the variable follows an Epanechnikov kernel distribution with known mean and range prior to censoring. Statistical functions related to the uncensored Epanechnikov distribution are also provided by this package.

Version: 1.1.1
Depends: R (≥ 3.0.0)
Suggests: knitr, rmarkdown
Published: 2016-02-04
DOI: 10.32614/CRAN.package.epandist
Author: Mathias Borritz Milfeldt [aut, cre]
Maintainer: Mathias Borritz Milfeldt <mathias at milfeldt.dk>
License: LGPL-2 | LGPL-2.1 | LGPL-3 [expanded from: LGPL]
NeedsCompilation: no
Materials: README
CRAN checks: epandist results

Documentation:

Reference manual: epandist.pdf
Vignettes: Introduction to epandist

Downloads:

Package source: epandist_1.1.1.tar.gz
Windows binaries: r-devel: epandist_1.1.1.zip, r-release: epandist_1.1.1.zip, r-oldrel: epandist_1.1.1.zip
macOS binaries: r-release (arm64): epandist_1.1.1.tgz, r-oldrel (arm64): epandist_1.1.1.tgz, r-release (x86_64): epandist_1.1.1.tgz, r-oldrel (x86_64): epandist_1.1.1.tgz
Old sources: epandist archive

Linking:

Please use the canonical form https://CRAN.R-project.org/package=epandist 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.