Search Results for author: Paweł Dłotko

Found 6 papers, 4 papers with code

Euler Characteristic Curves and Profiles: a stable shape invariant for big data problems

1 code implementation3 Dec 2022 Paweł Dłotko, Davide Gurnari

While being a weaker invariant in one dimension, we show that Euler Characteristic based approaches do not possess some handicaps of persistent homology; we show efficient algorithms to compute them in a distributed way, their generalization to multifiltrations and practical applicability for big data problems.

Topological Data Analysis

Mapper-type algorithms for complex data and relations

1 code implementation2 Sep 2021 Paweł Dłotko, Davide Gurnari, Radmila Sazdanovic

Mapper and Ball Mapper are Topological Data Analysis tools used for exploring high dimensional point clouds and visualizing scalar-valued functions on those point clouds.

Topological Data Analysis Vocal Bursts Type Prediction

Hotspot identification for Mapper graphs

no code implementations NeurIPS Workshop TDA_and_Beyond 2020 Ciara Frances Loughrey, Nick Orr, Anna Jurek-Loughrey, Paweł Dłotko

Mapper algorithm can be used to build graph-based representations of high-dimensional data capturing structurally interesting features such as loops, flares or clusters.

Ball mapper: a shape summary for topological data analysis

1 code implementation22 Jan 2019 Paweł Dłotko

Topological data analysis provides a collection of tools to encapsulate and summarize the shape of data.

Algebraic Topology

Persistence Bag-of-Words for Topological Data Analysis

1 code implementation21 Dec 2018 Bartosz Zieliński, Michał Lipiński, Mateusz Juda, Matthias Zeppelzauer, Paweł Dłotko

Persistent homology (PH) is a rigorous mathematical theory that provides a robust descriptor of data in the form of persistence diagrams (PDs).

BIG-bench Machine Learning Topological Data Analysis

Topology preserving thinning for cell complexes

no code implementations6 Sep 2013 Paweł Dłotko, Ruben Specogna

This paper introduces a novel topology preserving thinning algorithm which removes \textit{simple cells}---a generalization of simple points---of a given cell complex.

Cannot find the paper you are looking for? You can Submit a new open access paper.