Estimating clustering coefficients and size of social networks via random walk.
Stephen J. HardimanLiran KatzirPublished in: WWW (2013)
Keyphrases
- random walk
- link prediction
- social networks
- spectral methods
- proximity measures
- clustering algorithm
- graph clustering
- markov chain
- markov random walk
- directed graph
- transition probabilities
- clustering method
- transition probability matrix
- web graph
- flow graph
- bipartite graph
- network analysis
- k means
- data clustering
- basis functions
- semi supervised
- community detection
- graph mining
- graph partitioning
- online social networks
- social influence
- network structure
- data points
- distance metric