Spectral clustering trough topological learning for large datasets

Abstract

This paper introduces a new approach for clustering large datasets based on spectral clustering and topological unsupervised learning. Spectral clustering method needs to construct an adjacency matrix and calculate the eigen-decomposition of the corresponding Laplacian matrix [4] which are computational expensive and is not easy to apply on large-scale data sets. Contrarily, the topological learning (i.e. SOM method) allows a projection of the dataset in low dimensional spaces that make it easy to use for very large datasets. The prototypes matrix weighted by the neighbourhood function will be used in this work to reduce the computational time of the clustering algorithm and to add the topological information to the final clustering result. We illustrate the power of this method with several real datasets. The results show a good quality of clustering results and a higher speed.