Skip to Main content Skip to Navigation
Conference papers

Graph Clustering Using Early-Stopped Random Walks

Abstract : Very fast growth of empirical graphs demands clustering algorithms with nearly-linear time complexity. We propose a novel approach to clustering, based on random walks. The idea is to relax the standard spectral method and replace eigenvectors with vectors obtained by running early-stopped random walks. We abandoned iterating the random walk algorithm to convergence but instead stopped it after the time that is short compared with the mixing time. The computed vectors constitute a local approximation of the leading eigenvectors. The algorithm performance is competitive to the traditional spectral solutions in terms of computational complexity. We empirically evaluate the proposed approach against other exact and approximate methods. Experimental results show that the use of the early stop procedure does not influence the quality of the clustering on the tested real world data sets.
Complete list of metadata

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/hal-01637482
Contributor : Hal Ifip <>
Submitted on : Friday, November 17, 2017 - 3:44:26 PM
Last modification on : Monday, January 22, 2018 - 11:08:07 AM
Long-term archiving on: : Sunday, February 18, 2018 - 3:26:52 PM

File

419526_1_En_37_Chapter.pdf
Files produced by the author(s)

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

Collections

Citation

Małgorzata Lucińska, Sławomir Wierzchoń. Graph Clustering Using Early-Stopped Random Walks. 15th IFIP International Conference on Computer Information Systems and Industrial Management (CISIM), Sep 2016, Vilnius, Lithuania. pp.416-428, ⟨10.1007/978-3-319-45378-1_37⟩. ⟨hal-01637482⟩

Share

Metrics

Record views

277

Files downloads

326