no code implementations • 8 Apr 2024 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
To address this challenge, we introduce the merge tree neural networks (MTNN), a learned neural network model designed for merge tree comparison.
no code implementations • 22 Sep 2023 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
This paper presents the first approach to visualize the importance of topological features that define classes of data.
no code implementations • 26 Sep 2022 • Sushovan Majhi, Carola Wenk
We study two notions of distance measures for geometric graphs, called the geometric edit distance (GED) and geometric graph distance (GGD).
no code implementations • 25 May 2021 • Yu Qin, Brittany Terese Fasy, Carola Wenk, Brian Summa
In this paper, we propose a persistence diagram hashing framework that learns a binary code representation of persistence diagrams, which allows for fast computation of distances.
no code implementations • NeurIPS Workshop TDA_and_Beyond 2020 • Brittany Fasy, Yu Qin, Brian Summa, Carola Wenk
Different vectorizations of PD summary are commonly used in machine learning applications, however distances between vectorized persistence summaries may differ greatly from the distances between the original PDs.