Clustering with multi-layer graphs: a spectral perspective

Journal article

Observational data usually comes with a multimodal nature, which means that it can be naturally represented by a multi-layer graph whose layers share the same set of vertices (objects) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer graph for an improved clustering of the vertices compared to using layers independently. We propose two novel methods, which are based on a joint matrix factorization and a graph regularization framework respectively, to efficiently combine the spectrum of the multiple graph layers, namely the eigenvectors of the graph Laplacian matrices. In each case, the resulting combination, which we call a “joint spectrum” of multiple layers, is used for clustering the vertices. We evaluate our approaches by experiments with several real world social network datasets. Results demonstrate the superior or competitive performance of the proposed methods compared to state-of-the-art techniques and common baseline methods, such as co-regularization and summation of information from individual graphs.

Authors: Dong, X; Frossard, P; Vandergheynst, P; Nefedov, N

• Publication status: Published
• Peer review status: Peer reviewed
• Publisher: IEEE
• Journal: IEEE Transactions on Signal Processing
• Volume: 60
• Issue: 11
• Pages: 5820-5831
• Publication date: 2012-11-01
• DOI: 10.1109/tsp.2012.2212886
• EISSN: 1941-0476
• ISSN: 1053-587X
• Keywords: spectrum of the graph; matrix factorization; FFR; graph-based regularization; multi-layer graphs; clustering