Skip to main content
Log in

Link prediction based on depth structure in social networks

  • Original Article
  • Published:
International Journal of Machine Learning and Cybernetics Aims and scope Submit manuscript

Abstract

Link prediction is an important task in social network analysis. Considering that the properties of nodes in social networks are generally inaccurate, it is more reliable and effective to use the network structure features to predict the links in the network. However, a central challenge of such methods is how to fully mine and utilize the network structure information. Here, we introduce a deep structure link prediction model (DSLP), whose idea is to integrate multiple types of community structures and multiple topology features into one probability model. We detect three types of community structures, disjoint, crisp overlap and fuzzy overlap, and then design an edge probability parameter to reflect their importance. Additionally, we propose an effective method to aggregate multiple topology features based on nodes and paths. We perform extensive experiments on artificial networks and real-world social networks to compare the proposed method with nine baseline algorithms, and the results show that our method offers higher precision than that of these well-known approaches. Finally, we discuss the method of integrating trusted node properties and feature selection.

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

Access this article

Subscribe and save

Springer+ Basic
EUR 32.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

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

Data availability

The data that support the findings of this study are available in Stanford Large Network Dataset Collection at http://snap.stanford.edu/data/, reference number [42]. These data were derived from the following resources available in the public domain: Epinions: http://snap.stanford.edu/data/soc-Epinions1.html; GrQc: http://snap.stanford.edu/data/ca-GrQc.html; FFI: http://snap.stanford.edu/data/comm-f2f-Resistance.html; Eu: http://snap.stanford.edu/data/email-Eu-core.html; LastFM: http://snap.stanford.edu/data/feather-lastfm-social.html; Facebook: http://snap.stanford.edu/data/ego-Facebook.html.

