SOTAVerified

GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding

2018-03-07Code Available0· sign in to hype

Wenyu Du, Shuai Yu, Min Yang, Qiang Qu, Jia Zhu

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

In this paper, we propose GPSP, a novel Graph Partition and Space Projection based approach, to learn the representation of a heterogeneous network that consists of multiple types of nodes and links. Concretely, we first partition the heterogeneous network into homogeneous and bipartite subnetworks. Then, the projective relations hidden in bipartite subnetworks are extracted by learning the projective embedding vectors. Finally, we concatenate the projective vectors from bipartite subnetworks with the ones learned from homogeneous subnetworks to form the final representation of the heterogeneous network. Extensive experiments are conducted on a real-life dataset. The results demonstrate that GPSP outperforms the state-of-the-art baselines in two key network mining tasks: node classification and clustering.

Tasks

Reproductions