CS-TGN: Community Search via Temporal Graph Neural Networks

• URL: http://arxiv.org/abs/2303.08964v1
• Date: Wed, 15 Mar 2023 22:23:32 GMT
• Title: CS-TGN: Community Search via Temporal Graph Neural Networks
• Authors: Farnoosh Hashemi and Ali Behrouz and Milad Rezaei Hajidehi
• Abstract summary: We propose a query-driven Temporal Graph Convolutional Network (CS-TGN) that can capture flexible community structures. CS-TGN first combines the local query-dependent structure and the global graph embedding in each snapshot of the network. We demonstrate how this model can be used for interactive community search in an online setting.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Searching for local communities is an important research challenge that allows for personalized community discovery and supports advanced data analysis in various complex networks, such as the World Wide Web, social networks, and brain networks. The evolution of these networks over time has motivated several recent studies to identify local communities in temporal networks. Given any query nodes, Community Search aims to find a densely connected subgraph containing query nodes. However, existing community search approaches in temporal networks have two main limitations: (1) they adopt pre-defined subgraph patterns to model communities, which cannot find communities that do not conform to these patterns in real-world networks, and (2) they only use the aggregation of disjoint structural information to measure quality, missing the dynamic of connections and temporal properties. In this paper, we propose a query-driven Temporal Graph Convolutional Network (CS-TGN) that can capture flexible community structures by learning from the ground-truth communities in a data-driven manner. CS-TGN first combines the local query-dependent structure and the global graph embedding in each snapshot of the network and then uses a GRU cell with contextual attention to learn the dynamics of interactions and update node embeddings over time. We demonstrate how this model can be used for interactive community search in an online setting, allowing users to evaluate the found communities and provide feedback. Experiments on real-world temporal graphs with ground-truth communities validate the superior quality of the solutions obtained and the efficiency of our model in both temporal and interactive static settings.

Related papers

• Learning Persistent Community Structures in Dynamic Networks via Topological Data Analysis [2.615648035076649]
  We propose a novel deep graph clustering framework with temporal consistency regularization on inter-community structures. MFC is a matrix factorization-based deep graph clustering algorithm that preserves node embedding. TopoReg is introduced to ensure the preservation of topological similarity between inter-community structures over time intervals.
  arXiv  Detail & Related papers  (2024-01-06T11:29:19Z)
• MGTCOM: Community Detection in Multimodal Graphs [0.34376560669160383]
  MGTCOM is an end-to-end framework optimizing network embeddings, communities and the number of communities in tandem. Our method is competitive against state-of-the-art and performs well in inductive inference.
  arXiv  Detail & Related papers  (2022-11-10T16:11:03Z)
• CS-MLGCN : Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks [0.0]
  We propose a query-driven graph convolutional network in multiplex networks, CS-MLGCN, that can capture flexible community structures. Experiments on real-world graphs with ground-truth communities validate the quality of the solutions we obtain.
  arXiv  Detail & Related papers  (2022-10-17T07:47:19Z)
• META-CODE: Community Detection via Exploratory Learning in Topologically Unknown Networks [5.299515147443958]
  META-CODE is an end-to-end solution for detecting overlapping communities in networks with unknown topology. It consists of three steps: 1) initial network inference, 2) node-level community-affiliation embedding based on graph neural networks (GNNs) trained by our new reconstruction loss, and 3) network exploration via community-affiliation-based node queries.
  arXiv  Detail & Related papers  (2022-08-23T15:02:48Z)
• 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)
• QD-GCN: Query-Driven Graph Convolutional Networks for Attributed Community Search [54.42038098426504]
  QD-GCN is an end-to-end framework that unifies the community structure as well as node attributes to solve the ACS problem. We show that QD-GCN outperforms existing attributed community search algorithms in terms of both efficiency and effectiveness.
  arXiv  Detail & Related papers  (2021-04-08T07:52:48Z)
• Overlapping Community Detection in Temporal Text Networks [26.489288530629892]
  We study the problem of overlapping community detection in temporal text network. By examining 32 large temporal text networks, we find a lot of edges connecting two nodes with no common community. Motivated by these empirical observations, we propose MAGIC, a generative model which captures community interactions.
  arXiv  Detail & Related papers  (2021-01-13T15:32:39Z)
• A Survey of Community Detection Approaches: From Statistical Modeling to Deep Learning [95.27249880156256]
  We develop and present a unified architecture of network community-finding methods. We introduce a new taxonomy that divides the existing methods into two categories, namely probabilistic graphical model and deep learning. We conclude with discussions of the challenges of the field and suggestions of possible directions for future research.
  arXiv  Detail & Related papers  (2021-01-03T02:32:45Z)
• 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)
• Deep Learning for Community Detection: Progress, Challenges and Opportunities [79.26787486888549]
  Article summarizes the contributions of the various frameworks, models, and algorithms in deep neural networks. This article summarizes the contributions of the various frameworks, models, and algorithms in deep neural networks.
  arXiv  Detail & Related papers  (2020-05-17T11:22:11Z)
• Detecting Communities in Heterogeneous Multi-Relational Networks:A Message Passing based Approach [89.19237792558687]
  Community is a common characteristic of networks including social networks, biological networks, computer and information networks. We propose an efficient message passing based algorithm to simultaneously detect communities for all homogeneous networks.
  arXiv  Detail & Related papers  (2020-04-06T17:36: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.