Clustering multilayer graphs with missing nodes

• URL: http://arxiv.org/abs/2103.03235v1
• Date: Thu, 4 Mar 2021 18:56:59 GMT
• Title: Clustering multilayer graphs with missing nodes
• Authors: Guillaume Braun, Hemant Tyagi, Christophe Biernacki
• Abstract summary: Clustering is a fundamental problem in network analysis where the goal is to regroup nodes with similar connectivity profiles. We propose a new framework that allows for layers to be defined on different sets of nodes.
• Score: 4.007017852999008
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Relationship between agents can be conveniently represented by graphs. When these relationships have different modalities, they are better modelled by multilayer graphs where each layer is associated with one modality. Such graphs arise naturally in many contexts including biological and social networks. Clustering is a fundamental problem in network analysis where the goal is to regroup nodes with similar connectivity profiles. In the past decade, various clustering methods have been extended from the unilayer setting to multilayer graphs in order to incorporate the information provided by each layer. While most existing works assume - rather restrictively - that all layers share the same set of nodes, we propose a new framework that allows for layers to be defined on different sets of nodes. In particular, the nodes not recorded in a layer are treated as missing. Within this paradigm, we investigate several generalizations of well-known clustering methods in the complete setting to the incomplete one and prove some consistency results under the Multi-Layer Stochastic Block Model assumption. Our theoretical results are complemented by thorough numerical comparisons between our proposed algorithms on synthetic data, and also on real datasets, thus highlighting the promising behaviour of our methods in various settings.

Related papers

• Spectral Clustering of Attributed Multi-relational Graphs [11.486261673963392]
  Graph clustering aims at discovering a natural grouping of the nodes such as similar nodes are assigned to a common cluster. We propose SpectralMix, a joint dimensionality reduction technique for multi-relational graphs with categorical node attributes.
  arXiv  Detail & Related papers  (2023-11-03T11:05:29Z)
• Learning the Right Layers: a Data-Driven Layer-Aggregation Strategy for Semi-Supervised Learning on Multilayer Graphs [2.752817022620644]
  Clustering (or community detection) on multilayer graphs poses several additional complications. One of the major challenges is to establish the extent to which each layer contributes to the cluster iteration assignment. We propose a parameter-free Laplacian-regularized model that learns an optimal nonlinear combination of the different layers from the available input labels.
  arXiv  Detail & Related papers  (2023-05-31T19:50:11Z)
• A Robust Stacking Framework for Training Deep Graph Models with Multifaceted Node Features [61.92791503017341]
  Graph Neural Networks (GNNs) with numerical node features and graph structure as inputs have demonstrated superior performance on various supervised learning tasks with graph data. The best models for such data types in most standard supervised learning settings with IID (non-graph) data are not easily incorporated into a GNN. Here we propose a robust stacking framework that fuses graph-aware propagation with arbitrary models intended for IID data.
  arXiv  Detail & Related papers  (2022-06-16T22:46:33Z)
• SHGNN: Structure-Aware Heterogeneous Graph Neural Network [77.78459918119536]
  This paper proposes a novel Structure-Aware Heterogeneous Graph Neural Network (SHGNN) to address the above limitations. We first utilize a feature propagation module to capture the local structure information of intermediate nodes in the meta-path. Next, we use a tree-attention aggregator to incorporate the graph structure information into the aggregation module on the meta-path. Finally, we leverage a meta-path aggregator to fuse the information aggregated from different meta-paths.
  arXiv  Detail & Related papers  (2021-12-12T14:18:18Z)
• Semi-Supervised Deep Learning for Multiplex Networks [20.671777884219555]
  Multiplex networks are complex graph structures in which a set of entities are connected to each other via multiple types of relations. We present a novel semi-supervised approach for structure-aware representation learning on multiplex networks.
  arXiv  Detail & Related papers  (2021-10-05T13:37:43Z)
• Attention-driven Graph Clustering Network [49.040136530379094]
  We propose a novel deep clustering method named Attention-driven Graph Clustering Network (AGCN) AGCN exploits a heterogeneous-wise fusion module to dynamically fuse the node attribute feature and the topological graph feature. AGCN can jointly perform feature learning and cluster assignment in an unsupervised fashion.
  arXiv  Detail & Related papers  (2021-08-12T02:30:38Z)
• Learning Hierarchical Graph Neural Networks for Image Clustering [81.5841862489509]
  We propose a hierarchical graph neural network (GNN) model that learns how to cluster a set of images into an unknown number of identities. Our hierarchical GNN uses a novel approach to merge connected components predicted at each level of the hierarchy to form a new graph at the next level.
  arXiv  Detail & Related papers  (2021-07-03T01:28:42Z)
• Global and Individualized Community Detection in Inhomogeneous Multilayer Networks [14.191073951237772]
  In network applications, it has become increasingly common to obtain datasets in the form of multiple networks observed on the same set of subjects. Such datasets can be modeled by multilayer networks where each layer is a separate network itself while different layers are associated and share some common information. The present paper studies community detection in a stylized yet informative inhomogeneous multilayer network model.
  arXiv  Detail & Related papers  (2020-12-02T02:42:52Z)
• Learning Multi-layer Graphs and a Common Representation for Clustering [13.90938823562779]
  We focus on graph learning from multi-view data of shared entities for spectral clustering. We propose an efficient solver based on alternating minimization to solve the problem. Numerical experiments on synthetic and real datasets demonstrate that the proposed algorithm outperforms state-of-the-art multi-view clustering techniques.
  arXiv  Detail & Related papers  (2020-10-23T11:12:43Z)
• Unsupervised Differentiable Multi-aspect Network Embedding [52.981277420394846]
  We propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec. Our proposed framework can be readily extended to heterogeneous networks.
  arXiv  Detail & Related papers  (2020-06-07T19:26:20Z)
• Graph Neural Networks with Composite Kernels [60.81504431653264]
  We re-interpret node aggregation from the perspective of kernel weighting. We present a framework to consider feature similarity in an aggregation scheme. We propose feature aggregation as the composition of the original neighbor-based kernel and a learnable kernel to encode feature similarities in a feature space.
  arXiv  Detail & Related papers  (2020-05-16T04:44:29Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.