Supervised Random Walks for Predicting Links in Social Networks: A Study

Authors

  • Vihashini A Dept. of Computer Science, Gobi Arts & Science College, Gobichettipalayam
  • Prabavathi GT Dept. of Computer Science, Gobi Arts & Science College, Gobichettipalayam

Keywords:

Social networks, Link prediction, Supervised Random walk

Abstract

Predicting is future relationships from a given snapshot of a network or to infer the interactions among existing members that are likely to occur in the near future is called as link prediction. One of the interesting areas of research in social network is prediction of links. There are various techniques for inferring missing links or additional links that are not directly visible but may occur in the future. Random walk is a popular approach which uses node and edge features to solve the problem of link prediction. Supervised random walks combine the network structure with the characteristics of nodes and edges and acts as a powerful tool for predicting the missing and future links. In this paper a study has been made on various algorithms that uses supervised random walk approach for predicting links in social networks.

References

Abir De, Niloy Ganguly and Soumen Chakrabarti, Discriminative Link Prediction using Local Links, Node Features and Community Structure, 2013, pp.1009-1018.

L.Backstrom and J. Leskovec, Supervised random walks: Predicting and recommending links in social networks, WSDM '11 Proceedings of the fourth ACM international conference, 2011, pp.635-644.

Ervin Tasnadi and Gabor Berend-Supervised prediction of social network links using implicit sources of information, Proceedings of the 24th international conference,2015, pp.1117-1122.

M. A. Hasan,V. Chaoji, S. Salem, and M. Zaki-Link prediction using supervised learning, SDM 06 workshop on Link Analysis, Counterterrorism and Security, 2006.

D. Liben-Nowell and J. Kleinberg, The link prediction problem for social networks, Proceedings of CIKM, 2003, pp.556–559.

László Lovász- Random Walks on Graphs: A Survey, Paul Erd˝os is Eighty(Volume2)Keszthely (Hungary), 1993,pp.1–46.

R.N.Lichtenwalter,J.T.Lussier, and N.V. Chawla-New perspectives and methods in link prediction, KDD '10 Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining, 2010,pp.243–252.

Ting Jin, Tong Xu, Enhong Chen, Qi Liu, Haiping Ma, Jingsong Lv, Guoping Hu, Random Walk with Pre-filtering for Social Link Prediction,Proceedings of 2013 9th International conference on computational Intelligence and security,2013, pp.139 – 143.

ValdisKrebs,Mapping networks of terrorist cells, Connections,Winter 2002, pp.24(3):43-52.

C.Wang, V.Satuluri, and S.Parthasarathy,Local probabilistic models for link prediction, Proceedings of the 2007 7th IEEE ICDM,IEEE Computer Society, 2007, pp. 322-331.

Zhijun yin,Manish Gupta, Tim Weninger and Jiawei Han, A Unified Framework for Link Recommendation Using Random Walks, Advances in Social Networks Analysis and Mining (ASONAM), 2010 International Conference, 2010,pp.152 – 159.

Downloads

Published

2025-11-10

How to Cite

[1]
A. Vihashini and G. Prabavathi, “Supervised Random Walks for Predicting Links in Social Networks: A Study”, Int. J. Comp. Sci. Eng., vol. 3, no. 10, pp. 103–106, Nov. 2025.