Heterogeneous-Temporal Graph Convolutional Networks: Make the Community Detection Much Better

Abstract

Community detection has long been an important yet challenging task to analyze complex networks with a focus on detecting topological structures of graph data. Essentially, real-world graph data contains various features, node and edge types which dynamically vary over time, and this invalidates most existing community detection approaches. To cope with these issues, this paper proposes the heterogeneous-temporal graph convolutional networks (HTGCN) to detect communities from hetergeneous and temporal graphs. Particularly, we first design a heterogeneous GCN component to acquire feature representations for each heterogeneous graph at each time step. Then, a residual compressed aggregation component is proposed to represent "dynamic" features for "varying" communities, which are then aggregated with "static" features extracted from current graph. Extensive experiments are evaluated on two real-world datasets, i.e., DBLP and IMDB. The promising results demonstrate that the proposed HTGCN is superior to both benchmark and the state-of-the-art approaches, e.g., GCN, GAT, GNN, LGNN, HAN and STAR, with respect to a number of evaluation criteria.

References in corpus (9)

• Adam: A Method for Stochastic Optimization
• Community structure in social and biological networks
• Finding and evaluating community structure in networks
• Maps of random walks on complex networks reveal community structure
• Inductive Representation Learning on Large Graphs
• An Empirical Evaluation of Generic Convolutional and Recurrent Networks for Sequence Modeling
• xDeepFM: Combining Explicit and Implicit Feature Interactions for Recommender Systems
• Node Embedding over Temporal Graphs
• Fine-grained Event Categorization with Heterogeneous Graph Convolutional Networks