DeepAI AI Chat
Log In Sign Up

Stratified Space Learning: Reconstructing Embedded Graphs

by   Yossi Bokor Bleile, et al.

Many data-rich industries are interested in the efficient discovery and modelling of structures underlying large data sets, as it allows for the fast triage and dimension reduction of large volumes of data embedded in high dimensional spaces. The modelling of these underlying structures is also beneficial for the creation of simulated data that better represents real data. In particular, for systems testing in cases where the use of real data streams might prove impractical or otherwise undesirable. We seek to discover and model the structure by combining methods from topological data analysis with numerical modelling. As a first step in combining these two areas, we examine the recovery of the abstract graph G structure, and model a linear embedding |G| given only a noisy point cloud sample X of |G|.


page 1

page 2

page 3

page 4


Towards Stratified Space Learning: Linearly Embedded Graphs

In this paper, we consider the simplest class of stratified spaces – lin...

Towards Stratified Space Learning: 2-complexes

In this paper, we consider a simple class of stratified spaces – 2-compl...

Generalized Penalty for Circular Coordinate Representation

Topological Data Analysis (TDA) provides novel approaches that allow us ...

Phase transition of graph Laplacian of high dimensional noisy random point cloud

We systematically explore the spectral distribution of kernel-based grap...

Skeletonisation Algorithms for Unorganised Point Clouds with Theoretical Guarantees

Real datasets often come in the form of an unorganised cloud of points. ...

Statistical embedding: Beyond principal components

There has been an intense recent activity in embedding of very high dime...

Skeletonisation Algorithms with Theoretical Guarantees for Unorganised Point Clouds with High Levels of Noise

Data Science aims to extract meaningful knowledge from unorganised data....