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.

knnmi: k-Nearest Neighbor Mutual Information Estimator

This is a 'C++' mutual information (MI) library based on the k-nearest neighbor (KNN) algorithm. There are three functions provided for computing MI for continuous values, mixed continuous and discrete values, and conditional MI for continuous values. They are based on algorithms by A. Kraskov, et. al. (2004) <doi:10.1103/PhysRevE.69.066138>, BC Ross (2014)<doi:10.1371/journal.pone.0087357>, and A. Tsimpiris (2012) <doi:10.1016/j.eswa.2012.05.014>, respectively.

Version: 1.0
Depends: R (≥ 4.1.0)
Suggests: spelling, testthat (≥ 3.0.0)
Published: 2024-04-02
DOI: 10.32614/CRAN.package.knnmi
Author: Brian Gregor ORCID iD [aut, cre], Katia Bulekova ORCID iD [aut], Reina Chau ORCID iD [aut], Stefano Monti ORCID iD [aut], Benoit Jacob [cph] (Author of included Eigen library), Gael Guennebaud [cph] (Author of included Eigen library), Jose Luis Blanco [cph] (Author of included nanoflann library), Pranjal Kumar Rai [cph] (Author of included nanoflann library)
Maintainer: Brian Gregor <bgregor at bu.edu>
License: GPL (≥ 3)
NeedsCompilation: yes
Language: en-US
Materials: README
CRAN checks: knnmi results

Documentation:

Reference manual: knnmi.pdf

Downloads:

Package source: knnmi_1.0.tar.gz
Windows binaries: r-devel: knnmi_1.0.zip, r-release: knnmi_1.0.zip, r-oldrel: knnmi_1.0.zip
macOS binaries: r-release (arm64): knnmi_1.0.tgz, r-oldrel (arm64): knnmi_1.0.tgz, r-release (x86_64): knnmi_1.0.tgz, r-oldrel (x86_64): knnmi_1.0.tgz

Reverse dependencies:

Reverse imports: CaDrA

Linking:

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