Multiple Hypothesis Testing with Persistent Homology
Multiple hypothesis testing requires a control procedure. Simply increasing simulations or permutations to meet a Bonferroni-style threshold is prohibitively expensive. In this paper we propose a null model based approach to testing for acyclicity, coupled with a Family-Wise Error Rate (FWER) control method that does not suffer from these computational costs.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Topology Applied to Machine Learning: From Global to Local
Through the use of examples, we explain one way in which applied topology has evolved since the birth of persistent homology in the early 2000s. The first applications of topology to data emphasized the global shape of a…
BIG-bench Machine LearningSurveyStatistical Topological Data Analysis - A Kernel Perspective
We consider the problem of statistical computations with persistence diagrams, a summary representation of topological features in data. These diagrams encode persistent homology, a widely used invariant in topological d…
Topological Data AnalysisTwo-sample testingA higher homotopic extension of persistent (co)homology
Our objective in this article is to show a possibly interesting structure of homotopic nature appearing in persistent (co)homology. Assuming that the filtration of the (say) simplicial set embedded in a finite dimensiona…
Topological Data AnalysisDory: Overcoming Barriers to Computing Persistent Homology
Persistent homology (PH) is an approach to topological data analysis (TDA) that computes multi-scale topologically invariant properties of high-dimensional data that are robust to noise. While PH has revealed useful patt…
Topological Data AnalysisPersistent Intersection Homology for the Analysis of Discrete Data
Topological data analysis is becoming increasingly relevant to support the analysis of unstructured data sets. A common assumption in data analysis is that the data set is a sample---not necessarily a uniform one---of so…
Topological Data Analysis