Skip to main content
SpringerLink
Log in

A modified DeepWalk method for link prediction in attributed social network

  • Regular Paper
  • Published:
Computing Aims and scope Submit manuscript

Abstract

The increasing growth of online social networks has drawn researchers' attention to link prediction and has been adopted in many fields, including computer sciences, information science, and anthropology. The link prediction in attributed networks is a new challenge in this field, one of the interesting topics in recent years. Nodes are also accompanied in many real-world systems by various attributes or features, known as attributed networks. One of the newest methods of link prediction is embedding methods to generate the feature vector of each node of the graph and find unknown connections. The DeepWalk algorithm is one of the most popular graph embedding methods that capture the network structure using pure random walking. The present paper seeks to present a modified version of deep walk based on pure random walking for solving link prediction in the attributed network, which will be used for both network structure and node attributes, and the new random walk model for link prediction will be introduced by integrating network structure and node attributes, based on the assumption that two nodes on the network will be linked since they are nearby in the network, or connected for the reason of similar attributes. The results indicate that two nodes are more probable to establish a link in the case of possessing more structure and attribute similarity. In order to justify the proposal, the authors carry out many experiments on six real-world attributed networks for comparison with the state-of-the-art network embedding methods. The experimental results from the graphs indicate that our proposed approach is more capable compared to other link prediction approaches and increases the accuracy of prediction.

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

Access this article

Log in via an institution

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

Similar content being viewed by others

Notes

  1. https://linqs.soe.ucsc.edu/data.

  2. http://www.cs.cmu.edu/~webkb/.

  3. http://www.blogcatalog.com.

