CS-MLGCN : Multiplex Graph Convolutional Networks for Community Search
in Multiplex Networks
- URL: http://arxiv.org/abs/2210.08811v1
- Date: Mon, 17 Oct 2022 07:47:19 GMT
- Title: CS-MLGCN : Multiplex Graph Convolutional Networks for Community Search
in Multiplex Networks
- Authors: Ali Behrouz, Farnoosh Hashemi
- Abstract summary: 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.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Community Search (CS) is one of the fundamental tasks in network science and
has attracted much attention due to its ability to discover personalized
communities with a wide range of applications. Given any query nodes, CS seeks
to find a densely connected subgraph containing query nodes. Most existing
approaches usually study networks with a single type of proximity between
nodes, which defines a single view of a network. However, in many applications
such as biological, social, and transportation networks, interactions between
objects span multiple aspects, yielding networks with multiple views, called
multiplex networks. Existing CS approaches in multiplex networks adopt
pre-defined subgraph patterns to model the communities, which cannot find
communities that do not have such pre-defined patterns in real-world networks.
In this paper, we propose a query-driven graph convolutional network in
multiplex networks, CS-MLGCN, that can capture flexible community structures by
learning from the ground-truth communities in a data-driven fashion. CS-MLGCN
first combines the local query-dependent structure and global graph embedding
in each type of proximity and then uses an attention mechanism to incorporate
information on different types of relations. Experiments on real-world graphs
with ground-truth communities validate the quality of the solutions we obtain
and the efficiency of our model.
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) - 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) - Semi-Supervised Deep Learning for Multiplex Networks [20.671777884219555]
Multiplex networks are complex graph structures in which a set of entities are connected to each other via multiple types of relations.
We present a novel semi-supervised approach for structure-aware representation learning on multiplex networks.
arXiv Detail & Related papers (2021-10-05T13:37:43Z) - mGNN: Generalizing the Graph Neural Networks to the Multilayer Case [0.0]
We propose mGNN, a framework meant to generalize GNNs to multi-layer networks.
Our approach is general (i.e., not task specific) and has the advantage of extending any type of GNN without any computational overhead.
We test the framework into three different tasks (node and network classification, link prediction) to validate it.
arXiv Detail & Related papers (2021-09-21T12:02:12Z) - Reinforced Neighborhood Selection Guided Multi-Relational Graph Neural
Networks [68.9026534589483]
RioGNN is a novel Reinforced, recursive and flexible neighborhood selection guided multi-relational Graph Neural Network architecture.
RioGNN can learn more discriminative node embedding with enhanced explainability due to the recognition of individual importance of each relation.
arXiv Detail & Related papers (2021-04-16T04:30:06Z) - 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) - Spatio-Temporal Inception Graph Convolutional Networks for
Skeleton-Based Action Recognition [126.51241919472356]
We design a simple and highly modularized graph convolutional network architecture for skeleton-based action recognition.
Our network is constructed by repeating a building block that aggregates multi-granularity information from both the spatial and temporal paths.
arXiv Detail & Related papers (2020-11-26T14:43:04Z) - 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) - Unsupervised Differentiable Multi-aspect Network Embedding [52.981277420394846]
We propose a novel end-to-end framework for multi-aspect network embedding, called asp2vec.
Our proposed framework can be readily extended to heterogeneous networks.
arXiv Detail & Related papers (2020-06-07T19:26:20Z) - 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.