Stability for Inference with Persistent Homology Rank Functions

IF 2.7 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Qiquan Wang, Inés García-Redondo, Pierre Faugère, Gregory Henselman-Petrusek, Anthea Monod
{"title":"Stability for Inference with Persistent Homology Rank Functions","authors":"Qiquan Wang,&nbsp;Inés García-Redondo,&nbsp;Pierre Faugère,&nbsp;Gregory Henselman-Petrusek,&nbsp;Anthea Monod","doi":"10.1111/cgf.15142","DOIUrl":null,"url":null,"abstract":"<div>\n \n <p>Persistent homology barcodes and diagrams are a cornerstone of topological data analysis that capture the “shape” of a wide range of complex data structures, such as point clouds, networks, and functions. However, their use in statistical settings is challenging due to their complex geometric structure. In this paper, we revisit the persistent homology rank function, which is mathematically equivalent to a barcode and persistence diagram, as a tool for statistics and machine learning. Rank functions, being functions, enable the direct application of the statistical theory of functional data analysis (FDA)—a domain of statistics adapted for data in the form of functions. A key challenge they present over barcodes in practice, however, is their lack of stability—a property that is crucial to validate their use as a faithful representation of the data and therefore a viable summary statistic. In this paper, we fill this gap by deriving two stability results for persistent homology rank functions under a suitable metric for FDA integration. We then study the performance of rank functions in functional inferential statistics and machine learning on real data applications, in both single and multiparameter persistent homology. We find that the use of persistent homology captured by rank functions offers a clear improvement over existing non-persistence-based approaches.</p>\n </div>","PeriodicalId":10687,"journal":{"name":"Computer Graphics Forum","volume":"43 5","pages":""},"PeriodicalIF":2.7000,"publicationDate":"2024-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/cgf.15142","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Graphics Forum","FirstCategoryId":"94","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1111/cgf.15142","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

Abstract

Persistent homology barcodes and diagrams are a cornerstone of topological data analysis that capture the “shape” of a wide range of complex data structures, such as point clouds, networks, and functions. However, their use in statistical settings is challenging due to their complex geometric structure. In this paper, we revisit the persistent homology rank function, which is mathematically equivalent to a barcode and persistence diagram, as a tool for statistics and machine learning. Rank functions, being functions, enable the direct application of the statistical theory of functional data analysis (FDA)—a domain of statistics adapted for data in the form of functions. A key challenge they present over barcodes in practice, however, is their lack of stability—a property that is crucial to validate their use as a faithful representation of the data and therefore a viable summary statistic. In this paper, we fill this gap by deriving two stability results for persistent homology rank functions under a suitable metric for FDA integration. We then study the performance of rank functions in functional inferential statistics and machine learning on real data applications, in both single and multiparameter persistent homology. We find that the use of persistent homology captured by rank functions offers a clear improvement over existing non-persistence-based approaches.

Abstract Image

利用持久同构秩函数进行推理的稳定性
持久同源性条形码和图表是拓扑数据分析的基石,可捕捉各种复杂数据结构(如点云、网络和函数)的 "形状"。然而,由于其复杂的几何结构,在统计环境中使用它们具有挑战性。在本文中,我们重新审视了持久同源性秩函数,它在数学上等同于条形码和持久图,是一种用于统计和机器学习的工具。秩函数作为函数,可以直接应用函数数据分析(FDA)的统计理论--这是一个针对函数形式的数据进行调整的统计领域。然而,与条形码相比,秩函数在实践中面临的一个主要挑战是缺乏稳定性,而这一特性对于验证秩函数是否能忠实地表示数据,从而成为可行的汇总统计量至关重要。本文填补了这一空白,为持久同源性秩函数推导出了两个稳定结果,它们都是在合适的 FDA 整合度量条件下产生的。然后,我们研究了单参数和多参数持久同源性秩函数在函数推断统计和机器学习真实数据应用中的表现。我们发现,与现有的非持久性方法相比,使用秩函数捕捉持久性同源性有明显的改进。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Computer Graphics Forum
Computer Graphics Forum 工程技术-计算机:软件工程
CiteScore
5.80
自引率
12.00%
发文量
175
审稿时长
3-6 weeks
期刊介绍: Computer Graphics Forum is the official journal of Eurographics, published in cooperation with Wiley-Blackwell, and is a unique, international source of information for computer graphics professionals interested in graphics developments worldwide. It is now one of the leading journals for researchers, developers and users of computer graphics in both commercial and academic environments. The journal reports on the latest developments in the field throughout the world and covers all aspects of the theory, practice and application of computer graphics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信