Multi-task network embedding

被引:0
作者
Linchuan Xu
Xiaokai Wei
Jiannong Cao
Philip S. Yu
机构
[1] The Hong Kong Polytechnic University,Department of Computing
[2] Facebook Inc.,Department of Computer Science
[3] University of Illinois at Chicago,undefined
来源
International Journal of Data Science and Analytics | 2019年 / 8卷
关键词
Network embedding; Representation learning; Multi-task learning; Data mining;
D O I
暂无
中图分类号
学科分类号
摘要
As there are various data mining applications involving network analysis, network embedding is frequently employed to learn latent representations or embeddings that encode the network structure. However, existing network embedding models are only designed for a single network scenario. It is common that nodes can have multiple types of relationships in big data era, which results in multiple networks, e.g., multiple social networks and multiple gene regulatory networks. Jointly embedding multiple networks thus may make network-specific embeddings more comprehensive and complete as the same node may expose similar or complementary characteristics in different networks. In this paper, we thus propose an idea of multi-task network embedding to jointly learn multiple network-specific embeddings for each node via enforcing an extra information-sharing embedding. We instantiate the idea in two types of models that are different in the mechanism for enforcing the information-sharing embedding. The first type enforces the information-sharing embedding as a common embedding shared by all tasks, which is similar to the concept of the common metric in multi-task metric learning, while the second type enforces the information-sharing embedding as a consensus embedding on which all network-specific embeddings agree. Moreover, we propose two mechanisms for embedding the network structure, which are first-order proximity preserving and second-order proximity preserving. We demonstrate through comprehensive experiments on three real-world datasets that the proposed models outperform recent network embedding models in applications including visualization, link prediction, and multi-label classification.
引用
收藏
页码:183 / 198
页数:15
相关论文
共 21 条
[1]  
Armijo L(1966)Minimization of functions having Lipschitz continuous first partial derivatives Pac. J. Math. 16 1-3
[2]  
Bakker B(2003)Task clustering and gating for bayesian multitask learning J. Mach. Learn. Res. 4 83-99
[3]  
Heskes T(2001)Laplacian eigenmaps and spectral techniques for embedding and clustering NIPS 14 585-591
[4]  
Belkin M(2007)Greedy layer-wise training of deep networks Adv Neural Inf. Process. Syst. 19 153-574
[5]  
Niyogi P(2012)Assessing drug target association using semantic linked data PLoS Comput. Biol. 8 e1002-1031
[6]  
Bengio Y(2007)The link-prediction problem for social networks J. Assoc. Inf. Sci. Technol. 58 1019-2605
[7]  
Lamblin P(2008)Visualizing data using t-SNE J. Mach. Learn. Res. 9 2579-5
[8]  
Popovici D(2016)Meka: a multi-label/multi-target extension to weka J. Mach. Learn. Res. 17 1-494
[9]  
Larochelle H(2001)Convergence of a block coordinate descent method for nondifferentiable minimization J. Optim. Theory Appl. 109 475-undefined
[10]  
Chen B(undefined)undefined undefined undefined undefined-undefined