Towards Consistency and Complementarity: A Multiview Graph Information Bottleneck Approach

• URL: http://arxiv.org/abs/2210.05676v1
• Date: Tue, 11 Oct 2022 13:51:34 GMT
• Title: Towards Consistency and Complementarity: A Multiview Graph Information Bottleneck Approach
• Authors: Xiaolong Fan and Maoguo Gong and Yue Wu and Mingyang Zhang and Hao Li and Xiangming Jiang
• Abstract summary: How to model and integrate shared (i.e. consistency) and view-specific (i.e. complementarity) information is a key issue in multiview graph analysis. We propose a novel Multiview Variational Graph Information Bottleneck (MVGIB) principle to maximize the agreement for common representations and the disagreement for view-specific representations.
• Score: 25.40829979251883
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The empirical studies of Graph Neural Networks (GNNs) broadly take the original node feature and adjacency relationship as singleview input, ignoring the rich information of multiple graph views. To circumvent this issue, the multiview graph analysis framework has been developed to fuse graph information across views. How to model and integrate shared (i.e. consistency) and view-specific (i.e. complementarity) information is a key issue in multiview graph analysis. In this paper, we propose a novel Multiview Variational Graph Information Bottleneck (MVGIB) principle to maximize the agreement for common representations and the disagreement for view-specific representations. Under this principle, we formulate the common and view-specific information bottleneck objectives across multiviews by using constraints from mutual information. However, these objectives are hard to directly optimize since the mutual information is computationally intractable. To tackle this challenge, we derive variational lower and upper bounds of mutual information terms, and then instead optimize variational bounds to find the approximate solutions for the information objectives. Extensive experiments on graph benchmark datasets demonstrate the superior effectiveness of the proposed method.

Related papers

• Multiview Graph Learning with Consensus Graph [24.983233822595274]
  Graph topology inference is a significant task in many application domains. Many modern datasets are heterogeneous or mixed and involve multiple related graphs, i.e., multiview graphs. We propose an alternative method based on consensus regularization, where views are ensured to be similar. It is also employed to infer the functional brain connectivity networks of multiple subjects from their electroencephalogram (EEG) recordings.
  arXiv  Detail & Related papers  (2024-01-24T19:35:54Z)
• Learning Representations without Compositional Assumptions [79.12273403390311]
  We propose a data-driven approach that learns feature set dependencies by representing feature sets as graph nodes and their relationships as learnable edges. We also introduce LEGATO, a novel hierarchical graph autoencoder that learns a smaller, latent graph to aggregate information from multiple views dynamically.
  arXiv  Detail & Related papers  (2023-05-31T10:36:10Z)
• Multi-view Graph Convolutional Networks with Differentiable Node Selection [29.575611350389444]
  We propose a framework dubbed Multi-view Graph Convolutional Network with Differentiable Node Selection (MGCN-DNS) MGCN-DNS accepts multi-channel graph-structural data as inputs and aims to learn more robust graph fusion through a differentiable neural network. The effectiveness of the proposed method is verified by rigorous comparisons with considerable state-of-the-art approaches.
  arXiv  Detail & Related papers  (2022-12-09T21:48:36Z)
• Cross-view Graph Contrastive Representation Learning on Partially Aligned Multi-view Data [52.491074276133325]
  Multi-view representation learning has developed rapidly over the past decades and has been applied in many fields. We propose a new cross-view graph contrastive learning framework, which integrates multi-view information to align data and learn latent representations. Experiments conducted on several real datasets demonstrate the effectiveness of the proposed method on the clustering and classification tasks.
  arXiv  Detail & Related papers  (2022-11-08T09:19:32Z)
• Variational Graph Generator for Multi-View Graph Clustering [13.721803208437755]
  We propose Variational Graph Generator for Multi-View Graph Clustering (VGMGC) A novel variational graph generator is proposed to infer a reliable variational consensus graph based on a priori assumption over multiple graphs. A simple yet effective graph encoder in conjunction with the multi-view clustering objective is presented to learn the desired graph embeddings for clustering.
  arXiv  Detail & Related papers  (2022-10-13T13:19:51Z)
• r-GAT: Relational Graph Attention Network for Multi-Relational Graphs [8.529080554172692]
  Graph Attention Network (GAT) focuses on modelling simple undirected and single relational graph data only. We propose r-GAT, a relational graph attention network to learn multi-channel entity representations. Experiments on link prediction and entity classification tasks show that our r-GAT can model multi-relational graphs effectively.
  arXiv  Detail & Related papers  (2021-09-13T12:43:00Z)
• A Robust and Generalized Framework for Adversarial Graph Embedding [73.37228022428663]
  We propose a robust framework for adversarial graph embedding, named AGE. AGE generates the fake neighbor nodes as the enhanced negative samples from the implicit distribution. Based on this framework, we propose three models to handle three types of graph data.
  arXiv  Detail & Related papers  (2021-05-22T07:05:48Z)
• Auto-weighted Multi-view Feature Selection with Graph Optimization [90.26124046530319]
  We propose a novel unsupervised multi-view feature selection model based on graph learning. The contributions are threefold: (1) during the feature selection procedure, the consensus similarity graph shared by different views is learned. Experiments on various datasets demonstrate the superiority of the proposed method compared with the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-04-11T03:25:25Z)
• Multi-view Graph Learning by Joint Modeling of Consistency and Inconsistency [65.76554214664101]
  Graph learning has emerged as a promising technique for multi-view clustering with its ability to learn a unified and robust graph from multiple views. We propose a new multi-view graph learning framework, which for the first time simultaneously models multi-view consistency and multi-view inconsistency in a unified objective function. Experiments on twelve multi-view datasets have demonstrated the robustness and efficiency of the proposed approach.
  arXiv  Detail & Related papers  (2020-08-24T06:11:29Z)
• Graph Representation Learning via Graphical Mutual Information Maximization [86.32278001019854]
  We propose a novel concept, Graphical Mutual Information (GMI), to measure the correlation between input graphs and high-level hidden representations. We develop an unsupervised learning model trained by maximizing GMI between the input and output of a graph neural encoder.
  arXiv  Detail & Related papers  (2020-02-04T08:33:49Z)

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.