Persistent de Rham-Hodge Laplacians in Eulerian representation for manifold topological learning.

IF 1.8 3区 数学 Q1 MATHEMATICS
AIMS Mathematics Pub Date : 2024-01-01 Epub Date: 2024-09-23 DOI:10.3934/math.20241333
Zhe Su, Yiying Tong, Guo-Wei Wei
{"title":"Persistent de Rham-Hodge Laplacians in Eulerian representation for manifold topological learning.","authors":"Zhe Su, Yiying Tong, Guo-Wei Wei","doi":"10.3934/math.20241333","DOIUrl":null,"url":null,"abstract":"<p><p>Recently, topological data analysis has become a trending topic in data science and engineering. However, the key technique of topological data analysis, i.e., persistent homology, is defined on point cloud data, which does not work directly for data on manifolds. Although earlier evolutionary de Rham-Hodge theory deals with data on manifolds, it is inconvenient for machine learning applications because of the numerical inconsistency caused by remeshing the involving manifolds in the Lagrangian representation. In this work, we introduced persistent de Rham-Hodge Laplacian, or persistent Hodge Laplacian (PHL), as an abbreviation for manifold topological learning. Our PHLs were constructed in the Eulerian representation via structure-persevering Cartesian grids, avoiding the numerical inconsistency over the multi-scale manifolds. To facilitate the manifold topological learning, we proposed a persistent Hodge Laplacian learning algorithm for data on manifolds or volumetric data. As a proof-of-principle application of the proposed manifold topological learning model, we considered the prediction of protein-ligand binding affinities with two benchmark datasets. Our numerical experiments highlighted the power and promise of the proposed method.</p>","PeriodicalId":48562,"journal":{"name":"AIMS Mathematics","volume":"9 10","pages":"27438-27470"},"PeriodicalIF":1.8000,"publicationDate":"2024-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC12462892/pdf/","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"AIMS Mathematics","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.3934/math.20241333","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/9/23 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Recently, topological data analysis has become a trending topic in data science and engineering. However, the key technique of topological data analysis, i.e., persistent homology, is defined on point cloud data, which does not work directly for data on manifolds. Although earlier evolutionary de Rham-Hodge theory deals with data on manifolds, it is inconvenient for machine learning applications because of the numerical inconsistency caused by remeshing the involving manifolds in the Lagrangian representation. In this work, we introduced persistent de Rham-Hodge Laplacian, or persistent Hodge Laplacian (PHL), as an abbreviation for manifold topological learning. Our PHLs were constructed in the Eulerian representation via structure-persevering Cartesian grids, avoiding the numerical inconsistency over the multi-scale manifolds. To facilitate the manifold topological learning, we proposed a persistent Hodge Laplacian learning algorithm for data on manifolds or volumetric data. As a proof-of-principle application of the proposed manifold topological learning model, we considered the prediction of protein-ligand binding affinities with two benchmark datasets. Our numerical experiments highlighted the power and promise of the proposed method.

流形拓扑学习的欧拉表示中的持久de Rham-Hodge拉普拉斯算子。
近年来,拓扑数据分析已成为数据科学与工程领域的一个热门话题。然而,拓扑数据分析的关键技术,即持久同调,是在点云数据上定义的,它不能直接用于流形上的数据。虽然早期的演化de Rham-Hodge理论处理流形上的数据,但由于在拉格朗日表示中重新划分涉及的流形导致数值不一致,因此不方便用于机器学习应用。在这项工作中,我们引入了持久性de Rham-Hodge Laplacian,或持久性Hodge Laplacian (PHL),作为流形拓扑学习的缩写。我们的phl是通过结构保持笛卡尔网格在欧拉表示中构建的,避免了多尺度流形上的数值不一致。为了便于流形拓扑学习,我们提出了一种基于流形或体积数据的持久霍奇拉普拉斯学习算法。作为所提出的流形拓扑学习模型的原理验证应用,我们考虑了用两个基准数据集预测蛋白质-配体结合亲和力。我们的数值实验突出了所提出的方法的力量和前景。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
AIMS Mathematics
AIMS Mathematics Mathematics-General Mathematics
CiteScore
3.40
自引率
13.60%
发文量
769
审稿时长
90 days
期刊介绍: AIMS Mathematics is an international Open Access journal devoted to publishing peer-reviewed, high quality, original papers in all fields of mathematics. We publish the following article types: original research articles, reviews, editorials, letters, and conference reports.
×
引用
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学术文献互助群
群 号:604180095
Book学术官方微信