IDEAS home Printed from https://ideas.repec.org/a/igg/jsesd0/v12y2021i3p66-78.html
   My bibliography  Save this article

Structural Mining for Link Prediction Using Various Machine Learning Algorithms

Author

Listed:
  • Ranjan Kumar Behera

    (School of Computer Science and Engineering, Xavier University, Bhubaneswar, India)

  • Kshira Sagar Sahoo

    (Department of Computer Science and Engineering, SRM University, Amaravati, India)

  • Debadatt Naik

    (Indian Institute of Technology (Indian School of Mines), Dhanbad, India)

  • Santanu Kumar Rath

    (National Institute of Technology, Rourkela, India)

  • Bibhudatta Sahoo

    (National Institute of Technology, Rourkela, India)

Abstract

Link prediction is an emerging research problem in social network analysis, where future possible links are predicted based on the structural or the content information associated with the network. In this paper, various machine learning (ML) techniques have been utilized for predicting the future possible links based on the features extracted from the topological structure. Moreover, feature sets have been prepared by measuring different similarity metrics between all pair of nodes between which no link exists. For predicting the future possible links various supervised ML algorithms like K-NN, MLP, bagging, SVM, decision tree have been implemented. The feature set for each instance in the dataset has been prepared by measuring the similarity index between the non-existence links. The model has been trained to identify the new links which are likely to appear in the future but currently do not exist in the network. Further, the proposed model is validated through various performance metrics.

Suggested Citation

  • Ranjan Kumar Behera & Kshira Sagar Sahoo & Debadatt Naik & Santanu Kumar Rath & Bibhudatta Sahoo, 2021. "Structural Mining for Link Prediction Using Various Machine Learning Algorithms," International Journal of Social Ecology and Sustainable Development (IJSESD), IGI Global, vol. 12(3), pages 66-78, July.
    • Handle: RePEc:igg:jsesd0:v:12:y:2021:i:3:p:66-78
    as

    Download full text from publisher

    File URL: http://services.igi-global.com/resolvedoi/resolve.aspx?doi=10.4018/IJSESD.2021070105
    Download Restriction: no
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:igg:jsesd0:v:12:y:2021:i:3:p:66-78. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Journal Editor (email available below). General contact details of provider: https://www.igi-global.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.