Multiple hypothesis testing with persistent homology

IF 1.7 Q2 MATHEMATICS, APPLIED Foundations of data science (Springfield, Mo.) Pub Date : 2020-10-10 DOI:10.3934/fods.2022018
Mikael Vejdemo-Johansson, Sayan Mukherjee
{"title":"Multiple hypothesis testing with persistent homology","authors":"Mikael Vejdemo-Johansson, Sayan Mukherjee","doi":"10.3934/fods.2022018","DOIUrl":null,"url":null,"abstract":"Multiple hypothesis testing requires a control procedure: the error probabilities in statistical testing compound when several tests are performed for the same conclusion. A common type of multiple hypothesis testing error rates is the FamilyWise Error Rate (FWER) which measures the probability that any one of the performed tests rejects its null hypothesis erroneously. These are often controlled using Bonferroni’s method or later more sophisticated approaches all of which involve replacing the test level α with α/k, reducing it by a factor of the number of simultaneous tests performed. Common paradigms for hypothesis testing in persistent homology are often based on permutation testing, however increasing the number of permutations to meet a Bonferroni-style threshold can be prohibitively expensive. In this paper we propose a null model based approach to testing for acyclicity (ie trivial homology), coupled with a Family-Wise Error Rate (FWER) control method that does not suffer from these computational costs.","PeriodicalId":73054,"journal":{"name":"Foundations of data science (Springfield, Mo.)","volume":null,"pages":null},"PeriodicalIF":1.7000,"publicationDate":"2020-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations of data science (Springfield, Mo.)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3934/fods.2022018","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 3

Abstract

Multiple hypothesis testing requires a control procedure: the error probabilities in statistical testing compound when several tests are performed for the same conclusion. A common type of multiple hypothesis testing error rates is the FamilyWise Error Rate (FWER) which measures the probability that any one of the performed tests rejects its null hypothesis erroneously. These are often controlled using Bonferroni’s method or later more sophisticated approaches all of which involve replacing the test level α with α/k, reducing it by a factor of the number of simultaneous tests performed. Common paradigms for hypothesis testing in persistent homology are often based on permutation testing, however increasing the number of permutations to meet a Bonferroni-style threshold can be prohibitively expensive. In this paper we propose a null model based approach to testing for acyclicity (ie trivial homology), coupled with a Family-Wise Error Rate (FWER) control method that does not suffer from these computational costs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
具有持久同源性的多重假设检验
多重假设检验需要一个控制程序:当对同一结论进行多次检验时,统计检验中的错误概率。多假设测试错误率的一种常见类型是FamilyWise错误率(FWER),它测量任何一个执行的测试错误地拒绝其零假设的概率。这些通常使用Bonferroni的方法或后来更复杂的方法进行控制,所有这些方法都涉及用α/k代替测试水平α,将其减少一倍于同时进行的测试数量。持久同源性中假设检验的常见范式通常基于排列检验,然而,增加排列数量以满足Bonferroni风格的阈值可能代价高昂。在本文中,我们提出了一种基于零模型的方法来测试非循环性(即平凡同源性),并结合了一种不受这些计算成本影响的家族错误率(FWER)控制方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
3.30
自引率
0.00%
发文量
0
期刊最新文献
CHATGPT FOR COMPUTATIONAL TOPOLOGY. PERSISTENT PATH LAPLACIAN. Weight set decomposition for weighted rank and rating aggregation: An interpretable and visual decision support tool Hierarchical regularization networks for sparsification based learning on noisy datasets Noise calibration for SPDEs: A case study for the rotating shallow water model
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1