Learning Deep Representations for Graph Clustering

Citations Over TimeTop 1% of 2014 papers

Abstract

Recently deep learning has been successfully adopted in many applications such as speech recognition and image classification. In this work, we explore the possibility of employing deep learning in graph clustering. We propose a simple method, which first learns a nonlinear embedding of the original graph by stacked autoencoder, and then runs $k$-means algorithm on the embedding to obtain the clustering result. We show that this simple method has solid theoretical foundation, due to the similarity between autoencoder and spectral clustering in terms of what they actually optimize. Then, we demonstrate that the proposed method is more efficient and flexible than spectral clustering. First, the computational complexity of autoencoder is much lower than spectral clustering: the former can be linear to the number of nodes in a sparse graph while the latter is super quadratic due to eigenvalue decomposition. Second, when additional sparsity constraint is imposed, we can simply employ the sparse autoencoder developed in the literature of deep learning; however, it is non-straightforward to implement a sparse spectral method. The experimental results on various graph datasets show that the proposed method significantly outperforms conventional spectral clustering which clearly indicates the effectiveness of deep learning in graph clustering.

Related Papers

• → Multi-view spectral clustering via integrating nonnegative embedding and spectral embedding(2019)226 cited
• → Embedding of Complete graphs and Cycles into Grids with holes(2020)1 cited
• → Embedding complete multi-partite graphs into Cartesian product of paths and cycles(2021)1 cited
• → Planarity Testing and Optimal Edge Insertion with Embedding Constraints(2007)3 cited
• → Embedding complete multi-partite graphs into Cartesian product of paths and cycles(2019)2 cited