References

  1. Zhou T, Lü L, Zhang YC (2009) Predicting missing links via local information. Eur Phys J B. https://doi.org/10.1140/epjb/e2009-00335-8

    Article  Google Scholar 

  2. Lü L, Jin CH, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E Stat Nonlin Soft Matter Phys. https://doi.org/10.1103/PhysRevE.80.046122

    Article  Google Scholar 

  3. Sharma A, Aggarwal N, Khatter H, Saurabh, Tripathi A, and Awasthi S (2023) Comparative analysis of different algorithms in link prediction on social networks. In: 2023 International Conference on Artificial Intelligence and Smart Communication, AISC 2023. https://doi.org/10.1109/AISC56616.2023.10085359

  4. Daud NN, Ab Hamid SH, Saadoon M, Sahran F, Anuar NB (2020) Applications of link prediction in social networks: a review. J Netw Comput Appl. https://doi.org/10.1016/j.jnca.2020.102716

    Article  Google Scholar 

  5. Biswas A, Biswas B (2017) Community-based link prediction. Multimed Tools Appl. https://doi.org/10.1007/s11042-016-4270-9

    Article  Google Scholar 

  6. Ding J, Song J, Jiao L, Wu J, Liu F (2020) Multi-resolution prediction model based on community relevance for missing links prediction. IEEE Access. https://doi.org/10.1109/ACCESS.2020.3003822

    Article  Google Scholar 

  7. De A, Bhattacharya S, Sarkar S, Ganguly N, Chakrabarti S (2016) Discriminative link prediction using local, community, and global signals. IEEE Trans Knowl Data Eng. https://doi.org/10.1109/TKDE.2016.2553665

    Article  Google Scholar 

  8. Wu J, Zhang G, Ren Y (2017) A balanced modularity maximization link prediction model in social networks. Inf Process Manag. https://doi.org/10.1016/j.ipm.2016.10.001

    Article  Google Scholar 

  9. Kumari A, Behera RK, Sahoo B, Sahoo SP (2022) Prediction of link evolution using community detection in social network. Computing. https://doi.org/10.1007/s00607-021-01035-4

    Article  Google Scholar 

  10. Dimitriou P, Karyotis V (2023) A combinatory framework for link prediction in complex networks. Appl Sci (Switzerland). https://doi.org/10.3390/app13179685

    Article  Google Scholar 

  11. Gregory S (2011) Fuzzy overlapping communities in networks. J Stat Mech 2:2011. https://doi.org/10.1088/1742-5468/2011/02/P02017

    Article  Google Scholar 

  12. Song HH, Cho TW, Dave V, Zhang Y and Qiu L (2009) Scalable proximity estimation and link prediction in online social networks. In: Proceedings of the ACM SIGCOMM Internet Measurement Conference, IMC. https://doi.org/10.1145/1644893.1644932

  13. Hasan M and A M (2005) Link prediction using supervised learning. proc of SDM workshop on link analysis counterterrorism & security. https://doi.org/10.1016/j.proeng.2012.01.930

  14. Haghani S, Keyvanpour MR (2019) A systemic analysis of link prediction in social network. Artif Intell Rev. https://doi.org/10.1007/s10462-017-9590-2

    Article  Google Scholar 

  15. Wang G, Li H, Pu J, Wu J, Wang H (2022) A novel link prediction method integrated link attributes for directed graph. Int J Mod Phys B. https://doi.org/10.1142/S0217979222501132

    Article  Google Scholar 

  16. Muro C, Li B, He K (2023) Link prediction and unlink prediction on dynamic networks. IEEE Trans Comput Soc Syst. https://doi.org/10.1109/TCSS.2022.3162229

    Article  Google Scholar 

  17. Liu M, Guo J, Chen J, Zhang Y (2021) Similarity-based common neighbor and sign influence model for link prediction in signed social networks. Human-centric Comput Inf Sci. https://doi.org/10.22967/HCIS.2021.11.044

    Article  Google Scholar 

  18. Jaccard P (1912) The distribution of the flora in the alpine zone. New Phytol. https://doi.org/10.1111/j.1469-8137.1912.tb05611.x

    Article  Google Scholar 

  19. Dillon M (1983) Introduction to modern information retrieval. Inf Process Manag. https://doi.org/10.1016/0306-4573(83)90062-6

    Article  Google Scholar 

  20. Barabási AL, Albert R (1979) Emergence of scaling in random networks. Science 286(5439):1999. https://doi.org/10.1126/science.286.5439.509

    Article  MathSciNet  Google Scholar 

  21. Češka A (1966) A method of establishing groups of equal amplitude in plant sociology based on similarity of species and its application to analyses of the vegetation on Danish commons. Folia Geobotanica et Phytotaxonomica. https://doi.org/10.1007/BF02989086

    Article  Google Scholar 

  22. Ravasz E, Somera AL, Mongru DA, Oltvai ZN, Barabási AL (1979) Hierarchical organization of modularity in metabolic networks. Science 297(5586):2002. https://doi.org/10.1126/science.1073374

    Article  Google Scholar 

  23. Chen HH, Gou L, Zhang X, Giles CL (2012) Discovering missing links in networks using vertex similarity measures. Proc ACM Sympos Appl Comput. https://doi.org/10.1145/2245276.2245305

    Article  Google Scholar 

  24. Cannistraci CV, Alanis-Lobato G, Ravasi T (2013) From link-prediction in brain connectomes and protein interactomes to the local-community-paradigm in complex networks. Sci Rep. https://doi.org/10.1038/srep01613

    Article  Google Scholar 

  25. Adamic LA, Adar E (2003) Friends and neighbors on the Web. Soc Netw. https://doi.org/10.1016/S0378-8733(03)00009-1

    Article  Google Scholar 

  26. Katz L (1953) A new status index derived from sociometric analysis. Psychometrika. https://doi.org/10.1007/BF02289026

    Article  Google Scholar 

  27. Liu W, Lü L (2010) Link prediction based on local random walk. EPL. https://doi.org/10.1209/0295-5075/89/58007

    Article  Google Scholar 

  28. Klein DJ, Randić M (1993) Resistance distance. J Math Chem. https://doi.org/10.1007/BF01164627

    Article  MathSciNet  Google Scholar 

  29. Jeh G and Widom J (2002) SimRank: a measure of structural-context similarity. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

  30. Lv H, Zhang B, Hu S, Xu Z (2022) Deep link-prediction based on the local structure of bipartite networks. Entropy. https://doi.org/10.3390/e24050610

    Article  MathSciNet  Google Scholar 

  31. Li J, Peng X, Wang J, Zhao N (2021) A method for improving the accuracy of link prediction algorithms. Complexity. https://doi.org/10.1155/2021/8889441

    Article  Google Scholar 

  32. Yan B, Gregory S (2012) Finding missing edges in networks based on their community structure. Phys Rev E Stat Nonlin Soft Matter Phys. https://doi.org/10.1103/PhysRevE.85.056112

    Article  Google Scholar 

  33. Soundarajan S and Hopcroft J (2012) Using community information to improve the precision of link prediction methods. In: WWW’12 - Proceedings of the 21st Annual Conference on World Wide Web Companion. https://doi.org/10.1145/2187980.2188150

  34. Xu L, Wei X, Cao J, Yu PS (2018) On learning community-specific similarity metrics for cold-start link prediction. Proc Int Joint Conf Neural Netw. https://doi.org/10.1109/IJCNN.2018.8489683

    Article  Google Scholar 

  35. Aliakbarisani R, Ghasemi A, Angeles Serrano M (2022) Perturbation of the normalized Laplacian matrix for the prediction of missing links in real networks. IEEE Trans Netw Sci Eng. https://doi.org/10.1109/TNSE.2021.3137862

    Article  MathSciNet  Google Scholar 

  36. Blondel VD, Guillaume JL, Lambiotte R, Lefebvre E (2008) Fast unfolding of communities in large networks. J Stat Mech. https://doi.org/10.1088/1742-5468/2008/10/P10008

    Article  Google Scholar 

  37. Xu XK, Shang KK, Xiao J (2020) Quantifying the effect of community structures for link prediction by constructing null models. IEEE Access. https://doi.org/10.1109/ACCESS.2020.2993455

    Article  Google Scholar 

  38. Lázár A, Ábel D, Vicsek T (2010) Modularity measure of networks with overlapping communities. EPL. https://doi.org/10.1209/0295-5075/90/18001

    Article  Google Scholar 

  39. Jokar E, Mosleh M, Kheyrandish M (2022) Overlapping community detection in complex networks using fuzzy theory, balanced link density, and label propagation. Expert Syst. https://doi.org/10.1111/exsy.12921

    Article  Google Scholar 

  40. Nepusz T, Petróczi A, Négyessy L, Bazsó F (2008) Fuzzy communities and the concept of bridgeness in complex networks. Phys Rev E Stat Nonlin Soft Matter Phys. https://doi.org/10.1103/PhysRevE.77.016107

    Article  MathSciNet  Google Scholar 

  41. Newman MEJ (2012) Communities, modules and large-scale structure in networks. Nat Phys. https://doi.org/10.1038/nphys2162

    Article  Google Scholar 

  42. McAuley J, Leskovec J (2014) Discovering social circles in ego networks. ACM Trans Knowl Discov Data. https://doi.org/10.1145/2556612

    Article  Google Scholar 

  43. Duchi J, Hazan E and Singer Y (2011) Adaptive subgradient methods for online learning and stochastic optimization. J Mach Learn Res 12:257–269

    MathSciNet  Google Scholar 

  44. Tieleman G, Hinton T (2012) Divide the gradient by a running average of its recent magnitude. Human Mach Hearing 4(2):26–31

    Google Scholar 

  45. Kingma DP and Ba JL (2015) Adam: a method for stochastic optimization. In: 3rd International Conference on Learning Representations, ICLR 2015 - Conference Track Proceedings

  46. Rai AK, Tripathi SP, Yadav RK (2023) A novel similarity-based parameterized method for link prediction. Chaos Solit Fractals. https://doi.org/10.1016/j.chaos.2023.114046

    Article  Google Scholar 

  47. Hanley JA, McNeil BJ (1982) The meaning and use of the area under a receiver operating characteristic (ROC) curve. Radiology. https://doi.org/10.1148/radiology.143.1.7063747

    Article  Google Scholar 

  48. Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E Stat Nonlin Soft Matter Phys. https://doi.org/10.1103/PhysRevE.78.046110

    Article  Google Scholar 

  49. Leskovec J (2010) Stanford large network dataset collection. http://snap.stanford.edu/data/

  50. Brunato M and Battiti R (2016) X-MIFS: Exact Mutual Information for feature selection. In: Proceedings of the International Joint Conference on Neural Networkshttps://doi.org/10.1109/IJCNN.2016.7727644

  51. Tran CT, Zhang M, Andreae P and Xue B (2016) A wrapper feature selection approach to classification with missing data. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).https://doi.org/10.1007/978-3-319-31204-0_44

  52. Badiy M, Amounas F (2023) Embedding-based method for the supervised link prediction in social networks. Int J Recent Innov Trends Comput Commun. https://doi.org/10.17762/ijritcc.v11i3.6327

    Article  Google Scholar 

  53. Gong NZ et al (2014) Joint link prediction and attribute inference using a social-attribute network. ACM Trans Intell Syst Technol. https://doi.org/10.1145/2594455

    Article  Google Scholar 

  54. Caiyan D, Chen L, Li B (2017) Link prediction in complex network based on modularity. Soft Comput. https://doi.org/10.1007/s00500-016-2030-4

    Article  Google Scholar 

  55. Wu D, Zhang J, Zhang J, Shi H (2022) A novel deep link prediction model for peer-to-peer dynamic task collaboration networks. Peer Peer Netw Appl 15(4):1775–1791. https://doi.org/10.1007/S12083-022-01324-5

    Article  Google Scholar 

Download references

Acknowledgements

This research is supported by the innovative talents project for doctoral students of Chongqing University of Posts and Telecommunications (BYJS201813).

Author information

Authors and Affiliations

Authors

Contributions

Jie yang: formal analysis, data curation, validation, writing—review and editing. Yu Wu: conceptualization, methodology, resources, supervision.

Corresponding author

Correspondence to Yu Wu.

Ethics declarations

Ethical approval and informed consent

The work described in the article has not been published previously, that it is not under consideration for publication elsewhere, that its publication is approved by all authors and tacitly or explicitly by the responsible authorities where the work was carried out, and that, if accepted, it will not be published elsewhere in the same form, in English or any other language, without the written consent of the Publisher.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Yang, J., Wu, Y. Link prediction based on depth structure in social networks. Int. J. Mach. Learn. & Cyber. (2024). https://doi.org/10.1007/s13042-024-02178-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s13042-024-02178-4

Keywords

Navigation