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?
$\begingroup$
$\endgroup$
2
-
4$\begingroup$ I'm guessing you're referring to the Mapper algorithm of Singh, Mémoli and Carlsson from this paper ayasdi.com/wp-content/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.– j.c.2018-04-04 13:59:05 +00:00Commented Apr 4, 2018 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– Karolina Paradysz2018-04-04 17:52:40 +00:00Commented Apr 4, 2018 at 17:52
Add a comment
|
1 Answer
$\begingroup$
$\endgroup$
You might want to check out https://arxiv.org/abs/1712.03660 It describes a way to execute in parallel Mapper.
