Detecting Communities from Heterogeneous Graphs: A Context Path-based Graph Neural Network Model

by   Linhao Luo, et al.

Community detection, aiming to group the graph nodes into clusters with dense inner-connection, is a fundamental graph mining task. Recently, it has been studied on the heterogeneous graph, which contains multiple types of nodes and edges, posing great challenges for modeling the high-order relationship between nodes. With the surge of graph embedding mechanism, it has also been adopted to community detection. A remarkable group of works use the meta-path to capture the high-order relationship between nodes and embed them into nodes' embedding to facilitate community detection. However, defining meaningful meta-paths requires much domain knowledge, which largely limits their applications, especially on schema-rich heterogeneous graphs like knowledge graphs. To alleviate this issue, in this paper, we propose to exploit the context path to capture the high-order relationship between nodes, and build a Context Path-based Graph Neural Network (CP-GNN) model. It recursively embeds the high-order relationship between nodes into the node embedding with attention mechanisms to discriminate the importance of different relationships. By maximizing the expectation of the co-occurrence of nodes connected by context paths, the model can learn the nodes' embeddings that both well preserve the high-order relationship between nodes and are helpful for community detection. Extensive experimental results on four real-world datasets show that CP-GNN outperforms the state-of-the-art community detection methods.


page 1

page 2

page 3

page 4


GSim: A Graph Neural Network based Relevance Measure for Heterogeneous Graphs

Heterogeneous graphs, which contain nodes and edges of multiple types, a...

Heterogeneous Graph Neural Network for Recommendation

The prosperous development of e-commerce has spawned diverse recommendat...

Overlapping Community Detection with Graph Neural Networks

Community detection is a fundamental problem in machine learning. While ...

High-order Order Proximity-Incorporated, Symmetry and Graph-Regularized Nonnegative Matrix Factorization for Community Detection

Community describes the functional mechanism of a network, making commun...

Unsupervised Community Detection with Modularity-Based Attention Model

In this paper we take a problem of unsupervised nodes clustering on grap...

Hypercore Decomposition for Non-Fragile Hyperedges: Concepts, Algorithms, Observations, and Applications

Hypergraphs are a powerful abstraction for modeling high-order relations...

Graph Neural Network-Aided Exploratory Learning for Community Detection with Unknown Topology

In social networks, the discovery of community structures has received c...

Please sign up or login with your details

Forgot password? Click here to reset