Skip to main content

Evolution Similarity for Dynamic Link Prediction in Longitudinal Networks

  • Conference paper
  • First Online:

Part of the book series: Springer Proceedings in Complexity ((SPCOM))

Abstract

Link prediction problem in network science has spawned not only over myriad applications but also experienced extensive methodological improvements. Different link prediction methods perform feature engineering to build different topological or nodal attribute based metrics measuring the similarity/proximity between non-connected actor pairs to deal with the inference of future associations among them. On the contrary, dynamic link prediction methods have catered the evolutionary process and network dynamics of longitudinal networks. Evolution similarity between node pairs (e.g., similarity between rates of acquiring neighbours by actor pairs over time) can be considered to generate dynamic metrics for the purpose of dynamic link prediction in longitudinal networks. In this study, we attempt to build dynamic similarity metrics by considering the similarity between temporal evolutions of non-connected actor pairs. For this purpose, this study utilises time series forecasting methods to model the temporal evolution of actors’ network positions/importance and then it utilizes a dynamic programming method to determine the similarity between these evolutions of actor pairs to quantify the likelihood of future associations among them. Supervised link prediction models exploiting these dynamic similarity metrics were built and performances were compared against some baseline static metrics (i.e., common neighbours). High performance scores achieved by these features, examined in this study, represent them as prospective candidates not only for dynamic link prediction task but also in various applications like security and recommender systems.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   109.99
Price excludes VAT (USA)
  • Durable hardcover 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

References

  1. Opsahl, T., Hogan, B.: Growth mechanisms in continuously-observed networks: Communication in a facebook-like community. arXiv:10102141 (2011)

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

    Google Scholar 

  3. Soares PRdS, Prudêncio RBC Time series based link prediction. In: The 2012 International Joint Conference on Neural Networks (IJCNN), pp. 1–7. IEEE (2012)

    Google Scholar 

  4. Pujari, M., Kanawati, R.: Supervised rank aggregation approach for link prediction in complex networks. In: Proceedings of the 21st International Conference on World Wide Web, pp 1189–1196. ACM (2012)

    Google Scholar 

  5. Hanneke, S., Fu, W., Xing, E.P.: Discrete temporal models of social networks. Electron. J. Stat. 4, 585–605 (2010)

    Article  ADS  MathSciNet  MATH  Google Scholar 

  6. Ibrahim, N.M.A., Chen, L.: Link prediction in dynamic social networks by integrating different types of information. Appl. Intell. 42(4), 738–750 (2015)

    Article  Google Scholar 

  7. Hyndman, R.J., Athanasopoulos, G.: Forecasting: principles and practice. OTexts (2014)

    Google Scholar 

  8. Müller, M.: Dynamic Time Warping. Information Retrieval for Music and Motion. Springer, Berlin Heidelberg (2007)

    Google Scholar 

  9. Vintsyuk, T.K.: Speech discrimination by dynamic programming. Cybern. Syst. Anal. 4(1), 52–57 (1968)

    Article  MathSciNet  Google Scholar 

  10. Uddin, S., Khan, A., Piraveenan, M.: A set of measures to quantify the dynamicity of longitudinal social networks. Complexity 21(6), 309–320 (2016)

    Article  MathSciNet  Google Scholar 

  11. Choudhury, N., Uddin, S.: Time-aware link prediction to explore network effects on temporal knowledge evolution. Scientometrics 108(2), 745–776 (2016)

    Article  Google Scholar 

  12. Rossi, R.A., Ahmed, N.K.: Networkrepository: a graph data repository with visual interactive analytics. In: 29th AAAI Conference on Artificial Intelligence, Austin, Texas, USA, 25-30 January 2015. Association for the Advancement of Artificial Intelligence, pp. 4292–4293

    Google Scholar 

  13. Newman, M.: Clustering and preferential attachment in growing networks. Phys. Rev. E 64(2), 25102 (2001)

    Article  ADS  Google Scholar 

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

    Article  Google Scholar 

  15. Boyd, K., Costa, V.S., Davis, J., Page, C.D.: Unachievable region in precision-recall space and its effect on empirical evaluation. In: Machine Learning: Proceedings of the International Conference. International Conference on Machine Learning, p. 349. NIH Public Access (2012)

    Google Scholar 

  16. Xu, H.H., Zhang, L.J.: Application of link prediction in temporal networks. In: Advanced Materials Research, pp 2231–2236. Trans Tech Publication (2013)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nazim Choudhury .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Choudhury, N., Uddin, S. (2017). Evolution Similarity for Dynamic Link Prediction in Longitudinal Networks. In: Gonçalves, B., Menezes, R., Sinatra, R., Zlatic, V. (eds) Complex Networks VIII. CompleNet 2017. Springer Proceedings in Complexity. Springer, Cham. https://doi.org/10.1007/978-3-319-54241-6_9

Download citation

Publish with us

Policies and ethics