The Topology Data Analysis uses the Mapper algorithm, but computational complexity is not good. Is there an alternative algorithm for algorithm Mapper? Is there an algorithm that works faster?
2

4$\begingroup$ I'm guessing you're referring to the Mapper algorithm of Singh, Mémoli and Carlsson from this paper ayasdi.com/wpcontent/uploads/2015/02/… . It would help if you edited some more background into your question and were more precise about your needs. $\endgroup$ – j.c. Apr 4 '18 at 13:59

$\begingroup$ Yes. Computational cost is big: at some point, if computing one barcode / persistence diagram is rather ok, computing thousand of them, and then compute pairwise distances between them etc ... is a bit complicated. That is computational problem. What is Time computational complexity for Mapper? $\endgroup$ – Karolina Paradysz Apr 4 '18 at 17:52
Add a comment

$\begingroup$
$\endgroup$
You might want to check out https://arxiv.org/abs/1712.03660 It describes a way to execute in parallel Mapper.