New Research Benchmarks Hyperbolic Graph Embedders for Network Analysis

A new paper published on arXiv benchmarks thirteen unsupervised hyperbolic graph embedders from machine learning, network science, and algorithmics. The study evaluates these methods for link prediction and topology reconstruction across various synthetic and empirical networks. Results indicate that maximum-likelihood and representation-learning-based approaches, including hybrid variants, generally perform best, though no single method excels in all scenarios. The research provides guidance on selecting appropriate methods based on network characteristics and task requirements. AI

IMPACT Provides practical guidance for selecting hyperbolic graph embedding methods in machine learning applications.

RANK_REASON The item is a research paper published on arXiv detailing a benchmark study of algorithms. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

• algorithmics
• alphaXiv
• arXiv
• CatalyzeX Code Finder for Papers
• Connected Papers
• CORE Recommender
• DagsHub
• Gotit.pub
• Hugging Face
• Hyperbolic Graph Embedders
• IArxiv Recommender
• Influence Flower
• Link prediction
• Litmaps
• machine learning
• Network science (Cambridge University Press)
• ScienceCast
• scite Smart Citations
• Topology Reconstruction of Dynamical Networks via Constrained Lyapunov Equations

• paper
• model release

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →