REVIEW 1 cited by
HyperSteiner: Computing Heuristic Hyperbolic Steiner Minimal Trees
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
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.
Forward citations
Cited by 1 Pith paper
-
Even Faster Hyperbolic Random Forests: A Beltrami-Klein Wrapper Approach
Fast-HyperDT reexpresses HyperDT as pre- and post-processing around standard Euclidean trees, making hyperbolic random forests practical.
Discussion (0). Continue with ORCID to comment.