By Topic

Predicting missing links in social networks with hierarchical dirichlet processes

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
$33 $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

4 Author(s)
Takayuki Kamei ; Department of Electronics and Informatics, Ryukoku University, Otsu 520-2194, Japan ; Keiko Ono ; Masahito Kumano ; Masahiro Kimura

We address the problem of predicting missing links for a social network in Social Media by using user activity data. We propose a simple and natural probabilistic model with latent features (traits) for simultaneously generating links and activities in the set of nodes, and present an efficient method of learning the model from the observed links and activities. In order to estimate the total number of latent features and the probability distribution of them for each node from the observed data, we incorporate a hierarchical Dirichlet process (HDP) into the model. On the basis of the learned model, we present a method of predicting missing links in the social network. We experimentally show by using synthetic data that the proposed learning method can estimate the link creation probabilities in good accuracy when there is an enough amount of training data. Moreover, using real and synthetic data, we experimentally demonstrate the effectiveness of the proposed link prediction method.

Published in:

The 2012 International Joint Conference on Neural Networks (IJCNN)

Date of Conference:

10-15 June 2012