• DocumentCode
    2778427
  • Title

    Node-Pair Feature Extraction for Link Prediction

  • Author

    Feyessa, Teshome ; Bikdash, Marwan ; Lebby, Gary

  • Author_Institution
    Dept. of Electr. & Comput. Eng., North Carolina A&T State Univ. Greensboro, Greensboro, NC, USA
  • fYear
    2011
  • fDate
    9-11 Oct. 2011
  • Firstpage
    1421
  • Lastpage
    1424
  • Abstract
    In social networks, one of the most essential problems is predicting existence or formation of a link between nodes. Traditional structure based link predicting algorithms leverage node properties such as degree and centrality and relation between nodes such as common neighbors and paths. Most of these algorithms rely on visibility of the entire or significant portion of the network structure, node centrality and shortest distance between nodes often require global knowledge. This work uses a back propagation neural network to predict existence or emergence of a link between pairs of nodes using node pair properties such as reciprocity, transitivity and shared neighbors. A limited network visibility by individual nodes is assumed, hence the size of the node pair feature vector varies with the given visibility range. This approach is tested on a large social object centered trust network where visibility is limited to two hops, 828 accurate predictions out of 1000 pair of nodes is achieved.
  • Keywords
    backpropagation; feature extraction; neural nets; social networking (online); back propagation neural network; link prediction; node-pair feature extraction; social networks; Correlation; Data mining; Feature extraction; Prediction algorithms; Predictive models; Probabilistic logic; Social network services; Link prediction; assortativity; graph clustering; social networks;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Privacy, Security, Risk and Trust (PASSAT) and 2011 IEEE Third Inernational Conference on Social Computing (SocialCom), 2011 IEEE Third International Conference on
  • Conference_Location
    Boston, MA
  • Print_ISBN
    978-1-4577-1931-8
  • Type

    conf

  • DOI
    10.1109/PASSAT/SocialCom.2011.244
  • Filename
    6113319