A Euclidean embedding for computing persistent homology with Gaussian kernels

Cites work

-samples for kernels
\(C^1\) isometric imbeddings
Comparing distributions and shapes using the kernel distance
Computational topology. An introduction
Declutter and resample: towards parameter free denoising
Dimensionality reduction for \(k\)-distance applied to persistent homology
Dimensionality reduction: beyond the Johnson-Lindenstrauss bound
DTM-based filtrations
Efficient and robust persistent homology for measures
Estimates of moments and tails of Gaussian chaoses
Geometric inference for probability measures
Geometric inference on kernel density estimates
Hashing-based-estimators for kernel density in high dimensions
High-dimensional probability. An introduction with applications in data science
scientific article; zbMATH DE number 6999914 (Why is no real title available?)
scientific article; zbMATH DE number 7141425 (Why is no real title available?)
scientific article; zbMATH DE number 7758314 (Why is no real title available?)
Kernel Mean Embedding of Distributions: A Review and Beyond
Kernel methods in machine learning
Oblivious Sketching of High-Degree Polynomial Kernels
On the imbedding of systems of compacta in simplicial complexes
Persistent homology for low-complexity models
Scalable kernel \(k\)-means clustering with Nyström approximation: relative-error bounds
The persistent homology of distance functions under random projection
Theory of Reproducing Kernels
Topological persistence and simplification
Towards persistence-based reconstruction in euclidean spaces
Universality, Characteristic Kernels and RKHS Embedding of Measures
Upper and lower bounds for stochastic processes. Decomposition theorems
Witnessed k-distance

This page was built for publication: A Euclidean embedding for computing persistent homology with Gaussian kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7253085)