拓扑数据分析的欧拉示性数工具
Euler Characteristic Tools For Topological Data Analysis
AI总结:
本文研究拓扑数据分析中的欧拉示性数技术,提出欧拉示性数剖面及其混合变换,在低计算成本下于监督和无监督任务中均取得卓越性能,并证明了其稳定性与渐近保证。
摘要:
本文研究拓扑数据分析中的欧拉示性数技术。对由数据构建的一系列单纯复形族逐点计算其欧拉示性数,便得到了所谓的欧拉示性数剖面。我们展示了这种简单的描述子在极低计算成本下,能在监督任务中实现最先进的性能。受信号分析启发,我们计算了欧拉示性数剖面的混合变换。这些积分变换将欧拉示性数技术与勒贝格积分相结合,为拓扑信号提供了高效的压缩器。因此,它们在无监督环境中展现出卓越的性能。在定性方面,我们提供了关于欧拉剖面及其混合变换所捕获的拓扑与几何信息的诸多启发式方法。最后,我们证明了这些描述子的稳定性结果,以及在随机环境中的渐近保证。
英文摘要:
In this article, we study Euler characteristic techniques in topological data analysis. Pointwise computing the Euler characteristic of a family of simplicial complexes built from data gives rise to the so-called Euler characteristic profile. We show that this simple descriptor achieve state-of-the-art performance in supervised tasks at a very low computational cost. Inspired by signal analysis, we compute hybrid transforms of Euler characteristic profiles. These integral transforms mix Euler characteristic techniques with Lebesgue integration to provide highly efficient compressors of topological signals. As a consequence, they show remarkable performances in unsupervised settings. On the qualitative side, we provide numerous heuristics on the topological and geometric information captured by Euler profiles and their hybrid transforms. Finally, we prove stability results for these descriptors as well as asymptotic guarantees in random settings.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。