Generalized penalty for circular coordinate representation

DOI10.3934/FODS.2021024MaRDI QIDQ2072668zbMATH OpenOpenAlexFDO

Authors Hengrui Luo, Alice Patania, Jisu Kim, Mikael Vejdemo Johansson

Publication date 26 January 2022

Published in Foundations of Data Science (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2006.02554

zbMATH Keywords

high-dimensional datanonlinear dimension reductionpersistent cohomologytopological data analysis

Mathematics Subject Classification ID

Persistent homology and applications, topological data analysis (55N31) Topological data analysis (62R40) Computational aspects of data analysis and big data (68T09)

Abstract: Topological Data Analysis (TDA) provides novel approaches that allow us to analyze the geometrical shapes and topological structures of a dataset. As one important application, TDA can be used for data visualization and dimension reduction. We follow the framework of circular coordinate representation, which allows us to perform dimension reduction and visualization for high-dimensional datasets on a torus using persistent cohomology. In this paper, we propose a method to adapt the circular coordinate framework to take into account the roughness of circular coordinates in change-point and high-dimensional applications. We use a generalized penalty function instead of an $L_2$ penalty in the traditional circular coordinate algorithm. We provide simulation experiments and real data analysis to support our claim that circular coordinates with generalized penalty will detect the change in high-dimensional datasets under different sampling schemes while preserving the topological structures.

Recommendations

• Persistent homology for analyzing environmental lake monitoring data
• Persistent cohomology and circular coordinates
• Persistent cohomology and circular coordinates
• Introduction to topological data analysis and applications
• Topological analysis of variance and the maxillary complex

Cites work

• An O(n) algorithm for the linear multiple choice knapsack problem and related problems
• Confidence sets for persistence diagrams
• CONTINUOUS INSPECTION SCHEMES
• Detection of abrupt changes: theory and application
• Finding the homology of submanifolds with high confidence from random samples
• Hessian eigenmaps: Locally linear embedding techniques for high-dimensional data
• scientific article; zbMATH DE number 2080487 (Why is no real title available?)
• scientific article; zbMATH DE number 3429948 (Why is no real title available?)
• scientific article; zbMATH DE number 6797621 (Why is no real title available?)
• Javaplex: a research software package for persistent (co)homology
• Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
• Matrix multiplication via arithmetic progressions
• Persistent cohomology and circular coordinates
• Relative clustering validity criteria: A comparative overview
• Ripser: efficient computation of Vietoris-Rips persistence barcodes
• Sparse and redundant representations. From theory to applications in signal and image processing.
• The main contributions of robust statistics to statistical science and a new challenge
• Topology and data
• Visualizing data using t-SNE
• Zigzag persistent homology in matrix multiplication time

Cited in

(5)

• Persistent homology for analyzing environmental lake monitoring data
• Asymptotics of lower dimensional zero-density regions
• A topological data analysis based classifier
• Multiple closed curve modeling with uncertainty quantification for shape analysis
• Circular coordinates for density-robust analysis

Describes a project that uses

Uses Software

• UMAP
• javaPlex
• Adam
• t-SNE
• Ripser
• GitHub

This page was built for publication: Generalized penalty for circular coordinate representation

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