SGVCut: A Vertex-Cut Partitioning Tool for Random Walks-based Computations over Social Network graphs.
Yifan LiCamélia ConstantinCédric du MouzaPublished in: SSDBM (2017)
Keyphrases
- random walk
- directed graph
- link prediction
- vertex set
- average degree
- social networks
- undirected graph
- spectral methods
- markov chain
- graph partitioning
- hyper graph
- graph mining
- transition probabilities
- bipartite graph
- flow graph
- weighted graph
- web graph
- labeled graphs
- social network analysis
- graph structure
- transition probability matrix
- betweenness centrality
- nodes of a graph
- community discovery
- attributed graphs
- stationary distribution
- graph clustering
- network analysis
- min cut
- normalized cut
- graph laplacian
- edge weights
- graph databases