Sampled in Pairs and Driven by Text: A New Graph Embedding Framework
Liheng Chen, Yanru Qu, Zhenghui Wang, Lin Qiu, Weinan Zhang, Ken Chen,, Shaodian Zhang, Yong Yu

TL;DR
This paper introduces TGE-PS, a novel graph embedding framework that combines efficient pair sampling and text-driven embedding to improve performance on graphs with rich textual data, especially in zero-shot scenarios.
Contribution
It proposes a new framework that reduces sampling redundancy and effectively utilizes textual information for graph embedding, outperforming existing models.
Findings
Reduces training samples by ~99% with maintained performance.
Achieves state-of-the-art results on link prediction tasks.
Effectively handles zero-shot link prediction scenarios.
Abstract
In graphs with rich texts, incorporating textual information with structural information would benefit constructing expressive graph embeddings. Among various graph embedding models, random walk (RW)-based is one of the most popular and successful groups. However, it is challenged by two issues when applied on graphs with rich texts: (i) sampling efficiency: deriving from the training objective of RW-based models (e.g., DeepWalk and node2vec), we show that RW-based models are likely to generate large amounts of redundant training samples due to three main drawbacks. (ii) text utilization: these models have difficulty in dealing with zero-shot scenarios where graph embedding models have to infer graph structures directly from texts. To solve these problems, we propose a novel framework, namely Text-driven Graph Embedding with Pairs Sampling (TGE-PS). TGE-PS uses Pairs Sampling (PS) to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsDeepWalk
