GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding
Wenyu Du; Shuai Yu; Min Yang; Qiang Qu; Jia Zhu
2018
会议日期2018
会议地点Lyon, France
英文摘要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.
语种英语
URL标识查看原文
内容类型会议论文
源URL[http://ir.siat.ac.cn:8080/handle/172644/14093]  
专题深圳先进技术研究院_数字所
推荐引用方式
GB/T 7714
Wenyu Du,Shuai Yu,Min Yang,et al. GPSP: Graph Partition and Space Projection based Approach for Heterogeneous Network Embedding[C]. 见:. Lyon, France. 2018.
个性服务
查看访问统计
相关权益政策
暂无数据
收藏/分享
所有评论 (0)
暂无评论
 

除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。


©版权所有 ©2017 CSpace - Powered by CSpace