Joint Learning of Hierarchical Community Structure and Node Representations: An Unsupervised Approach

• URL: http://arxiv.org/abs/2201.09086v1
• Date: Sat, 22 Jan 2022 15:48:10 GMT
• Title: Joint Learning of Hierarchical Community Structure and Node Representations: An Unsupervised Approach
• Authors: Ancy Sarah Tom, Nesreen K. Ahmed, and George Karypis
• Abstract summary: We present Mazi, an algorithm that jointly learns the hierarchical community structure and the node representations of the graph in an unsupervised fashion. We evaluate our method on a variety of synthetic and real-world graphs and demonstrate that Mazi outperforms other hierarchical and non-hierarchical methods.
• Score: 15.379817564640712
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Graph representation learning has demonstrated improved performance in tasks such as link prediction and node classification across a range of domains. Research has shown that many natural graphs can be organized in hierarchical communities, leading to approaches that use these communities to improve the quality of node representations. However, these approaches do not take advantage of the learned representations to also improve the quality of the discovered communities and establish an iterative and joint optimization of representation learning and community discovery. In this work, we present Mazi, an algorithm that jointly learns the hierarchical community structure and the node representations of the graph in an unsupervised fashion. To account for the structure in the node representations, Mazi generates node representations at each level of the hierarchy, and utilizes them to influence the node representations of the original graph. Further, the communities at each level are discovered by simultaneously maximizing the modularity metric and minimizing the distance between the representations of a node and its community. Using multi-label node classification and link prediction tasks, we evaluate our method on a variety of synthetic and real-world graphs and demonstrate that Mazi outperforms other hierarchical and non-hierarchical methods.

Related papers

• Cost-Effective Community-Hierarchy-Based Mutual Voting Approach for Influence Maximization in Complex Networks [54.366995393644586]
  Real-world usually have high requirements on the balance between time and accuracy of influential nodes identification. This article proposes a novel approach called Cost-Effective Community-Hierarchy-Based Mutual Voting for influence in complex networks. The proposed approach outperforms 16 state-of-the-art techniques on the balance between time complexity and accuracy of influential nodes identification.
  arXiv  Detail & Related papers  (2024-09-21T06:32:28Z)
• Differential Encoding for Improved Representation Learning over Graphs [15.791455338513815]
  A message-passing paradigm and a global attention mechanism fundamentally generate node embeddings. It is unknown if the dominant information is from a node itself or from the node's neighbours. We present a differential encoding method to address the issue of information lost.
  arXiv  Detail & Related papers  (2024-07-03T02:23:33Z)
• DGNN: Decoupled Graph Neural Networks with Structural Consistency between Attribute and Graph Embedding Representations [62.04558318166396]
  Graph neural networks (GNNs) demonstrate a robust capability for representation learning on graphs with complex structures. A novel GNNs framework, dubbed Decoupled Graph Neural Networks (DGNN), is introduced to obtain a more comprehensive embedding representation of nodes. Experimental results conducted on several graph benchmark datasets verify DGNN's superiority in node classification task.
  arXiv  Detail & Related papers  (2024-01-28T06:43:13Z)
• A Variational Edge Partition Model for Supervised Graph Representation Learning [51.30365677476971]
  This paper introduces a graph generative process to model how the observed edges are generated by aggregating the node interactions over a set of overlapping node communities. We partition each edge into the summation of multiple community-specific weighted edges and use them to define community-specific GNNs. A variational inference framework is proposed to jointly learn a GNN based inference network that partitions the edges into different communities, these community-specific GNNs, and a GNN based predictor that combines community-specific GNNs for the end classification task.
  arXiv  Detail & Related papers  (2022-02-07T14:37:50Z)
• Graph Embedding with Hierarchical Attentive Membership [35.998704625736394]
  A latent hierarchical grouping of nodes exists in a global perspective, where each node manifests its membership to a specific group. Most prior works ignore such latent groups and nodes' membership to different groups, not to mention the hierarchy, when modeling the neighborhood structure. We propose a novel hierarchical attentive membership model for graph embedding, where the latent memberships for each node are dynamically discovered based on its neighboring context.
  arXiv  Detail & Related papers  (2021-10-31T22:00:48Z)
• HeMI: Multi-view Embedding in Heterogeneous Graphs [8.87527266373087]
  representation learning of heterogeneous graphs (HGs) embeds the rich structure and semantics of such graphs into a low-dimensional space. We propose a self-supervised method that learns HG representations by relying on knowledge exchange and discovery among different HG structural semantics. We show that the proposed self-supervision both outperforms and improves competing methods by 1% and up to 10% for all tasks.
  arXiv  Detail & Related papers  (2021-09-14T23:04:42Z)
• Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural Networks [68.9026534589483]
  RioGNN is a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture. RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation.
  arXiv  Detail & Related papers  (2021-04-16T04:30:06Z)
• CommPOOL: An Interpretable Graph Pooling Framework for Hierarchical Graph Representation Learning [74.90535111881358]
  We propose a new interpretable graph pooling framework - CommPOOL. It can capture and preserve the hierarchical community structure of graphs in the graph representation learning process. CommPOOL is a general and flexible framework for hierarchical graph representation learning.
  arXiv  Detail & Related papers  (2020-12-10T21:14:18Z)
• Graph InfoClust: Leveraging cluster-level node information for unsupervised graph representation learning [12.592903558338444]
  We propose a graph representation learning method called Graph InfoClust. It seeks to additionally capture cluster-level information content. This optimization leads the node representations to capture richer information and nodal interactions, which improves their quality.
  arXiv  Detail & Related papers  (2020-09-15T09:33:20Z)
• Unsupervised Hierarchical Graph Representation Learning by Mutual Information Maximization [8.14036521415919]
  We present an unsupervised graph representation learning method, Unsupervised Hierarchical Graph Representation (UHGR) Our method focuses on maximizing mutual information between "local" and high-level "global" representations. The results show that the proposed method achieves comparable results to state-of-the-art supervised methods on several benchmarks.
  arXiv  Detail & Related papers  (2020-03-18T18:21:48Z)
• Graph Inference Learning for Semi-supervised Classification [50.55765399527556]
  We propose a Graph Inference Learning framework to boost the performance of semi-supervised node classification. For learning the inference process, we introduce meta-optimization on structure relations from training nodes to validation nodes. Comprehensive evaluations on four benchmark datasets demonstrate the superiority of our proposed GIL when compared against state-of-the-art methods.
  arXiv  Detail & Related papers  (2020-01-17T02:52:30Z)

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.