The Power Mean Laplacian for Multilayer Graph Clustering
Multilayer graphs encode different kind of interactions between the same set of entities. When one wants to cluster such a multilayer graph, the natural question arises how one should merge the information different layers. We introduce in this paper a one-parameter family of matrix power means for merging the Laplacians from different layers and analyze it in expectation in the stochastic block model. We show that this family allows to recover ground truth clusters under different settings and verify this in real world data. While computing the matrix power mean can be very expensive for large graphs, we introduce a numerical scheme to efficiently compute its eigenvectors for the case of large sparse graphs.
Code (1)
Tasks
ClusteringGraph ClusteringStochastic Block ModelSimilar Papers 제목 키워드 기반
Spectral Clustering of Signed Graphs via Matrix Power Means
Signed graphs encode positive (attractive) and negative (repulsive) relations between nodes. We extend spectral clustering to signed graphs via the one-parameter family of Signed Power Mean Laplacians, defined as the mat…
ClusteringStochastic Block ModelMultilayer Graph Clustering with Optimized Node Embedding
We are interested in multilayer graph clustering, which aims at dividing the graph nodes into categories or communities. To do so, we propose to learn a clustering-friendly embedding of the graph nodes by solving an opti…
ClusteringGraph ClusteringOrthoNet: Multilayer Network Data Clustering
Network data appears in very diverse applications, like biological, social, or sensor networks. Clustering of network nodes into categories or communities has thus become a very common task in machine learning and data m…
ClusteringGraph ClusteringNode ClusteringThe Laplacian K-modes algorithm for clustering
In addition to finding meaningful clusters, centroid-based clustering algorithms such as K-means or mean-shift should ideally find centroids that are valid patterns in the input space, representative of data in their clu…
ClusteringvalidMultilayer Graph Approach to Deep Subspace Clustering
Deep subspace clustering (DSC) networks based on self-expressive model learn representation matrix, often implemented in terms of fully connected network, in the embedded space. After the learning is finished, representa…
Clustering