Hyperbolic Node Embedding for Signed Networks
원문 초록
Signed network embedding methods aim to learn vector representations of nodes in signed networks. However, existing algorithms only managed to embed networks into low-dimensional Euclidean spaces whereas many intrinsic features of signed networks are reported more suitable for non-Euclidean spaces. For instance, previous works did not consider the hierarchical structures of networks, which is widely witnessed in real-world networks. In this work, we answer an open question that whether the hyperbolic space is a better choice to accommodate signed networks and learn embeddings that can preserve the corresponding special characteristics. We also propose a non-Euclidean signed network embedding method based on structural balance theory and Riemannian optimization, which embeds signed networks into a Poincar\'e ball in a hyperbolic space. This space enables our approach to capture underlying hierarchy of nodes in signed networks because it can be seen as a continuous tree. We empirically compare our method against six Euclidean-based baselines in three tasks on seven real-world datasets, and the results show the effectiveness of our method.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Accelerated Riemannian Optimization: Handling Constraints with a Prox to Bound Geometric Penalties
GARG-AML against Smurfing: A Scalable and Interpretable Graph-Based Framework for Anti-Money Laundering
CulFiT: A Fine-grained Cultural-aware LLM Training Paradigm via Multilingual Critique Data Synthesis
O$^2$-Searcher: A Searching-based Agent Model for Open-Domain Open-Ended Question Answering
Efficient Optimization with Orthogonality Constraint: a Randomized Riemannian Submanifold Method
Ranked Voting based Self-Consistency of Large Language Models
토론
이 논문과 연결된 포럼 글이 아직 없습니다.