Efficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process

CoRR, 2012.

Cited by: 1|Views10
EI

Abstract:

We introduce a novel and efficient sampling algorithm for the Multiplicative Attribute Graph Model (MAGM - Kim and Leskovec (2010)}). Our algorithm is \emph{strictly} more efficient than the algorithm proposed by Yun and Vishwanathan (2012), in the sense that our method extends the \emph{best} time complexity guarantee of their algorith...More

Code:

Data:

Your rating :
0

 

Tags
Comments