On the Quality of Spectral Separators
SIAM Journal on Matrix Analysis and Applications
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Database for Handwritten Text Recognition Research
IEEE Transactions on Pattern Analysis and Machine Intelligence
Spectral Grouping Using the Nyström Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
A tutorial on spectral clustering
Statistics and Computing
Improved Nyström low-rank approximation and error analysis
Proceedings of the 25th international conference on Machine learning
Density-weighted nyström method for computing large kernel eigensystems
Neural Computation
Fast approximate spectral clustering
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Multiway Spectral Clustering with Out-of-Sample Extensions through Weighted Kernel PCA
IEEE Transactions on Pattern Analysis and Machine Intelligence
Parallel Spectral Clustering in Distributed Systems
IEEE Transactions on Pattern Analysis and Machine Intelligence
Fast density-weighted low-rank approximation spectral clustering
Data Mining and Knowledge Discovery
Vector quantization based approximate spectral clustering of large datasets
Pattern Recognition
Multi-level Low-rank Approximation-based Spectral Clustering for image segmentation
Pattern Recognition Letters
Hi-index | 0.10 |
Spectral clustering has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets. To address this complexity, approximate spectral clustering methods have been proposed. In these methods, computational costs are reduced by using approximation techniques, such as the Nystrom method, or by constructing a smaller representative dataset on which spectral clustering is performed. However, the computational efficiency of these approximation methods is achieved at the cost of performance degradation. In this paper, we propose an efficient approximate spectral clustering method in which clustering performance is improved by utilizing local information among the data, while the scalability to the large-scale datasets is retained. Specifically, we improve the approximate spectral clustering method in two aspects. First, a sparse affinity graph is adopted to improve the performance of spectral clustering on the small representative dataset. Second, local interpolation is utilized to improve the extension of the clustering result. Experiments are conducted on several real-world datasets, showing that the proposed method is efficient and outperforms the state-of-the-art approximate spectral clustering algorithms.