A hyperbolic approach for learning communities on graphs

DOI10.1007/S10618-022-00902-8MaRDI QIDQ6040509zbMATH OpenOpenAlexFDO

Authors Thomas Gerald, Hadi Zaatiti, Hatem Hajri, Nicolas Baskiotis, Olivier Schwander

Publication date 17 May 2023

Published in Data Mining and Knowledge Discovery (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10618-022-00902-8

zbMATH Keywords

community embeddinggraph-structured datahyperbolic spacemanifoldsrepresentation learning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• An improved hyperbolic embedding algorithm
• scientific article; zbMATH DE number 7366428
• Hyperbolic node embedding for temporal networks
• Hyperbolic mapping of complex networks based on community information
• Nonnegative matrix factorization with mixed hypergraph regularization for community detection

Cites work

• Differential geometry, Lie groups, and symmetric spaces.
• Gaussian Distributions on Riemannian Symmetric Spaces: Statistical Learning With Structured Covariance Matrices
• scientific article; zbMATH DE number 3928102 (Why is no real title available?)
• scientific article; zbMATH DE number 4031953 (Why is no real title available?)
• scientific article; zbMATH DE number 556510 (Why is no real title available?)
• Intrinsic statistics on Riemannian manifolds: Basic tools for geometric measurements
• Means in complete manifolds: uniqueness and approximation
• Riemannian \(L^{p}\) center of mass: existence, uniqueness, and convexity
• Riemannian Gaussian Distributions on the Space of Symmetric Positive Definite Matrices
• Stochastic algorithms for computing means of probability measures
• Stochastic Gradient Descent on Riemannian Manifolds

Cited in

(4)

• Hyperbolic mapping of complex networks based on community information
• scientific article; zbMATH DE number 7366428 (Why is no real title available?)
• Joint hyperbolic and Euclidean geometry contrastive graph neural networks
• Clustering with minimum spanning trees: how good can it be?

This page was built for publication: A hyperbolic approach for learning communities on graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6040509)