On the Convexity of Latent Social Network Inference

Details On the Convexity of Latent Social Network Inference On the Convexity of Latent Social Network Inference

2010-10-26

arxiv.org/abs/1010.5504v1

Computer Science

Social and Information Networks

NIPS, 2010

Scientific paper

In many real-world scenarios, it is nearly impossible to collect explicit social network data. In such cases, whole networks must be inferred from underlying observations. Here, we formulate the problem of inferring latent social networks based on network diffusion or disease propagation data. We consider contagions propagating over the edges of an unobserved social network, where we only observe the times when nodes became infected, but not who infected them. Given such node infection times, we then identify the optimal network that best explains the observed data. We present a maximum likelihood approach based on convex programming with a l1-like penalty term that encourages sparsity. Experiments on real and synthetic data reveal that our method near-perfectly recovers the underlying network structure as well as the parameters of the contagion propagation model. Moreover, our approach scales well as it can infer optimal networks of thousands of nodes in a matter of minutes.

Affiliated with

Also associated with

No associations

Rating

On the Convexity of Latent Social Network Inference does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Convexity of Latent Social Network Inference, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Convexity of Latent Social Network Inference will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-484084