Group-Node Attention for Community Evolution Prediction

• URL: http://arxiv.org/abs/2107.04522v1
• Date: Fri, 9 Jul 2021 16:16:10 GMT
• Title: Group-Node Attention for Community Evolution Prediction
• Authors: Matt Revelle, Carlotta Domeniconi, Ben Gelman
• Abstract summary: We present a novel graph neural network for predicting community evolution events from structural and temporal information. A comparative evaluation with standard baseline methods is performed and we demonstrate that our model outperforms the baselines.
• Score: 9.777369108179501
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Communities in social networks evolve over time as people enter and leave the network and their activity behaviors shift. The task of predicting structural changes in communities over time is known as community evolution prediction. Existing work in this area has focused on the development of frameworks for defining events while using traditional classification methods to perform the actual prediction. We present a novel graph neural network for predicting community evolution events from structural and temporal information. The model (GNAN) includes a group-node attention component which enables support for variable-sized inputs and learned representation of groups based on member and neighbor node features. A comparative evaluation with standard baseline methods is performed and we demonstrate that our model outperforms the baselines. Additionally, we show the effects of network trends on model performance.

Related papers

• Hierarchical-Graph-Structured Edge Partition Models for Learning Evolving Community Structure [0.9208007322096532]
  We propose a novel dynamic network model to capture evolving latent communities within temporal networks. Our model enables the inferred community structure to merge, split, and interact with one another, providing a comprehensive understanding of complex network dynamics.
  arXiv  Detail & Related papers  (2024-11-18T12:48:15Z)
• Out-of-Distribution Generalized Dynamic Graph Neural Network with Disentangled Intervention and Invariance Promotion [61.751257172868186]
  Dynamic graph neural networks (DyGNNs) have demonstrated powerful predictive abilities by exploiting graph and temporal dynamics. Existing DyGNNs fail to handle distribution shifts, which naturally exist in dynamic graphs.
  arXiv  Detail & Related papers  (2023-11-24T02:42:42Z)
• Enhance Ambiguous Community Structure via Multi-strategy Community Related Link Prediction Method with Evolutionary Process [7.239725647907488]
  We design a new community attribute based link prediction strategy HAP. This paper aims at providing a community enhancement measure through adding links to clarify ambiguous community structures. The experimental results on twelve real-world datasets with ground truth community indicate that the proposed link prediction method outperforms other baseline methods.
  arXiv  Detail & Related papers  (2022-04-28T06:24:16Z)
• Preference Enhanced Social Influence Modeling for Network-Aware Cascade Prediction [59.221668173521884]
  We propose a novel framework to promote cascade size prediction by enhancing the user preference modeling. Our end-to-end method makes the user activating process of information diffusion more adaptive and accurate.
  arXiv  Detail & Related papers  (2022-04-18T09:25:06Z)
• 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)
• A Comprehensive Survey on Community Detection with Deep Learning [93.40332347374712]
  A community reveals the features and connections of its members that are different from those in other communities in a network. This survey devises and proposes a new taxonomy covering different categories of the state-of-the-art methods. The main category, i.e., deep neural networks, is further divided into convolutional networks, graph attention networks, generative adversarial networks and autoencoders.
  arXiv  Detail & Related papers  (2021-05-26T14:37:07Z)
• On the Impact of Communities on Semi-supervised Classification Using Graph Neural Networks [0.5872014229110213]
  We systematically study the impact of community structure on the performance of GNNs in semi-supervised node classification on graphs. Our results suggest that communities typically have a major impact on the learning process and classification performance.
  arXiv  Detail & Related papers  (2020-10-30T13:17:38Z)
• Amortized Probabilistic Detection of Communities in Graphs [39.56798207634738]
  We propose a simple framework for amortized community detection. We combine the expressive power of GNNs with recent methods for amortized clustering. We evaluate several models from our framework on synthetic and real datasets.
  arXiv  Detail & Related papers  (2020-10-29T16:18:48Z)
• On the use of local structural properties for improving the efficiency of hierarchical community detection methods [77.34726150561087]
  We study how local structural network properties can be used as proxies to improve the efficiency of hierarchical community detection. We also check the performance impact of network prunings as an ancillary tactic to make hierarchical community detection more efficient.
  arXiv  Detail & Related papers  (2020-09-15T00:16:12Z)
• GRADE: Graph Dynamic Embedding [76.85156209917932]
  GRADE is a probabilistic model that learns to generate evolving node and community representations by imposing a random walk prior to their trajectories. Our model also learns node community membership which is updated between time steps via a transition matrix. Experiments demonstrate GRADE outperforms baselines in dynamic link prediction, shows favourable performance on dynamic community detection, and identifies coherent and interpretable evolving communities.
  arXiv  Detail & Related papers  (2020-07-16T01:17:24Z)

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.