References

  1. Berahmand K, Bouyer A, Vasighi M (2018) Community detection in complex networks by detecting and expanding core nodes through extended local similarity of nodes. IEEE Trans Comput Soc Syst 5(4):1021–1033

    Article  Google Scholar 

  2. Berahmand K, Bouyer A (2018) LP-LPA: A link influence-based label propagation algorithm for discovering community structures in networks. Int J Mod Phys B 32(06):1850062

    Article  Google Scholar 

  3. Berahmand K, Bouyer A, Samadi N (2018) A new centrality measure based on the negative and positive effects of clustering coefficient for identifying influential spreaders in complex networks. Chaos Solitons Fractals 110:41–54

    Article  MATH  Google Scholar 

  4. Berahmand K, Bouyer A, Samadi N (2019) A new local and multidimensional ranking measure to detect spreaders in social networks. Computing 101(11):1711–1733

    Article  MathSciNet  MATH  Google Scholar 

  5. Berahmand K, Samadi N, Sheikholeslami SM (2018) Effect of rich-club on diffusion in complex networks. Int J Mod Phys B 32(12):1850142

    Article  Google Scholar 

  6. Nasiri E, Bouyer A, Nourani E (2019) A node representation learning approach for link prediction in social networks using game theory and K-core decomposition. Eur Phys J B 92(10):228

    Article  Google Scholar 

  7. Gallagher B et al (2008) Using ghost edges for classification in sparsely labeled networks. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining

  8. Huang Z, Zeng DD (2006) A link prediction approach to anomalous email detection. In: 2006 IEEE International conference on systems, man and cybernetics. IEEE

  9. Lei C, Ruan J (2013) A novel link prediction algorithm for reconstructing protein–protein interaction networks by topological similarity. Bioinformatics 29(3):355–364

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  11. Folino F, Pizzuti C (2012) Link prediction approaches for disease networks. In: International conference on information technology in bio-and medical informatics. Springer

  12. Kaya B (2020) A hotel recommendation system based on customer location: a link prediction approach. Multimed Tools Appl 79(3):1745–1758

    Article  Google Scholar 

  13. Dhannuri SP et al (2019) Privacy control in social networks by trust aware link prediction. In: 2019 6th International conference on electrical engineering, computer science and informatics (EECSI). IEEE

  14. Zhang Q-M, Shang M-S, Lü L (2010) Similarity-based classification in partially labeled networks. Int J Mod Phys C 21(06):813–824

    Article  MATH  Google Scholar 

  15. Pavlov M, Ichise R (2007) Finding experts by link prediction in co-authorship networks. FEWS 290:42–55

    Google Scholar 

  16. Jin EM, Girvan M, Newman ME (2001) Structure of growing social networks. Phys Rev E 64(4):046132

    Article  Google Scholar 

  17. Biswas A, Biswas B (2017) Community-based link prediction. Multimed Tools Appl 76(18):18619–18639

    Article  Google Scholar 

  18. Kumar A et al (2020) Link prediction techniques, applications, and performance: a survey. Phys A Stat Mech Appl 553:124289

    Article  MathSciNet  Google Scholar 

  19. Cai H, Zheng VW, Chang KC-C (2018) A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans Knowl Data Eng 30(9):1616–1637

    Article  Google Scholar 

  20. Goyal P, Ferrara E (2018) Graph embedding techniques, applications, and performance: a survey. Knowl Based Syst 151:78–94

    Article  Google Scholar 

  21. Forouzandeh S, Berahmand K, Rostami M (2020) Presentation of a recommender system with ensemble learning and graph embedding: a case on MovieLens. Multimed Tools Appl 80:1–28

    Google Scholar 

  22. Berahmand K et al (2020) A new attributed graph clustering by using label propagation in complex networks. J King Saud Univ Comput Inf Sci. https://doi.org/10.1016/j.jksuci.2020.08.013

    Article  Google Scholar 

  23. Aiello LM et al (2012) Friendship prediction and homophily in social media. ACM Trans Web (TWEB) 6(2):9

    Google Scholar 

  24. Mikolov T et al (2013) Efficient estimation of word representations in vector space. arXiv preprint arXiv:1301.3781

  25. Wang P et al (2015) Link prediction in social networks: the state-of-the-art. Science China Inf Sci 58(1):1–38

    Google Scholar 

  26. Martínez V, Berzal F, Cubero J-C (2016) A survey of link prediction in complex networks. ACM Comput Surv (CSUR) 49(4):1–33

    Article  Google Scholar 

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

    Article  Google Scholar 

  28. Katz L (1953) A new status index derived from sociometric analysis. Psychometrika 18(1):39–43

    Article  MATH  Google Scholar 

  29. Jeh G, Widom J (2002) SimRank: a measure of structural-context similarity. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining

  30. Lü L, Jin C-H, Zhou T (2009) Similarity index based on local paths for link prediction of complex networks. Phys Rev E 80(4):046122

    Article  Google Scholar 

  31. Al Hasan M et al (2006) Link prediction using supervised learning. In: SDM06: workshop on link analysis, counter-terrorism and security

  32. Rostami M, Berahmand K, Forouzandeh S (2020) A novel method of constrained feature selection by the measurement of pairwise constraints uncertainty. J Big Data 7(1):1–21

    Article  Google Scholar 

  33. O’Madadhain J, Hutchins J, Smyth P (2005) Prediction and ranking algorithms for event-based network data. ACM SIGKDD Explor Newsl 7(2):23–30

    Article  Google Scholar 

  34. Zheleva E, Getoor L (2007) Preserving the privacy of sensitive relationships in graph data. In: International workshop on privacy, security, and trust in KDD. Springer, Berlin

  35. Sarkar P, Moore A (2012) A tractable approach to finding closest truncated-commute-time neighbors in large graphs. arXiv preprint arXiv:1206.5259

  36. Kashima H, Abe N (2006) A parameterized probabilistic model of network evolution for supervised link prediction. In: Sixth international conference on data mining (ICDM'06). IEEE

  37. Menon AK, Elkan C (2011) Link prediction via matrix factorization. In: Joint European conference on machine learning and knowledge discovery in databases. Springer, Berlin

  38. Ou M et al (2016) Asymmetric transitivity preserving graph embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining

  39. Cao S, Lu W, Xu Q (2015) Grarep: learning graph representations with global structural information. In: Proceedings of the 24th ACM international on conference on information and knowledge management

  40. Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining

  41. Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: AAAI

  42. Tang J et al (2015) Line: large-scale information network embedding. In: Proceedings of the 24th international conference on World Wide Web. International World Wide Web Conferences Steering Committee

  43. Bronstein MM et al (2017) Geometric deep learning: going beyond euclidean data. IEEE Signal Process Mag 34(4):18–42

    Article  Google Scholar 

  44. Kipf TN, Welling M (2016) Semi-supervised classification with graph convolutional networks. arXiv preprint arXiv:1609.02907

  45. Newman ME (2005) A measure of betweenness centrality based on random walks. Soc Netw 27(1):39–54

    Article  Google Scholar 

  46. Fouss F et al (2007) Random-walk computation of similarities between nodes of a graph with application to collaborative recommendation. IEEE Trans Knowl Data Eng 19(3):355–369

    Article  Google Scholar 

  47. Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Proceedings of the 20th ACM SIGKDD international conference on knowledge discovery and data mining. ACM

  48. Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. Kdd 2016:855–864

    Article  Google Scholar 

  49. Wasserman S, Faust K (1994) Social network analysis: methods and applications, vol 8. Cambridge University Press, Cambridge

    Book  MATH  Google Scholar 

  50. Pavlopoulos GA, Wegener A-L, Schneider R (2008) A survey of visualization tools for biological network analysis. Biodata Min 1(1):12

    Article  Google Scholar 

  51. Popescul A, Ungar LH (2003) Statistical relational learning for link prediction. In: IJCAI workshop on learning statistical models from relational data. Citeseer

  52. Bliss CA et al (2014) An evolutionary algorithm approach to link prediction in dynamic social networks. J Comput Sci 5(5):750–764

    Article  MathSciNet  Google Scholar 

  53. Zhu S et al (2007) Combining content and link for classification using matrix factorization. In: Proceedings of the 30th annual international ACM SIGIR conference on research and development in information retrieval

  54. Yang C et al (2015) Network representation learning with rich text information. In: IJCAI

  55. Le Q, Mikolov T (2014) Distributed representations of sentences and documents. In: International conference on machine learning

  56. Hamilton WL, Ying R, Leskovec J (2017) Inductive representation learning on large graphs. In: Proceedings of the 31st International Conference on Neural Information Processing Systems

  57. Wang S et al (2016) Paired restricted Boltzmann machine for linked data. In: Proceedings of the 25th ACM international on conference on information and knowledge management

  58. Huang X, Li J, Hu X (2017) Accelerated attributed network embedding. In: Proceedings of the 2017 SIAM international conference on data mining. SIAM

  59. Faizal E (2014) Case based reasoning diagnosis Penyakit cardiovascular dengan metode simple matching coefficient similarity. Jurnal Teknologi Informasi dan Ilmu Komputer 1(2):83–90

    Article  Google Scholar 

  60. Sen P et al (2008) Collective classification in network data. AI Mag 29(3):93–93

    Google Scholar 

  61. Li J et al (2015) Unsupervised streaming feature selection in social media. In: Proceedings of the 24th ACM international on conference on information and knowledge management. ACM

  62. McAuley JJ, Leskovec J (2012) Learning to discover social circles in ego networks. In: NIPS. Citeseer

  63. Wang X et al (2017) Community preserving network embedding. In: Thirty-first AAAI conference on artificial intelligence

  64. Chowdhury GG (2010) Introduction to modern information retrieval. Facet Publishing, London

    Google Scholar 

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

    Article  MATH  Google Scholar 

  66. Provost F, Fawcett T (2001) Robust classification for imprecise environments. Mach Learn 42(3):203–231

    Article  MATH  Google Scholar 

  67. Pedregosa F et al (2011) Scikit-learn: machine learning in Python. J Mach Learn Res 12(Oct):2825–2830

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Sciences, Science and Engineering Faculty, Queensland University of Technology (QUT), Brisbane, Australia

    Kamal Berahmand

  2. Department of Information Technology and Communications, Azarbaijan Shahid Madani University, Tabriz, Iran

    Elahe Nasiri

  3. Department of Computer Engineering, University of Kurdistan, Sanandaj, Iran

    Mehrdad Rostami

  4. Department of Computer Engineering, Center of Tehran Municipality ICT Org, University of Applied Science and Technology, Tehran, Iran

    Saman Forouzandeh

Authors
  1. Kamal Berahmand
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Elahe Nasiri
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mehrdad Rostami
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Saman Forouzandeh
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Kamal Berahmand.

Additional information

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Berahmand, K., Nasiri, E., Rostami, M. et al. A modified DeepWalk method for link prediction in attributed social network. Computing 103, 2227–2249 (2021). https://doi.org/10.1007/s00607-021-00982-2

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00607-021-00982-2

Keywords

Mathematics Subject Classification

Search

Navigation