Large-Scale Network Representation Learning Based on Improved Louvain Algorithm and Deep Autoencoder

In recent years, feature learning of nodes in network has become a research hot spot. However, with the growth of the network scale, network structure has become more and more complicated, which makes it extremely difficult for network representation learning in large and complex networks. This paper proposes a fast large-scale network representation learning method based on improved Louvain algorithm and deep autoencoder. First, it quickly folds large and complex network into corresponding small network kernel through effective improved Louvain strategy. Then based on network kernel, a deep autoencoder method is conducted to represent nodes in kernel. Finally, the representations of the original network nodes are obtained by a coarse-to-refining procedure. Extensive experiments show that the proposed method perform well on large and complex real networks and its performance is better than most network representation learning methods.

[1]  Xiaoqian You,et al.  Community Discovery Research Based on Louvain Algorithm , 2018 .

[2]  Nitesh V. Chawla,et al.  metapath2vec: Scalable Representation Learning for Heterogeneous Networks , 2017, KDD.

[3]  Tony Jebara,et al.  Structure preserving embedding , 2009, ICML '09.

[4]  Bruce Hendrickson,et al.  A Multi-Level Algorithm For Partitioning Graphs , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[5]  Jeffrey Dean,et al.  Distributed Representations of Words and Phrases and their Compositionality , 2013, NIPS.

[6]  Qiongkai Xu,et al.  GraRep: Learning Graph Representations with Global Structural Information , 2015, CIKM.

[7]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[8]  Mingzhe Wang,et al.  LINE: Large-scale Information Network Embedding , 2015, WWW.

[9]  Zhiyuan Liu,et al.  Fast Network Embedding Enhancement via High Order Proximity Approximation , 2017, IJCAI.

[10]  T. Vicsek,et al.  Uncovering the overlapping community structure of complex networks in nature and society , 2005, Nature.

[11]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[12]  Jeffrey Dean,et al.  Efficient Estimation of Word Representations in Vector Space , 2013, ICLR.

[13]  Ying Xie,et al.  High-performance community detection in social networks using a deep transitive autoencoder , 2019, Inf. Sci..

[14]  Jure Leskovec,et al.  node2vec: Scalable Feature Learning for Networks , 2016, KDD.

[15]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[16]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[17]  Geoffrey Zweig,et al.  Linguistic Regularities in Continuous Space Word Representations , 2013, NAACL.

[18]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[19]  Huan Liu,et al.  A Social Identity Approach to Identify Familiar Strangers in a Social Network , 2009, ICWSM.

[20]  Kara Dolinski,et al.  The BioGRID Interaction Database: 2011 update , 2010, Nucleic Acids Res..

[21]  Jian Li,et al.  Network Embedding as Matrix Factorization: Unifying DeepWalk, LINE, PTE, and node2vec , 2017, WSDM.

[22]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[23]  Huan Liu,et al.  Relational learning via latent social dimensions , 2009, KDD.