Skip to main content
SpringerLink
Log in

Structural and topological guided GCN for link prediction in temporal networks

  • Original Research
  • Published:
Journal of Ambient Intelligence and Humanized Computing Aims and scope Submit manuscript

Abstract

The ever-growing size of social network information has enhanced research aimed at finding solutions to challenges in this arena. The vastness and complexity of interactions between social network entities render link prediction in these datasets a challenging task. Previous studies often concentrate on only exploring the local node connectivity information neglecting other key network-characterizing properties. In addition, most works assume static networks, yet many real-world graphs evolve. To address these limitations, firstly, we explore topological information from input graph adjacency matrices by computing topological similarity-based convolution feature matrices. Secondly, we leverage the node strength centrality matrix, a more powerful variant of node degree to preserve the node centrality roles and node’s structural connectivity information throughout the network. Lastly, we deploy an LSTM layer to explore the underlying network temporal information. The proposed Structural and Topological aware GCN (STP-GCN) is tested on five social network datasets. Based on experimental results, it exhibits a 3% link prediction AUC improvement, negligible training time increment per epoch (0.2s), and a large MSE magnitude (2.5) reduction in structural centrality prediction as compared to the best benchmark.

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.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

Notes

  1. http://konect.cc/networks/opsahl-ucsocial/.

  2. http://snap.stanford.edu/data/as-733.html.

  3. http://snap.stanford.edu/data/sx-mathoverflow.html.

  4. http://networkrepository.com/fb-wosn-friends.php.

  5. http://networkrepository.com/ia-enron-email-dynamic.php.

References

  • Bhagat S, Cormode G, Muthukrishnan S (2011) Node classification in social networks. Springer US, Boston

    Book  Google Scholar 

  • Chen J, Ma T, Xiao C (2018) Fastgcn: fast learning with graph convolutional networks via importance sampling. arXiv preprint arXiv:1801.10247

  • Chen J, Pareja A, Domeniconi G et al (2021) Evolving graph convolutional networks for dynamic graphs. US Patent App. 16/790682

  • Ebeid IA, Talburt JR, Siddique MAS (2022) Graph-based hierarchical record clustering for unsupervised entity resolution. In: ITNG 2022 19th International Conference on Information Technology-New Generations, Springer, pp 107–118

  • Fix E, Hodges Jr J (1955) Significance probabilities of the Wilcoxon test. The Annals of Mathematical Statistics pp 301–312

  • Freeman LC, Borgatti SP, White DR (1991) Centrality in valued graphs: a measure of betweenness based on network flow. Soc Netw 13(2):141–154

    Article  MathSciNet  Google Scholar 

  • Geethanjali P (2015) Fundamentals of brain signals and its medical application using data analysis techniques. Springer

    Book  Google Scholar 

  • Gligorijević V, Panagakis Y, Zafeiriou S (2018) Non-negative matrix factorizations for multiplex network analysis. IEEE Trans Pattern Anal Mach Intell 41(4):928–940

    Article  Google Scholar 

  • Grover A, Leskovec J (2016) node2vec: scalable feature learning for networks. In: Proceedings of the 22nd ACM SIGKDD international conference on Knowledge discovery and data mining, pp 855–864

  • 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, pp 1025–1035

  • Huang S, Lv T, Zhang X et al (2014) Identifying node role in social network based on multiple indicators. PloS One 9(8):e103733

    Article  Google Scholar 

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

  • Kojaku S, Yoon J, Constantino I et al (2021) Residual2vec: debiasing graph embedding with random graphs. Adv Neural Inform Process Syst 34:24150–24163

    Google Scholar 

  • 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 

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

    Article  Google Scholar 

  • Monti F, Boscaini D, Masci J et al (2017) Geometric deep learning on graphs and manifolds using mixture model CNNS. In: Proceedings of the IEEE conference on computer vision and pattern recognition, pp 5115–5124

  • NarasingaRao M, Venkatesh Prasad V, Sai Teja P et al (2018) A survey on prevention of overfitting in convolution neural networks using machine learning techniques. Int J Eng Technol (UAE) 7(2.32):177–180

    Article  Google Scholar 

  • Pareja A, Domeniconi G, Chen J et al (2020) Evolvegcn: evolving graph convolutional networks for dynamic graphs. In: Proceedings of the AAAI Conference on Artificial Intelligence, pp 5363–5370

  • 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, pp 701–710

  • Rezaeipanah A, Mojarad M (2019) Link prediction in social networks using the extraction of graph topological features. Int J Sci Res Netw Secur Commun 7(5):1–7

    Google Scholar 

  • Sserwadda A, Rekik I (2021) Topology-guided cyclic brain connectivity generation using geometric deep learning. J Neurosci Methods 353(108):988

    Google Scholar 

  • Tenenbaum JB, Silva Vd, Langford JC (2000) A global geometric framework for nonlinear dimensionality reduction. Science 290(5500):2319–2323

    Article  Google Scholar 

  • Veličković P, Cucurull G, Casanova A et al (2017) Graph attention networks. arXiv preprint arXiv:1710.10903

  • Xia F, Liu J, Nie H et al (2019) Random walks: a review of algorithms and applications. IEEE Trans Emerg Top Comput Intell 4(2):95–107

    Article  Google Scholar 

  • Xu K, Hu W, Leskovec J et al (2018) How powerful are graph neural networks? arXiv preprint arXiv:1810.00826

  • Yu W, Cheng W, Aggarwal CC et al (2017) Link prediction with spatial and temporal consistency in dynamic networks. In: IJCAI, pp 3343–3349

Download references

Acknowledgements

This research received no specific grant from any funding agency in the public, commercial, or not-for-profit sectors. Inquiries about data availability should be directed to the authors.

Author information

Authors and Affiliations

  1. Computer Engineering, Istanbul Technical University, Maslak, Istanbul, 34467, Turkey

    Abubakhari Sserwadda & Yusuf Yaslan

  2. Computer Engineering, Akdeniz University, Konyaltı, Antalya, 07070, Turkey

    Alper Ozcan

Authors
  1. Abubakhari Sserwadda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Alper Ozcan
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yusuf Yaslan
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Alper Ozcan.

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

Sserwadda, A., Ozcan, A. & Yaslan, Y. Structural and topological guided GCN for link prediction in temporal networks. J Ambient Intell Human Comput 14, 9667–9675 (2023). https://doi.org/10.1007/s12652-023-04639-0

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12652-023-04639-0

Keywords

Search

Navigation