Joint embedding of structure and features via graph convolutional networks

被引:0
作者
Sébastien Lerique
Jacob Levy Abitbol
Márton Karsai
机构
[1] Univ Lyon,
[2] ENS de Lyon,undefined
[3] Inria,undefined
[4] CNRS,undefined
[5] UCB Lyon 1,undefined
[6] LIP UMR 5668,undefined
[7] IXXI,undefined
[8] Department of Network and Data Science,undefined
[9] Central European University,undefined
来源
Applied Network Science | / 5卷
关键词
Network embedding; Attributed networks; Graph; Convolutional networks; Autoencoders; Feature-network dependency;
D O I
暂无
中图分类号
学科分类号
摘要
The creation of social ties is largely determined by the entangled effects of people’s similarities in terms of individual characters and friends. However, feature and structural characters of people usually appear to be correlated, making it difficult to determine which has greater responsibility in the formation of the emergent network structure. We propose AN2VEC, a node embedding method which ultimately aims at disentangling the information shared by the structure of a network and the features of its nodes. Building on the recent developments of Graph Convolutional Networks (GCN), we develop a multitask GCN Variational Autoencoder where different dimensions of the generated embeddings can be dedicated to encoding feature information, network structure, and shared feature-network information. We explore the interaction between these disentangled characters by comparing the embedding reconstruction performance to a baseline case where no shared information is extracted. We use synthetic datasets with different levels of interdependency between feature and network characters and show (i) that shallow embeddings relying on shared information perform better than the corresponding reference with unshared information, (ii) that this performance gap increases with the correlation between network and feature structure, and (iii) that our embedding is able to capture joint information of structure and features. Our method can be relevant for the analysis and prediction of any featured network structure ranging from online social systems to network medicine.
引用
收藏
相关论文
共 79 条
[1]  
Aral S(2009)Distinguishing influence-based contagion from homophily-driven diffusion in dynamic networks Proc Natl Acad Sci 106 21544-21549
[2]  
Muchnik L(2017)Geometric deep learning: Going beyond euclidean data IEEE Signal Proc Mag 34 18-42
[3]  
Sundararajan A(2018)A comprehensive survey of graph embedding: Problems, techniques, and applications IEEE Trans Knowl Data Eng 30 1616-1637
[4]  
Bronstein M(2010)Community detection in graphs Phys Rep 486 75-174
[5]  
Bruna J(2016)Community detection in networks: A user guide Phys Rep 659 1-44
[6]  
LeCun Y(2009)The speech community Linguist Anthropol A Read 1 66-137
[7]  
Szlam A(1983)Stochastic blockmodels: First steps Soc Netw 5 109-666
[8]  
Vandergheynst P(2018)Flux: Elegant machine learning with Julia Journal of Open Source Software 3 602-90
[9]  
Cai H(2010)Data clustering: 50 years beyond k-means Pattern Recog Lett 31 651-450
[10]  
Zheng VW(2006)Empirical analysis of an evolving social network Science 311 88-1031