Abstract
This paper explores two aspects of social network modeling. First, we generalize a successful static model of relationships into a dynamic model that accounts for friendships drifting over time. Second, we show how to make it tractable to learn such models from data, even as the number of entities n gets large. The generalized model associates each entity with a point in p-dimensional Euclidean latent space. The points can move as time progresses but large moves in latent space are improbable. Observed links between entities are more likely if the entities are close in latent space. We show how to make such a model tractable (sub-quadratic in the number of entities) by the use of appropriate kernel functions for similarity in latent space; the use of low dimensional KD-trees; a new efficient dynamic adaptation of multidimensional scaling for a first pass of approximate projection of entities into latent space; and an efficient conjugate gradient update rule for non-linear local optimization in which amortized time per entity during an update is O(log n). We use both synthetic and real-world data on up to 11,000 entities which indicate near-linear scaling in computation time and improved performance over four alternative approaches. We also illustrate the system operating on twelve years of NIPS co-authorship data.
- J. Schroeder, J. J. Xu, and H. Chen. Crimelink explorer: Using domain knowledge to facilitate automated crime association analysis. In ISI, pages 168--180, 2003. Google ScholarDigital Library
- J. J. Carrasco, D. C. Fain, K. J. Lang, and L. Zhukov. Clustering of bipartite advertiser-keyword graph. In ICDM, 2003.Google Scholar
- J. Palau, M. Montaner, and B. López. Collaboration analysis in recommender systems using social networks. In Eighth Intl. Workshop on Cooperative Info. Agents (CLA'04), 2004.Google ScholarCross Ref
- A. E. Raftery, M. S. Handcock, and P. D. Hoff. Latent space approaches to social network analysis. J. Amer. Stat. Assoc., 15:460, 2002.Google Scholar
- R. L. Breiger, S. A. Boorman, and P. Arabie. An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling. J. of Math. Psych., 12:328--383, 1975.Google ScholarCross Ref
- I. Borg and P. Groenen. Modern Multidimensional Scaling. Springer-Verlag, 1997.Google ScholarCross Ref
- R. Sibson. Studies in the robustness of multidimensional scaling: Perturbational analysis of classical scaling. J. Royal Stat. Soc. B, Methodological, 41:217--229, 1979.Google Scholar
- David S. Watkins. Fundamentals of Matrix Computations. John Wiley & Sons, 1991. Google ScholarDigital Library
- F. Preparata and M. Shamos. Computational Geometry: An Introduction. Springer-Verlag, 1985. Google ScholarDigital Library
- A. G. Gray and A. W. Moore. N-body problems in statistical learning. In NIPS, 2001.Google Scholar
- R. Salakhutdinov, S. T. Roweis, and Z. Ghahramani. Optimization with em and expectation-conjugate-gradient. In ICML, volume 20, pages 672--679, 2003.Google Scholar
Index Terms
- Dynamic social network analysis using latent space models
Recommendations
Latent-Space Variational Bayes
Variational Bayesian Expectation-Maximization (VBEM), an approximate inference method for probabilistic models based on factorizing over latent variables and model parameters, has been a standard technique for practical Bayesian inference. In this paper,...
Mean-field variational approximate Bayesian inference for latent variable models
The ill-posed nature of missing variable models offers a challenging testing ground for new computational techniques. This is the case for the mean-field variational Bayesian inference. The behavior of this approach in the setting of the Bayesian probit ...
Comments