TY - JOUR
T1 - Gaussian mixture embedding of multiple node roles in networks
AU - Chen, Yujun
AU - Pu, Juhua
AU - Liu, Xingwu
AU - Zhang, Xiangliang
N1 - KAUST Repository Item: Exported on 2020-10-01
Acknowledged KAUST grant number(s): FCC/1/1976-19-01
Acknowledgements: This work was partially supported and funded by King Abdullah University of Science and Technology (KAUST), under award number FCC/1/1976-19-01, and NSFC No 61828302, the National Key Research and Development Program of China (2017YFB1002000), Science Technology and Innovation Commission of Shenzhen Municipality (JCYJ20180307123659504), and the State Key Laboratory of Software Development Environment in Beihang University.
PY - 2019/12/13
Y1 - 2019/12/13
N2 - Network embedding is a classical topic in network analysis. Current network embedding methods mostly focus on deterministic embedding, which maps each node as a low-dimensional vector. Thus, the network uncertainty and the possible multiple roles of nodes cannot be well expressed. In this paper, we propose to embed a single node as a mixture of Gaussian distribution in a low-dimensional space. Each Gaussian component corresponds to a latent role that the node plays. The proposed approach thus can characterize network nodes in a comprehensive representation, especially bridging nodes, which are relevant to different communities. Experiments on real-world network benchmarks demonstrate the effectiveness of our approach, outperforming the state-of-the-art network embedding methods. Also, we demonstrate that the number of components learned for each node is highly related to its topology features, such as node degree, centrality and clustering coefficient.
AB - Network embedding is a classical topic in network analysis. Current network embedding methods mostly focus on deterministic embedding, which maps each node as a low-dimensional vector. Thus, the network uncertainty and the possible multiple roles of nodes cannot be well expressed. In this paper, we propose to embed a single node as a mixture of Gaussian distribution in a low-dimensional space. Each Gaussian component corresponds to a latent role that the node plays. The proposed approach thus can characterize network nodes in a comprehensive representation, especially bridging nodes, which are relevant to different communities. Experiments on real-world network benchmarks demonstrate the effectiveness of our approach, outperforming the state-of-the-art network embedding methods. Also, we demonstrate that the number of components learned for each node is highly related to its topology features, such as node degree, centrality and clustering coefficient.
UR - http://hdl.handle.net/10754/660594
UR - http://link.springer.com/10.1007/s11280-019-00743-4
UR - http://www.scopus.com/inward/record.url?scp=85075804210&partnerID=8YFLogxK
U2 - 10.1007/s11280-019-00743-4
DO - 10.1007/s11280-019-00743-4
M3 - Article
SN - 1386-145X
JO - World Wide Web
JF - World Wide Web
ER -