A Mapper Algorithm with implicit intervals and its optimization
Yuyang Tao, Shufei Ge

TL;DR
This paper introduces a novel soft Mapper framework using Gaussian mixture models and stochastic gradient descent to automatically optimize parameters, improving topological data analysis especially in biomedical applications.
Contribution
It proposes an implicit interval representation with automatic parameter tuning for Mapper, addressing manual tuning limitations and incorporating data uncertainty.
Findings
Effective in capturing topological structures in simulations
Successfully identified Alzheimer's subgroups in RNA data
Robustness demonstrated through application studies
Abstract
The Mapper algorithm is an essential tool for visualizing complex, high dimensional data in topology data analysis (TDA) and has been widely used in biomedical research. It outputs a combinatorial graph whose structure implies the shape of the data. However,the need for manual parameter tuning and fixed intervals, along with fixed overlapping ratios may impede the performance of the standard Mapper algorithm. Variants of the standard Mapper algorithms have been developed to address these limitations, yet most of them still require manual tuning of parameters. Additionally, many of these variants, including the standard version found in the literature, were built within a deterministic framework and overlooked the uncertainty inherent in the data. To relax these limitations, in this work, we introduce a novel framework that implicitly represents intervals through a hidden assignment…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsFuzzy Logic and Control Systems · Constraint Satisfaction and Optimization · Robotic Path Planning Algorithms
