Skip to main content

Dynamic Multi-relational Networks Integration and Extended Link Prediction Method

  • Conference paper
  • First Online:
Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques (IScIDE 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9243))

  • 2799 Accesses

Abstract

Link prediction is an effective method in complex networks analysis, not only in simple networks but also in dynamic multi-relational ones. How to integrate these multi-relational networks is of great importance to link prediction results. In this paper, we study the integration method of dynamic multi-relational networks and extend the link prediction method which estimates the likelihood of missing links and existent links disappearing in the future. Accordingly, we put forward an algorithm for building dynamic multi-relational weighted networks and an extended link prediction algorithm in integrated dynamic multi-relational networks, which is capable of predicting bi-directional links. We apply our method in a real multi-relational network. The experimental results show that our method can improve the link prediction performance in dynamic multi-relational networks.

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

Access this chapter

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

Institutional subscriptions

References

  1. Lü, L.Y., Zhou, T.: Link prediction in complex networks: a survey. Phys. A 390, 1150–1170 (2011)

    Article  Google Scholar 

  2. Tylenda, T., Angelova, R., Bedathur, S.: Towards time-aware link prediction in evolving social networks. In: Proceedings of the 3rd Workshop on Social Network Mining and Analysis, SNAKDD ACM, Paris, France, pp. 1–10 (2009)

    Google Scholar 

  3. Allali, O., Magnien, C., Latapy, M.: Link prediction in bipartite graphs using internal links and weighted projection. In: IEEE Conference on Computer Communications Workshops, pp. 93–941 (2011)

    Google Scholar 

  4. Huang, L.W., Li, D.Y.: A meta path-based link prediction model for heterogeneous information network. Chin. J. Comput. 37(4), 8–857 (2014)

    Google Scholar 

  5. Gallagher, B., Tong, H., Eliassi-Rad, T., Faloutsos, C.: Using ghost edges for classification in sparsely labeled networks. In: ACM SIGKDD, pp. 25–264 (2008)

    Google Scholar 

  6. Zhou, T., Ren, J., Medo, M.: Bipartite network projection and personal recommendation. Phys. Rev. E 76–115 (2007)

    Google Scholar 

  7. Zhou, T., Jiang, L.L., Su, R.Q.: Effect of initial configuration on network-based recommendation. Europhys. Lett. 8–85 (2008)

    Google Scholar 

  8. Naji, G., Nagi, M., ElSheikh, A.M., Gao, S., Kianmehr, K., Özyer, T., Rokne, J., Demetrick, D., Ridley, M., Alhajj, R.: Effectiveness of social networks for studying biological agents and identifying cancer biomarkers. In: Wiil, U.K. (ed.) Counterterrorism and Open Source Intelligence. LNCS, pp. 285–313. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  9. Guimera, R., Sales-Pardo, M.: Missing and spurious interactions and the reconstruction of complex networks. PNAS 106(52), 22073–22078 (2009)

    Article  Google Scholar 

  10. Kim, D.H., Noh, J.D., Jeong, H.: Scale-free trees: the skeletons of complex networks. Phys. Rev. E 70, 046126 (2004)

    Article  Google Scholar 

  11. An, Z., Giulio, C.: Removing spurious interactions in complex networks. Phys. Rev. E 85, 036101 (2012)

    Article  Google Scholar 

  12. Tang, L., Liu, H.: Community Detection and Mining in Social Media. Morgan & Claypool, San Rafael (2010)

    Google Scholar 

  13. Lacasa, L., Luque, B., Luque, J.: From time series to complex networks: the visibility graph. Proc. Nat. Acad. Sci. 105, 4972–4975 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  14. Luque, B., Lacasal, L.: Horizontal visibility graphs: exact result for random time series. Phys. Rev. E 80, 046103 (2009)

    Article  Google Scholar 

  15. Zhao, L.: Time series analysis based on complex network theory. J. Shanghai Univ. Sci. Technol. 33(1), 47–51 (2011)

    Google Scholar 

  16. Jolliffe, I.T.: Principal Component Analysis, p. 487. Springer, New York (1986). doi:10.1007/b98835

    Book  MATH  Google Scholar 

  17. Lü, L.Y., Zhou, T.: Link Prediction. Higher Education Press, Beijing (2013)

    Google Scholar 

Download references

Acknowledgments

Supported by National Natural Science Foundation under Grant (No.61373149, 61472233), Technology Program of Shandong Province under Grant (No. 2012GGX10118,2014GGX101026), Exquisite course project of Shandong Province under Grant (No. 2012BK294, 2013BK402), education research project of Shandong Province under Grant (No. ZK1437B010).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Hong Wang .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Wang, H., Sun, Y. (2015). Dynamic Multi-relational Networks Integration and Extended Link Prediction Method. In: He, X., et al. Intelligence Science and Big Data Engineering. Big Data and Machine Learning Techniques. IScIDE 2015. Lecture Notes in Computer Science(), vol 9243. Springer, Cham. https://doi.org/10.1007/978-3-319-23862-3_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23862-3_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23861-6

  • Online ISBN: 978-3-319-23862-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics