Multilayer Clustered Graph Learning
Multilayer graphs are appealing mathematical tools for modeling multiple types of relationship in the data. In this paper, we aim at analyzing multilayer graphs by properly combining the information provided by individual layers, while preserving the specific structure that allows us to eventually identify communities or clusters that are crucial in the analysis of graph data. To do so, we learn a clustered representative graph by solving an optimization problem that involves a data fidelity term to the observed layers, and a regularization pushing for a sparse and community-aware graph. We use the contrastive loss as a data fidelity term, in order to properly aggregate the observed layers into a representative graph. The regularization is based on a measure of graph sparsification called "effective resistance", coupled with a penalization of the first few eigenvalues of the representative graph Laplacian matrix to favor the formation of communities. The proposed optimization problem is nonconvex but fully differentiable, and thus can be solved via the projected gradient method. Experiments show that our method leads to a significant improvement w.r.t. state-of-the-art multilayer graph learning algorithms for solving clustering problems.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringGraph LearningSimilar Papers 제목 키워드 기반
Multilayer Spectral Graph Clustering via Convex Layer Aggregation: Theory and Algorithms
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. Non-standard multilayer graph clustering methods are needed for assigning cluste…
ClusteringGraph ClusteringSpectral Graph ClusteringMultilayer Spectral Graph Clustering via Convex Layer Aggregation
Multilayer graphs are commonly used for representing different relations between entities and handling heterogeneous data processing tasks. New challenges arise in multilayer graph clustering for assigning clusters to a …
ClusteringGraph ClusteringSpectral Graph ClusteringSignal Processing over Multilayer Graphs: Theoretical Foundations and Practical Applications
Signal processing over single-layer graphs has become a mainstream tool owing to its power in revealing obscure underlying structures within data signals. However, many real-life datasets and systems, {including those in…
Image Processing via Multilayer Graph Spectra
Graph signal processing (GSP) has become an important tool in image processing because of its ability to reveal underlying data structures. Many real-life multimedia datasets, however, exhibit heterogeneous structures ac…
Edge DetectionHyperspectral Image SegmentationImage CompressionImage Segmentation+1Classification and Online Clustering of Zero-Day Malware
A large amount of new malware is constantly being generated, which must not only be distinguished from benign samples, but also classified into malware families. For this purpose, investigating how existing malware famil…
ClassificationClusteringOnline Clustering