Balancing between the Local and Global Structures (LGS) in Graph Embedding
원문 초록
We present a method for balancing between the Local and Global Structures (LGS) in graph embedding, via a tunable parameter. Some embedding methods aim to capture global structures, while others attempt to preserve local neighborhoods. Few methods attempt to do both, and it is not always possible to capture well both local and global information in two dimensions, which is where most graph drawing live. The choice of using a local or a global embedding for visualization depends not only on the task but also on the structure of the underlying data, which may not be known in advance. For a given graph, LGS aims to find a good balance between the local and global structure to preserve. We evaluate the performance of LGS with synthetic and real-world datasets and our results indicate that it is competitive with the state-of-the-art methods, using established quality metrics such as stress and neighborhood preservation. We introduce a novel quality metric, cluster distance preservation, to assess intermediate structure capture. All source-code, datasets, experiments and analysis are available online.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
ETT-CKGE: Efficient Task-driven Tokens for Continual Knowledge Graph Embedding
Efficient Identity and Position Graph Embedding via Spectral-Based Random Feature Aggregation
Balancing Graph Embedding Smoothness in Self-Supervised Learning via Information-Theoretic Decomposition
Optimal Embedding Guided Negative Sample Generation for Knowledge Graph Link Prediction
AdvSGM: Differentially Private Graph Learning via Adversarial Skip-gram Model
Multi-dataset and Transfer Learning Using Gene Expression Knowledge Graphs
토론
이 논문과 연결된 포럼 글이 아직 없습니다.