@inproceedings{8acdc537d849455f9e91df061e8c98e5,
title = "Large scale spectral clustering using resistance distance and spielman-teng solvers",
abstract = "The promise of spectral clustering is that it can help detect complex shapes and intrinsic manifold structure in large and high dimensional spaces. The price for this promise is the computational cost O(n 3) for computing the eigen-decomposition of the graph Laplacian matrix-so far a necessary subroutine for spectral clustering. In this paper we bypass the eigen-decomposition of the original Laplacian matrix by leveraging the recently introduced Spielman and Teng near-linear time solver for systems of linear equations and random projection. Experiments on several synthetic and real datasets show that the proposed approach has better clustering quality and is faster than the state-of-the-art approximate spectral clustering methods.",
keywords = "Spielman-Teng Solver, random projection, resistance distance, spectral clustering",
author = "Khoa, {Nguyen Lu Dang} and Sanjay Chawla",
year = "2012",
doi = "10.1007/978-3-642-33492-4_4",
language = "English",
isbn = "9783642334917",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "7--21",
booktitle = "Discovery Science - 15th International Conference, DS 2012, Proceedings",
note = "15th International Conference on Discovery Science, DS 2012 ; Conference date: 29-10-2012 Through 31-10-2012",
}