Advertisement

MSNE: A Novel Markov Chain Sampling Strategy for Network Embedding

  • Ran Wang
  • Yang Song
  • Xin-yu DaiEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11441)

Abstract

Network embedding methods have obtained great progresses on many tasks, such as node classification and link prediction. Sampling strategy is very important in network embedding. It is still a challenge for sampling in a network with complicated topology structure. In this paper, we propose a high-order Markov chain Sampling strategy for Network Embedding (MSNE). MSNE selects the next sampled node based on a distance metric between nodes. Due to high-order sampling, it can exploit the whole sampled path to capture network properties and generate expressive node sequences which are beneficial for downstream tasks. We conduct the experiments on several benchmark datasets. The results show that our model can achieve substantial improvements in two tasks of node classification and link prediction. (Datasets and code are available at https://github.com/SongY123/MSNE.)

Keywords

Network embedding Random walk Sampling strategy 

References

  1. 1.
    Breitkreutz, B.-J., et al.: The BioGRID interaction database: 2008 update. Nucleic Acids Res 36(Database–Issue), 637–640 (2008)Google Scholar
  2. 2.
    Ferrer, R.I.C., Solé, R.V.: The small world of human language. Proc. Royal Soc. Lond. B Biol. Sci. 268(1482), 2261–2265 (2001)CrossRefGoogle Scholar
  3. 3.
    Cao, S., Lu, W., Xu, Q.: GraRep: learning graph representations with global structural information. In: Proceedings of the 24th ACM CIKM International Conference on Information and Knowledge Management, pp. 891–900 (2015)Google Scholar
  4. 4.
    Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017).  https://doi.org/10.1007/978-3-662-53622-3CrossRefzbMATHGoogle Scholar
  5. 5.
    Dong, Y., Chawla, N.V., Swami, A.: metapath2vec: scalable representation learning for heterogeneous networks. In: Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 135–144 (2017)Google Scholar
  6. 6.
    Fouss, F., Pirotte, A., Renders, J.-M., Saerens, M.: Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans. Knowl. Data Eng. 19(3), 355–369 (2007)CrossRefGoogle Scholar
  7. 7.
    Linton, C.: Freeman, visualizing social networks. J. Soc. Struct. 1, (2000)Google Scholar
  8. 8.
    Golub, G.H., Reinsch, C.: Singular value decomposition and least squares solutions. Numer. Math. 14(5), 403–420 (1970)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 855–864 (2016)Google Scholar
  10. 10.
    Huang, Z., Mamoulis, N.: Heterogeneous information network embedding for meta path based proximity, CoRR abs/1701.05291 (2017)Google Scholar
  11. 11.
    McCallum, A., Nigam, K., Rennie, J., Seymore, K.: Automating the construction of internet portals with machine learning. Inf. Retr. 3(2), 127–163 (2000)CrossRefGoogle Scholar
  12. 12.
    Mikolov, T., Chen, K., Corrado, G., Dean, J.: Efficient estimation of word representations in vector space, CoRR abs/1301.3781 (2013)Google Scholar
  13. 13.
    Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: Advances in Neural Information Processing Systems, pp. 3111–3119 (2013)Google Scholar
  14. 14.
    Newman, M.E.J.: A measure of betweenness centrality based on random walks. Soc. Netw. 27(1), 39–54 (2005)CrossRefGoogle Scholar
  15. 15.
    Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: 20th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 701–710 (2014)Google Scholar
  16. 16.
    Perozzi, B., Kulkarni, V., Skiena, S.: Walklets: multiscale graph embeddings for interpretable network classification, CoRR abs/1605.02115 (2016)Google Scholar
  17. 17.
    Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: LINE: large-scale information network embedding. In: Proceedings of the 24th International Conference on World Wide Web, pp. 1067–1077 (2015)Google Scholar
  18. 18.
    Tang, L., Liu, H.: Relational learning via latent social dimensions. In: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 817–826 (2009)Google Scholar
  19. 19.
    Theocharidis, A., Van Dongen, S., Enright, A.J., Freeman, T.C.: Network visualization and analysis of gene expression data using BioLayout express(3d). Nat. Protoc. 4(10), 1535–1550 (2009)CrossRefGoogle Scholar
  20. 20.
    Tu, C., Zhang, W., Liu, Z., Sun, M.: Max-margin deepwalk: discriminative learning of network representation. In: Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, pp. 3889–3895 (2016)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.National Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingChina

Personalised recommendations