Skip to main content
Log in

Robust graph regularization nonnegative matrix factorization for link prediction in attributed networks

  • Published:
Multimedia Tools and Applications Aims and scope Submit manuscript

Abstract

Link prediction is one of the most widely studied problems in the area of complex network analysis, in which machine learning techniques can be applied to deal with it. The biggest drawback of the existing methods, however, is that in most cases they only consider the topological structure of the network, and therefore completely miss out on the great potential that stems from the nodal attributes. Both topological structure and nodes’ attributes are essential in predicting the evolution of attributed networks and can act as complements to each other. To bring out their full potential in solving the link prediction problem, a novel Robust Graph Regularization Nonnegative Matrix Factorization for Attributed Networks (RGNMF-AN) was proposed, which models not only the topology structure of networks but also their node attributes for direct link prediction. This model, in particular, combines two types of information, namely network topology, and nodal attributes information, and calculates high-order proximities between nodes using the Structure-Attribute Random Walk Similarity (SARWS) method. The SARWS score matrix is an indicator structural and attributed matrix that collects more useful attributed information in high-order proximities, whereas graph regularization technology combines the SARWS score matrix with topological and attribute information to collect more valuable attributed information in high-order proximities. Furthermore, the RGNMF-AN employs the ℓ2,1-norm to constrain the loss function and regularization terms, effectively removing random noise and spurious links. According to empirical findings on nine real-world complex network datasets, the use of a combination of attributed and topological information in tandem enhances the prediction performance significantly compared to the baseline and other NMF-based algorithms.

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

Access this article

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/

