A Method for Analyzing the Asymptotic Behavior of the Walk Process in Restricted Random Walk Cluster Algorithm.
Markus FrankeAndreas Geyer-SchulzPublished in: GfKl (2006)
Keyphrases
- random walk
- transition probability matrix
- random walker
- hyper graph
- pagerank algorithm
- flow graph
- dynamic programming
- objective function
- clustering method
- computational complexity
- spectral methods
- multi db
- spectral analysis
- similarity function
- k means
- optimal solution
- learning algorithm
- similarity measure
- social networks
- similarity metric
- link prediction
- energy function
- np hard
- minimum spanning tree
- clustering approaches
- graph laplacian
- distance metric
- proximity measures
- matrix representation
- shortest path
- em algorithm
- search space
- pairwise
- spectral graph partitioning