Skip to main content

Predictive Representation Learning in Motif-Based Graph Networks

Part of the Lecture Notes in Computer Science book series (LNAI,volume 11919)


Link prediction is an important task for analyzing social networks which also has other applications such as bioinformatics and e-commerce. Network representation learning (NRL), which can significantly enhance the performance for link prediction, has attracted much attention in recent years. However, the existing NRL methods mainly focus on observed network structures without considering hidden prediction knowledge in the representation space. Meanwhile, some random walk based NRL methods are dissatisfactory to learn link knowledge in dense networks with large scales. In this paper, we propose a predictive representation learning (PRL) model, which unifies node representations and motif-based structures, to improve prediction ability of NRL. We firstly enhance node representations based on motif-biased random walks and then employ L2-SVM to learn motif-connected node-pairs. By jointly optimizing two objectives of existent and nonexistent edges representations, we preserve more information of nodes in representation space based on supervised learning. To evaluate the performance of our proposed model, we implement experiments on 5 real data sets. Simulation results illustrate that our proposed model achieves better link prediction performance compared with other state-of-the-arts methods.


  • Link prediction
  • Network representation learning
  • Network motifs

This is a preview of subscription content, access via your institution.

Buying options

USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions


  1. Ahmed, N.K., Rossi, R.A., Willke, T.L., Zhou, R.: Edge role discovery via higher-order structures. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10234, pp. 291–303. Springer, Cham (2017).

    CrossRef  Google Scholar 

  2. Benson, A.R., Gleich, D.F., Leskovec, J.: Higher-order organization of complex networks. Science 353(6295), 163–166 (2016)

    CrossRef  Google Scholar 

  3. Cai, H., Zheng, V.W., Chang, K.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616–1637 (2018)

    CrossRef  Google Scholar 

  4. Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 27 (2011)

    CrossRef  Google Scholar 

  5. Grover, A., Leskovec, J.: node2vec: scalable feature learning for networks. In: SIGKDD, pp. 855–864. ACM (2016)

    Google Scholar 

  6. Liben-Nowell, D., Kleinberg, J.: The link-prediction problem for social networks. J. Am. Soc. Inform. Sci. Technol. 58(7), 1019–1031 (2007)

    CrossRef  Google Scholar 

  7. Liu, J., et al.: Artificial intelligence in the 21st century. IEEE Access 6(1), 34403–34421 (2018)

    CrossRef  Google Scholar 

  8. Mao, J., et al.: Understanding and predicting usefulness judgment in web search. In: SIGIR, pp. 1169–1172. ACM (2017)

    Google Scholar 

  9. Mikolov, T., Sutskever, I., Chen, K., Corrado, G.S., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS, pp. 3111–3119 (2013)

    Google Scholar 

  10. Milo, R., Shen-Orr, S., Itzkovitz, S., Kashtan, N., Chklovskii, D., Alon, U.: Network motifs: simple building blocks of complex networks. Science 298(5594), 824–827 (2002)

    CrossRef  Google Scholar 

  11. Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: SIGKDD, pp. 701–710. ACM (2014)

    Google Scholar 

  12. Rossi, R., Ahmed, N.: The network data repository with interactive graph analytics and visualization. In: AAAI, vol. 15, pp. 4292–4293 (2015)

    Google Scholar 

  13. Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: WWW, pp. 1067–1077. International World Wide Web Conferences Steering Committee (2015)

    Google Scholar 

  14. Vaswani, A., et al.: Attention is all you need. In: NIPS, pp. 5998–6008 (2017)

    Google Scholar 

  15. Wan, L., Yuan, Y., Xia, F., Liu, H.: To your surprise: identifying serendipitous collaborators. IEEE Trans. Big Data (2019).

    CrossRef  Google Scholar 

  16. Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: SIGKDD, pp. 1225–1234. ACM (2016)

    Google Scholar 

  17. Xu, B., Li, L., Liu, J., Wan, L., Kong, X., Xia, F.: Disappearing link prediction in scientific collaboration networks. IEEE Access 6, 69702–69712 (2018)

    CrossRef  Google Scholar 

  18. Yuan, Y., Xun, G., Suo, Q., Jia, K., Zhang, A.: Wave2vec: deep representation learning for clinical temporal data. Neurocomputing 324, 31–42 (2019)

    CrossRef  Google Scholar 

Download references

Author information

Authors and Affiliations


Corresponding author

Correspondence to Liangtian Wan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Zhang, K., Yu, S., Wan, L., Li, J., Xia, F. (2019). Predictive Representation Learning in Motif-Based Graph Networks. In: Liu, J., Bailey, J. (eds) AI 2019: Advances in Artificial Intelligence. AI 2019. Lecture Notes in Computer Science(), vol 11919. Springer, Cham.

Download citation

  • DOI:

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-35287-5

  • Online ISBN: 978-3-030-35288-2

  • eBook Packages: Computer ScienceComputer Science (R0)