Title
Adaptive Power Iteration Clustering
Abstract
Power iteration has been applied to compute the eigenvectors of the similarity matrix in spectral clustering tasks. However, these power iteration based clustering methods usually suffer from the following two problems: (1) the power iteration usually converges very slowly; (2) the singular value decomposition method adopted to obtain the eigenvectors of the similarity matrix is time-consuming. To solve these problems, we propose a novel clustering method named Adaptive Power Iteration Clustering (AdaPIC). Specifically, AdaPIC employs a sequence of rank-one matrices to approximate the normalized similarity matrix. Then, the first K+1 eigenvectors can be computed in parallel, and the stopping condition of power iteration can be automatically yielded based on the target clustering error. We performed extensive experiments on public datasets to demonstrate the effectiveness of the proposed AdaPIC method, comparing with leading baseline methods. The experimental results indicate that the proposed AdaPIC algorithm has a competitive advantage in running time. The running time taken by spectral clustering baseline methods is usually more than 2.52 times of that taken by AdaPIC. For clustering accuracy, AdaPIC outperforms classic PIC by 97% on average, over all experimental datasets. Moreover, AdaPIC achieves comparable clustering accuracy with other 3 baseline methods, and achieves 6%–15% better clustering accuracy than the remaining 6 state-of-the-art baseline methods.
Year
DOI
Venue
2021
10.1016/j.knosys.2021.107118
Knowledge-Based Systems
Keywords
DocType
Volume
Spectral clustering,Power iteration,Rank-one matrix approximation,Rayleigh quotient
Journal
225
ISSN
Citations 
PageRank 
0950-7051
0
0.34
References 
Authors
39
8
Name
Order
Citations
PageRank
Bo Liu152184.67
Yong Liu200.34
huiyan zhang361.50
Yong-Hui Xu4337.31
Can Tang500.34
Lianggui Tang600.34
Huafeng Qin700.34
Chunyan Miao82307195.72