A Random Persistence Diagram Generator
원문 초록
Topological data analysis (TDA) studies the shape patterns of data. Persistent homology is a widely used method in TDA that summarizes homological features of data at multiple scales and stores them in persistence diagrams (PDs). In this paper, we propose a random persistence diagram generator (RPDG) method that generates a sequence of random PDs from the ones produced by the data. RPDG is underpinned by a model based on pairwise interacting point processes, and a reversible jump Markov chain Monte Carlo (RJ-MCMC) algorithm. A first example, which is based on a synthetic dataset, demonstrates the efficacy of RPDG and provides a comparison with another method for sampling PDs. A second example demonstrates the utility of RPDG to solve a materials science problem given a real dataset of small sample size.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Filtering through a topological lens: homology for point processes on the time-frequency plane
MS-DPPs: Multi-Source Determinantal Point Processes for Contextual Diversity Refinement of Composite Attributes in Text to Image Retrieval
Towards Reliable Detection of Empty Space: Conditional Marked Point Processes for Object Detection
Comparing the Effects of Persistence Barcodes Aggregation and Feature Concatenation on Medical Imaging
Topological Machine Learning for Protein-Nucleic Acid Binding Affinity Changes Upon Mutation
Turbocharging Gaussian Process Inference with Approximate Sketch-and-Project
토론
이 논문과 연결된 포럼 글이 아직 없습니다.