Clustering with Multi-Layer Graphs: A Spectral Perspective

Details Clustering with Multi-Layer Graphs: A Spectral Perspective Clustering with Multi-Layer Graphs: A Spectral Perspective

2011-06-11

arxiv.org/abs/1106.2233v1

Computer Science

Learning

Scientific paper

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 (users) with different edges (pairwise relationships). In this paper, we address the problem of combining different layers of the multi-layer graph for improved clustering of the vertices compared to using layers independently. We propose two novel methods, which are based on joint matrix factorization and 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 graphs, is used for clustering the vertices. We evaluate our approaches by simulations with several real world social network datasets. Results demonstrate the superior or competitive performance of the proposed methods over state-of-the-art technique and common baseline methods, such as co-regularization and summation of information from individual graphs.

Affiliated with

Also associated with

No associations

Rating

Clustering with Multi-Layer Graphs: A Spectral Perspective does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Clustering with Multi-Layer Graphs: A Spectral Perspective, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Clustering with Multi-Layer Graphs: A Spectral Perspective will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-414266