Estimating clustering coefficients via metropolis-hastings random walk and wedge sampling on large OSN graphs.
Emrah ÇemKamil SaraçPublished in: IPCCC (2016)
Keyphrases
- random walk
- metropolis hastings
- spectral methods
- directed graph
- sampling algorithm
- posterior distribution
- markov chain
- markov chain monte carlo
- hyper graph
- clustering algorithm
- graph clustering
- k means
- particle filtering
- web graph
- clustering method
- markov random walk
- online social networks
- nodes of a graph
- hierarchical clustering
- spectral clustering
- graph partitioning
- data clustering
- document clustering
- probability distribution
- random sampling
- pairwise
- visual tracking
- maximum a posteriori
- monte carlo
- support vector
- feature selection