• DocumentCode
    3437872
  • Title

    Tensor decomposition model for link prediction in multi-relational networks

  • Author

    Gao, Sheng ; Denoyer, Ludovic ; Gallinari, Patrick

  • Author_Institution
    LIP6, Univ. Pierre et Marie Curie, Paris, France
  • fYear
    2010
  • fDate
    24-26 Sept. 2010
  • Firstpage
    298
  • Lastpage
    302
  • Abstract
    Many real-world datasets can be considered as a linked collection of objects with multi-type relations, where each type of relations may play a distinct role. In this paper, we address the problem of link prediction in such multi-relational networks. While traditional link prediction methods are limited to single-type link prediction we attempt here to capture the correlations among the different relation types. For that, we use tensor formalization and formulate the link pattern prediction task as a tensor decomposition model which is solved by quasi-Newton optimization method. Extensive experiments on real-world multi-relational datasets demonstrate the accuracy and effectiveness of our model.
  • Keywords
    Newton method; optimisation; relational databases; social networking (online); tensors; link pattern prediction; multirelational networks; quasiNewton optimization method; tensor decomposition model; tensor formalization; Electronic mail; Matrix decomposition; Optimization; Prediction algorithms; Predictive models; Social network services; Tensile stress; link pattern prediction; multi-type relations; quasi-Newton optimization; tucker tensor decomposition;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Network Infrastructure and Digital Content, 2010 2nd IEEE International Conference on
  • Conference_Location
    Beijing
  • Print_ISBN
    978-1-4244-6851-5
  • Type

    conf

  • DOI
    10.1109/ICNIDC.2010.5657965
  • Filename
    5657965