Scalable Spectral Clustering with Weighted PageRank [chapter]

Dimitrios Rafailidis, Eleni Constantinou, Yannis Manolopoulos
2014 Lecture Notes in Computer Science  
In this paper, we propose an accelerated spectral clustering method, using a landmark selection strategy. According to the weighted PageRank algorithm, the most important nodes of the data affinity graph are selected as landmarks. The selected landmarks are provided to a landmark spectral clustering technique to achieve scalable and accurate clustering. In our experiments with two benchmark face and shape image data sets, we examine several landmark selection strategies for scalable spectral
more » ... stering that either ignore or consider the topological properties of the data in the affinity graph. Finally, we show that the proposed method outperforms baseline and accelerated spectral clustering methods, in terms of computational cost and clustering accuracy, respectively.
doi:10.1007/978-3-319-11587-0_27 fatcat:pgeusqowpzcbtaohaom6acphke