Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.
Nearest neighbor pattern classification
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Towards an Optimal Bound for the Interleaving Distance on Mapper Graphs
Presents ILP formulations to bound the interleaving distance on mapper graphs, with evaluation on small examples and benchmark datasets.
- The General Theory of Localization Methods