M. Kim and J. Leskovec. ICML'12

From Cohen Courses
Revision as of 14:18, 2 October 2012 by Tahoang (talk | contribs) (→‎Summary)
Jump to navigationJump to search

This is a scientific paper authored by M. Kim and J. Leskovec, and appeared in ICML'12. Below is the paper summary written by Tuan Anh.

Citation

Online Version

Latent Multi-group Membership Graph Model.

Summary

This is a paper on block based network analysis and prediction. This work furthers the work by Airoldi. et. al (see Related papers) to the extent that each node/ user can actually belong to more than one block and node features are modeled in addition to link existence. The generative process is given as below (see the figure)

KimLeskovec.png


On the figure above, , , is the number of users, number of user feature categories, and number of blocks respectively. The block membership probability of node at bloc is . Note that this model does not require

  • For each node , and each block , is generated from Beta distribution:
  • Then
    • The truly block membership of node at block is a binary indicator which is generated from Bernoulli distribution
    • The features of node at feature category is a is generated from Bernoulli distribution with the parameter is computed from block membership probabilities using Logistic function
      • where
    • The link between node and node is generated from Bernoulli distribution with the parameter is the product of block-wise linking probabilities
      • where

Given the hyperparameter , the other parameters are estimated by maximum likelihood function using a variational inference algorithm (see the paper for the details).

Discussion

Related papers