iBet uBet web content aggregator. Adding the entire web to your favor.
iBet uBet web content aggregator. Adding the entire web to your favor.



Link to original content: https://unpaywall.org/10.1007/978-3-319-94268-1_70
A Supervised Learning Approach to Link Prediction in Dynamic Networks | SpringerLink
Skip to main content

A Supervised Learning Approach to Link Prediction in Dynamic Networks

  • Conference paper
  • First Online:
Wireless Algorithms, Systems, and Applications (WASA 2018)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 10874))

Abstract

Link prediction, as one of fundamental problems in social network, has aroused the vast majority of research on it. However, most of existing methods have focused on the static networks, although there exist some machine learning methods for the dynamic networks, they regard either link structures or node attributes captured from a single snapshot of the network as the features, thus cannot achieve high accuracy. In this paper, following the supervised learning framework, we innovatively propose a new approach to this problem in dynamic networks. In particular, our features are captured from the variation of the structural properties and a lot of important metrics considering the long-term graph evolution of network, instead of a single snapshot. For each feature, we use an optimization algorithm to calculate the corresponding weight of each classifier, and then can determine whether there is a connection between a pair of nodes. In addition, we execute our method on two real-world dynamic networks, which indicate that our method works well and significantly outperforms the prior methods.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 109.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 139.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

Institutional subscriptions

Similar content being viewed by others

Notes

  1. 1.

    https://github.com/ustcxs/wasa/blob/master/SLM-Vp.pdf.

  2. 2.

    http://arxiv.org/archive/hep-th.

  3. 3.

    http://arxiv.org/archive/hep-lat.

References

  1. Adamic, L.A., Adar, E.: Friends and neighbors on the web. Soc. Netw. 25(3), 211–230 (2003)

    Article  Google Scholar 

  2. Akcora, C.G., Carminati, B., Ferrari, E.: User similarities on social networks. Soc. Netw. Anal. Min. 3(3), 475–495 (2013)

    Article  Google Scholar 

  3. Anderson, A., Huttenlocher, D.P., Kleinberg, J.M., Leskovec, J.: Effects of user similarity in social media. In: Proceedings of the Fifth International Conference on Web Search and Web Data Mining, pp. 703–712 (2012)

    Google Scholar 

  4. Bhattacharyya, P., Garg, A., Wu, S.F.: Analysis of user keyword similarity in online social networks. Soc. Netw. Anal. Min. 1(3), 143–158 (2011)

    Article  Google Scholar 

  5. Al Hasan, M., Chaoji, V., Salem, S., Zaki, M.: Link prediction using supervised learning. In: Proceedings of SDM 06 Workshop on Link Analysis, Counterterrorism and Security (2006)

    Google Scholar 

  6. Huang, S., Tang, Y., Tang, F., Li, J.: Link prediction based on time-varied weight in co-authorship network. In: Proceedings of the 18th International Conference on Computer Supported Cooperative Work in Design, pp. 706–709 (2014)

    Google Scholar 

  7. Liben-Nowell, D., Kleinberg, J.M.: The link-prediction problem for social networks. JASIST 58(7), 1019–1031 (2007)

    Article  Google Scholar 

  8. Newman, M.: Clustering and preferential attachment in growing networks. Phys. Rev. E - Stat. Nonlinear Soft Matter Phys. 64(2), 251021–251024 (2001)

    Google Scholar 

  9. Richard, E., Gaïffas, S., Vayatis, N.: Link prediction in graphs with autoregressive features. J. Mach. Learn. Res. 15(1), 565–593 (2014)

    MathSciNet  MATH  Google Scholar 

  10. Da Silva Soares, P.R., Prudncio, R.B.C.: Time series based link prediction. In: The 2012 International Joint Conference on Neural Networks, pp. 1–7 (2012)

    Google Scholar 

  11. Wang, D., Cui, P., Zhu, W.: Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, San Francisco, CA, USA, 13–17 August 2016, pp. 1225–1234 (2016)

    Google Scholar 

  12. Zhou, T., Lü, L., Zhang, Y.C.: Predicting missing links via local information. Eur. Phys. J. B 71(4), 623–630 (2009)

    Article  Google Scholar 

Download references

Acknowledgment

This work is partially supported by National Natural Science Foundation of China (NSFC) under Grant No. 61472460, No. 61772491, Natural Science Foundation of Jiangsu Province under Grant No. BK20161256. Kai Han is the corresponding author.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kai Han .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer International Publishing AG, part of Springer Nature

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Xu, S., Han, K., Xu, N. (2018). A Supervised Learning Approach to Link Prediction in Dynamic Networks. In: Chellappan, S., Cheng, W., Li, W. (eds) Wireless Algorithms, Systems, and Applications. WASA 2018. Lecture Notes in Computer Science(), vol 10874. Springer, Cham. https://doi.org/10.1007/978-3-319-94268-1_70

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-94268-1_70

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-94267-4

  • Online ISBN: 978-3-319-94268-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics