By Topic

Tensor decomposition model for link prediction in multi-relational networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Sheng Gao ; LIP6, Univ. Pierre et Marie Curie, Paris, France ; Denoyer, L. ; Gallinari, P.

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.

Published in:

Network Infrastructure and Digital Content, 2010 2nd IEEE International Conference on

Date of Conference:

24-26 Sept. 2010