detalle del documento
IDENTIFICACIÓN
oai:arXiv.org:2409.05671
Tema
Computer Science - Computational G...Autor
García-Castellanos, Alejandro Medbouhi, Aniss Aiman Marchetti, Giovanni Luca Bekkers, Erik J. Kragic, DanicaCategoría
Computer Science
Año
2024
fecha de cotización
22/1/2025
Palabras clave
steiner hypersteinerResumen
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.
García-Castellanos, Alejandro,Medbouhi, Aniss Aiman,Marchetti, Giovanni Luca,Bekkers, Erik J.,Kragic, Danica, 2024, HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees
Evaluating Image Hallucination in Text-to-Image Generation with Question-Answering
evaluation computer dataset images tti generation i-halla
Role of Repetitive Transcranial Magnetic Stimulation in Treatment of Fibromyalgia: A Randomized Controlled Trial
significant following stimulation fms treatment
