arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2409.05671cs.CG
收藏

HyperSteiner:计算启发式双曲Steiner最小树

HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees

Alejandro García-Castellanos, Aniss Aiman Medbouhi, Giovanni Luca Marchetti, Erik J. Bekkers, Danica Kragic

AI总结:

本研究提出计算双曲空间Steiner最小树的高效启发式算法HyperSteiner,扩展欧氏分治算法并将三终端问题转化为Klein-Beltrami模型下的方程组,实验证明其在层次发现效果和大规模数据集扩展性上均优于对比方法。

摘要:

我们提出HyperSteiner——一种用于计算双曲空间中Steiner最小树的高效启发式算法。HyperSteiner扩展了欧氏Smith-Lee-Liebman算法,该算法基于涉及Delaunay三角剖分的分治方法。核心思路是在Klein-Beltrami模型中将含三个终端的Steiner树问题重新表述为方程组。受双曲几何非常适合表示层次结构这一事实的启发,我们探索了其在数据层次发现中的应用。结果表明,HyperSteiner比最小生成树推断出更符合实际的层次结构,且比Neighbor Joining更能适配大规模数据集。

英文摘要:

We propose HyperSteiner -- an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach involving the Delaunay triangulation. The central idea is rephrasing Steiner tree problems with three terminals as a system of equations in the Klein-Beltrami model. Motivated by the fact that hyperbolic geometry is well-suited for representing hierarchies, we explore applications to hierarchy discovery in data. Results show that HyperSteiner infers more realistic hierarchies than the Minimum Spanning Tree and is more scalable to large datasets than Neighbor Joining.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