CS-MLGCN : Multiplex Graph Convolutional Networks for Community Search in Multiplex Networks
Ali Behrouz, Farnoosh Hashemi

TL;DR
This paper introduces CS-MLGCN, a novel graph convolutional network that effectively identifies personalized communities in multiplex networks by learning flexible community structures through a data-driven, query-dependent approach.
Contribution
It proposes a query-driven multiplex graph convolutional network that captures flexible community structures without relying on pre-defined patterns, improving community search in multiplex networks.
Findings
Outperforms existing methods on real-world multiplex networks.
Effectively captures diverse community structures.
Demonstrates high efficiency and accuracy in community detection.
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
