Overlapping Community Detection in Temporal Text Networks

• URL: http://arxiv.org/abs/2101.05137v1
• Date: Wed, 13 Jan 2021 15:32:39 GMT
• Title: Overlapping Community Detection in Temporal Text Networks
• Authors: Shuhan Yan, Yuting Jia, Xinbing Wang
• Abstract summary: 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.
• Score: 26.489288530629892
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Analyzing the groups in the network based on same attributes, functions or connections between nodes is a way to understand network information. The task of discovering a series of node groups is called community detection. Generally, two types of information can be utilized to fulfill this task, i.e., the link structures and the node attributes. The temporal text network is a special kind of network that contains both sources of information. Typical representatives include online blog networks, the World Wide Web (WWW) and academic citation networks. In this paper, 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 and discover that nodes in the same community share similar textual contents. This scenario cannot be quantitatively modeled by practically all existing community detection methods. Motivated by these empirical observations, we propose MAGIC (Model Affiliation Graph with Interacting Communities), a generative model which captures community interactions and considers the information from both link structures and node attributes. Our experiments on 3 types of datasets show that MAGIC achieves large improvements over 4 state-of-the-art methods in terms of 4 widely-used metrics.

Related papers

• CS-TGN: Community Search via Temporal Graph Neural Networks [0.0]
  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.
  arXiv  Detail & Related papers  (2023-03-15T22:23:32Z)
• 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)
• TeKo: Text-Rich Graph Neural Networks with External Knowledge [75.91477450060808]
  We propose a novel text-rich graph neural network with external knowledge (TeKo) We first present a flexible heterogeneous semantic network that incorporates high-quality entities. We then introduce two types of external knowledge, that is, structured triplets and unstructured entity description.
  arXiv  Detail & Related papers  (2022-06-15T02:33:10Z)
• Evidential Temporal-aware Graph-based Social Event Detection via Dempster-Shafer Theory [76.4580340399321]
  We propose ETGNN, a novel Evidential Temporal-aware Graph Neural Network. We construct view-specific graphs whose nodes are the texts and edges are determined by several types of shared elements respectively. Considering the view-specific uncertainty, the representations of all views are converted into mass functions through evidential deep learning (EDL) neural networks.
  arXiv  Detail & Related papers  (2022-05-24T16:22:40Z)
• Heterformer: Transformer-based Deep Node Representation Learning on Heterogeneous Text-Rich Networks [29.33447325640058]
  Heterformer performs contextualized text encoding and heterogeneous structure encoding in a unified model. We conduct comprehensive experiments on three tasks (i.e., link prediction, node classification, and node clustering) on three large-scale datasets.
  arXiv  Detail & Related papers  (2022-05-20T16:26:39Z)
• 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 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)
• Graph Prototypical Networks for Few-shot Learning on Attributed Networks [72.31180045017835]
  We propose a graph meta-learning framework -- Graph Prototypical Networks (GPN) GPN is able to perform textitmeta-learning on an attributed network and derive a highly generalizable model for handling the target classification task.
  arXiv  Detail & Related papers  (2020-06-23T04:13:23Z)
• 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)
• FONDUE: A Framework for Node Disambiguation Using Network Embeddings [17.118125020178162]
  In their simplest form, networks represent real-life entities (e.g. people, papers, proteins, concepts) as nodes. This paper focuses on the common problem where a node in the network in fact corresponds to multiple real-life entities. We introduce FONDUE, an algorithm based on network embedding for node disambiguation.
  arXiv  Detail & Related papers  (2020-02-24T09:34:18Z)

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.