Fast clustering for signed graphs based on random walk gap.
Jialin HuaJian YuMiin-Shen YangPublished in: Soc. Networks (2020)
Keyphrases
- random walk
- spectral methods
- directed graph
- graph clustering
- clustering algorithm
- hyper graph
- link prediction
- clustering method
- average degree
- proximity measures
- graph partitioning
- web graph
- markov chain
- markov random walk
- transition probability matrix
- flow graph
- transition probabilities
- multi db
- graph model
- graph construction
- k means
- graph structures
- weighted graph
- graph structure
- bipartite graph
- spectral clustering
- data clustering
- graph laplacian
- adjacency matrix
- laplacian matrix
- data points
- dynamic programming
- nodes of a graph