Topological data analysis (TDA) is a method of data analysis that uses techniques from topology to analyze high-dimensional data. Here we implement Mapper, an algorithm from this area developed by Singh, Mémoli and Carlsson (2007) which generalizes the concept of a Reeb graph <https://en.wikipedia.org/wiki/Reeb_graph>.
Version: | 1.3.0 |
Imports: | fastcluster, grDevices, igraph, stats, utils |
Suggests: | testthat (≥ 3.0.0) |
Published: | 2024-10-30 |
DOI: | 10.32614/CRAN.package.mappeR |
Author: | George Clare Kennedy [aut, cre] |
Maintainer: | George Clare Kennedy <george-clarekennedy at uiowa.edu> |
BugReports: | https://github.com/Uiowa-Applied-Topology/mappeR/issues |
License: | MIT + file LICENSE |
URL: | https://github.com/Uiowa-Applied-Topology/mappeR |
NeedsCompilation: | no |
Materials: | README NEWS |
CRAN checks: | mappeR results |
Reference manual: | mappeR.pdf |
Package source: | mappeR_1.3.0.tar.gz |
Windows binaries: | r-devel: mappeR_1.3.0.zip, r-release: mappeR_1.3.0.zip, r-oldrel: mappeR_1.3.0.zip |
macOS binaries: | r-release (arm64): mappeR_1.3.0.tgz, r-oldrel (arm64): mappeR_1.3.0.tgz, r-release (x86_64): mappeR_1.3.0.tgz, r-oldrel (x86_64): mappeR_1.3.0.tgz |
Old sources: | mappeR archive |
Please use the canonical form https://CRAN.R-project.org/package=mappeR to link to this page.