References

  1. Aggarwal CC, Li N (2011) On node classification in dynamic content-based networks. In: Proceedings of the 2011 SIAM international conference on data mining. SIAM

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

    Article  Google Scholar 

  3. Bandyopadhyay S et al (2018) Fscnmf: fusing structure and content via non-negative matrix factorization for embedding information networks. arXiv preprint arXiv:1804.05313

  4. Berahmand K et al (2020) A new attributed graph clustering by using label propagation in complex networks. J King Saud Univ-Comput Inf Sci

  5. Berahmand K, Nasiri E, Li Y (2021) Spectral clustering on protein-protein interaction networks via constructing affinity matrix using attributed graph embedding. Comput Biol Med 138:104933

    Article  Google Scholar 

  6. Berahmand K et al (2021) A modified DeepWalk method for link prediction in attributed social network. Computing:1–23

  7. Berahmand K et al (2021) A preference random walk algorithm for link prediction through mutual influence nodes in complex networks. J King Saud Univ – Comput Inf Sci

  8. Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. In: Social network data analytics. Springer, pp 115–148

  9. Cai D, He X, Han J, Huang TS (2010) Graph regularized nonnegative matrix factorization for data representation. IEEE Trans Pattern Anal Mach Intell 33(8):1548–1560

    Google Scholar 

  10. 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 

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

  12. Chen H, Li X, Huang Z (2005) Link prediction approach to collaborative filtering. In: Proceedings of the 5th ACM/IEEE-CS joint conference on digital libraries (JCDL'05). IEEE

  13. Chen B, Li F, Chen S, Hu R, Chen L (2017) Link prediction based on non-negative matrix factorization. PLoS One 12(8):e0182968

    Article  Google Scholar 

  14. Chen G, Xu C, Wang J, Feng J, Feng J (2019) Graph regularization weighted nonnegative matrix factorization for link prediction in weighted complex network. Neurocomputing 369:50–60

    Article  Google Scholar 

  15. Chen G, Xu C, Wang J, Feng J, Feng J (2020) Nonnegative matrix factorization for link prediction in directed complex networks using PageRank and asymmetric link clustering information. Expert Syst Appl 148:113290

    Article  Google Scholar 

  16. Chen G et al (2020) Robust non-negative matrix factorization for link prediction in complex networks using manifold regularization and sparse learning. Phys A: Stat Mech Appl 539:122882

    Article  MathSciNet  MATH  Google Scholar 

  17. Chunaev P (2020) Community detection in node-attributed social networks: a survey. Comput Sci Rev 37:100286

    Article  MathSciNet  MATH  Google Scholar 

  18. Currarini S, Matheson J, Vega-Redondo F (2016) A simple model of homophily in social networks. Eur Econ Rev 90:18–39

    Article  Google Scholar 

  19. Dev P (2016) Homophily and community structure in networks. J Public Econ Theory 18(2):268–290

    Article  MathSciNet  Google Scholar 

  20. Divakaran A, Mohan A (2019) Temporal link prediction: a survey. N Gener Comput:1–46

  21. Esmaeili M, Saad HM, Nosratinia A (2021) Semidefinite programming for community detection with side information. IEEE Trans Netw Sci Eng

  22. 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 

  23. Forouzandeh S, Rostami M, Berahmand K (2021) Presentation a trust Walker for rating prediction in recommender system with biased random walk: effects of H-index centrality, similarity in items and friends. Eng Appl Artif Intell 104:104325

    Article  Google Scholar 

  24. Franceschini A, Lin J, von Mering C, Jensen LJ (2016) SVD-phy: improved prediction of protein functional associations through singular value decomposition of phylogenetic profiles. Bioinformatics 32(7):1085–1087

    Article  Google Scholar 

  25. Gao S, Denoyer L, Gallinari P (2011) Temporal link prediction by integrating content and structure information. In: Proceedings of the 20th ACM international conference on Information and knowledge management

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

    Article  Google Scholar 

  27. Guimerà R, Sales-Pardo M (2009) Missing and spurious interactions and the reconstruction of complex networks. Proc Natl Acad Sci 106(52):22073–22078

    Article  Google Scholar 

  28. Guo Y, Li M, Pu X, Li G, Guang X, Xiong W, Li J (2010) PRED_PPI: a server for predicting protein-protein interactions based on sequence data with probability assignment. BMC Res Notes 3(1):1–7

    Article  Google Scholar 

  29. Hamilton W, Ying Z, Leskovec J (2017) Inductive representation learning on large graphs. In: Advances in neural information processing systems

  30. Keikha MM, Rahgozar M, Asadpour M (2019) DeepLink: a novel link prediction framework based on deep learning. J Inf Sci:0165551519891345

  31. Kim Y-D, Choi S (2009) Weighted nonnegative matrix factorization. In: 2009 IEEE international conference on acoustics, speech and signal processing. IEEE

  32. Kumar A, Singh SS, Singh K, Biswas B (2020) Link prediction techniques, applications, and performance: a survey. Phys A: Stat Mech Appl 553:124289

    Article  MathSciNet  MATH  Google Scholar 

  33. Kumar A, Mishra S, Singh SS, Singh K, Biswas B (2020) Link prediction in complex networks based on significance of higher-order path index (SHOPI). Phys A: Stat Mech Appl 545:123790

    Article  Google Scholar 

  34. Lee DD, Seung HS (1999) Learning the parts of objects by non-negative matrix factorization. Nature 401(6755):788–791

    Article  MATH  Google Scholar 

  35. Li Y, Ngom A (2013) The non-negative matrix factorization toolbox for biological data mining. Source Code Biol Med 8(1):1–15

    Article  Google Scholar 

  36. Li J et al (2017) Attributed network embedding for learning in a dynamic environment. In: Proceedings of the 2017 ACM on Conference on Information and Knowledge Management

  37. Liu W, Lü L (2010) Link prediction based on local random walk. EPL (Europhysics Letters) 89(5):58007

    Article  Google Scholar 

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

    Article  Google Scholar 

  39. Ma X, Sun P, Qin G (2017) Nonnegative matrix factorization algorithms for link prediction in temporal networks using graph communicability. Pattern Recogn 71:361–374

    Article  Google Scholar 

  40. Ma X, Sun P, Wang Y (2018) Graph regularized nonnegative matrix factorization for temporal link prediction in dynamic networks. Phys A: Stat Mech Appl 496:121–136

    Article  MATH  Google Scholar 

  41. Masrour F et al (2018) Attributed network representation learning approaches for link prediction. In: 2018 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM). IEEE

  42. Mehrpooya A et al (2021) High dimensionality reduction by matrix factorization for systems pharmacology. Brief Bioinform

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

  44. Mikolov T et al (2013) Distributed representations of words and phrases and their compositionality. In: Advances in neural information processing systems

  45. Mokhtia M, Eftekhari M, Saberi-Movahed F (2020) Feature selection based on regularization of sparsity based regression models by hesitant fuzzy correlation. Appl Soft Comput 91:106255

    Article  Google Scholar 

  46. Muniz CP, Goldschmidt R, Choren R (2018) Combining contextual, temporal and topological information for unsupervised link prediction in social networks. Knowl-Based Syst 156:129–137

    Article  Google Scholar 

  47. 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 

  48. Nasiri E, Berahmand K, Rostami M, Dabiri M (2021) A novel link prediction algorithm for protein-protein interaction networks by attributed graph embedding. Comput Biol Med 137:104772

    Article  Google Scholar 

  49. Nasiri E, Berahmand K, Li Y (2021) A new link prediction in multiplex networks using topologically biased random walks. Chaos Soliton Fract 151:111230

    Article  Google Scholar 

  50. Newman ME (2001) Clustering and preferential attachment in growing networks. Phys Rev E 64(2):025102

    Article  Google Scholar 

  51. 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

  52. Pan S et al (2016) Tri-party deep network representation. Network 11(9):12

    Google Scholar 

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

    Google Scholar 

  54. 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

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

    Article  MATH  Google Scholar 

  56. Qian B et al (2016) Double constrained NMF for partial multi-view clustering. In: 2016 international conference on digital image computing: techniques and applications (DICTA). IEEE

  57. Saberi-Movahed F, Eftekhari M, Mohtashami M (2019) Supervised feature selection by constituting a basis for the original space of features and matrix factorization. Int J Mach Learn Cybern:1–17

  58. Saberi-Movahed F et al (2021) Decoding clinical biomarker space of covid-19: exploring matrix factorization-based feature selection methods. medRxiv

  59. Sen P, Namata G, Bilgic M, Getoor L, Galligher B, Eliassi-Rad T (2008) Collective classification in network data. AI Mag 29(3):93–93

    Google Scholar 

  60. Tropp JA (2003) Literature survey: nonnegative matrix factorization. University of Texas at Asutin, p 26

  61. Vidal R, Ma Y, Sastry S (2005) Generalized principal component analysis (GPCA). IEEE Trans Pattern Anal Mach Intell 27(12):1945–1959

    Article  Google Scholar 

  62. Wang C, Satuluri V, Parthasarathy S (2007) Local probabilistic models for link prediction. In: Seventh IEEE international conference on data mining (ICDM 2007). IEEE

  63. Wang P, Xu BW, Wu YR, Zhou XY (2015) Link prediction in social networks: the state-of-the-art. SCIENCE CHINA Inf Sci 58(1):1–38

    Article  Google Scholar 

  64. Wang D, Liu JX, Gao YL, Zheng CH, Xu Y (2015) Characteristic gene selection based on robust graph regularized non-negative matrix factorization. IEEE/ACM Trans Comput Biol Bioinform 13(6):1059–1067

    Article  Google Scholar 

  65. 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

  66. Wang X et al (2017) Community preserving network embedding. In: Thirty-First AAAI Conference on Artificial Intelligence

  67. Wang W et al (2020) Attributed collaboration network embedding for academic relationship mining. ACM Trans Web 15(1):1–20

    Article  Google Scholar 

  68. Xie J, Douglas PK, Wu YN, Brody AL, Anderson AE (2017) Decoding the encoding of functional brain networks: an fMRI classification comparison of non-negative matrix factorization (NMF), independent component analysis (ICA), and sparse coding algorithms. J Neurosci Methods 282:81–94

    Article  Google Scholar 

  69. Xu B, Li K, Zheng W, Liu X, Zhang Y, Zhao Z, He Z (2018) Protein complexes identification based on go attributed network embedding. BMC Bioinforma 19(1):1–10

    Article  Google Scholar 

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

  71. Yuan G et al (2014) Exploiting sentiment homophily for link prediction. In: Proceedings of the 8th ACM conference on recommender systems. ACM

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Kamal Berahmand.

Ethics declarations

Ethics approval

No animals or human participants are involved in this research work.

Conflict of interest

I confirm that this work is original and has either not been published elsewhere or is currently under consideration for publication elsewhere. None of the authors have any competing interests in the manuscript.

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

Nasiri, E., Berahmand, K. & Li, Y. Robust graph regularization nonnegative matrix factorization for link prediction in attributed networks. Multimed Tools Appl 82, 3745–3768 (2023). https://doi.org/10.1007/s11042-022-12943-8

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11042-022-12943-8

Keywords

Navigation