The Mapper algorithm from Topological Data Analysis, the steps are as follows 1. Define a filter (lens) function on the data. 2. Perform clustering within each level set. 3. Generate a complex from the clustering results.
| Version: |
1.0.5 |
| Depends: |
R (≥ 3.1.2) |
| Imports: |
parallel, doParallel, foreach, networkD3, igraph, ggraph, tidygraph, ggplot2, htmlwidgets, rlang, webshot2 |
| Suggests: |
fastcluster, cluster, dbscan, testthat (≥ 3.0.0) |
| Published: |
2025-10-01 |
| DOI: |
10.32614/CRAN.package.MapperAlgo |
| Author: |
ChiChien Wang [aut, cre, trl],
Paul Pearson [ctb],
Daniel Muellner [ctb],
Gurjeet Singh [ctb] |
| Maintainer: |
ChiChien Wang <kennywang2003 at gmail.com> |
| BugReports: |
https://github.com/TDA-R/MapperAlgo/issues |
| License: |
MIT + file LICENSE |
| URL: |
https://github.com/TDA-R/MapperAlgo |
| NeedsCompilation: |
no |
| Materials: |
README |
| CRAN checks: |
MapperAlgo results |