Similarity Graph Learning and Non-linear Deep Representations for Spectral Clusterings

Abstract

Listen

Translate article

Spectral clustering is one of the most popular clustering approaches. Despite its good performance and strong theoretical supports, it is limited to high complexity of the graph Laplacian similarity matrix construction and eigen-decomposition problems. Recently, deep learning has been successfully adopted in graph representation. In the paper, we jointly learn the manifold graph construction and non-linear low-dimension mapping of the graph. In addition, we theoretically proved that our model according with spectral clustering theory. Meanwhile, we use the proposed non-linear coders as the building blocks to formulate a deep structure to further refine features of layer wise fashion. Extensive experiments on clustering tasks demonstrate that our method performs well in terms of both clustering accuracy and normalized mutual information( NMI )