Difference between revisions of "Dynamic Social Network Analysis using Latent Space Models"

From Cohen Courses
Jump to navigationJump to search
Line 8: Line 8:
  
 
== Summary ==  
 
== Summary ==  
This paper address the problem of [[AddressesProblem::Social Network Analysis]] using the method of [[UsesMethod::Latent Space Models]].  
+
This paper address the problem of [[AddressesProblem::Social Network Analysis]] using the method of [[UsesMethod::Latent Space Models]]. More specifically, it addresses the problem of network evolution in social network analysis, by modelling the way in which the friendships drift over time. It efficiently learns this even when ''n'' is large, by assuming that nodes represented by points in the latent space do not make large movements over time. Hence it is a latent space model developed for dynamic analysis of social networks to predict the future link structure of the graph.  
  
 
This technique is applied to [[UsesDataset::NIPS]] data to analysis the dynamics of network evolution.  
 
This technique is applied to [[UsesDataset::NIPS]] data to analysis the dynamics of network evolution.  

Revision as of 16:29, 1 April 2011

This is one of the paper written in course Social Media Analysis 10-802 in Spring 2011

Citation

Purnamrita Sarkar, Andrew W. Moore "Dynamic Social Network Analysis using Latent Space Models"

Online Version

SIGKDD 2005

Summary

This paper address the problem of Social Network Analysis using the method of Latent Space Models. More specifically, it addresses the problem of network evolution in social network analysis, by modelling the way in which the friendships drift over time. It efficiently learns this even when n is large, by assuming that nodes represented by points in the latent space do not make large movements over time. Hence it is a latent space model developed for dynamic analysis of social networks to predict the future link structure of the graph.

This technique is applied to NIPS data to analysis the dynamics of network evolution.

Dynamic Social Network In Latent Space (DSNL)

Learning Stage One: Linear Approximation

Learning Stage Two: Non linear search

Datasets Used

Experimental Results

Conclusion