Abstract
Community detection in multilayer networks aims to identify groups of well-connected nodes across multiple layers. While existing methods have been developed to deal with large graphs with few layers (typically less than 10), many real-world datasets are structured by transitive relationships that give rise to networks with thousands of extremely dense layers (e.g. co-citation networks, IMDb actor graphs, co-reference information network, social net- works). In addition, in these datasets the layers are often associated with textual summaries which provide important and hitherto unexploited information on the nature of the relation encoded by the layer. In this paper, we propose a new method which exploits the text associated with the layers in order to identify communities grouping together nodes connected through several semantically close layers. The method consists in embedding layer textual information in an Euclidean space, and to use it to group together, in the same community, nodes belonging to semantically close layers. To that end, we develop a pattern mining approach that extracts communities from numerical data. This approach, which mixes both symbolic and numeric techniques, is particularly well suited to identify communities in multilayer graphs. Indeed, we show that it obtains more diverse and better quality communities than those obtained by state-of-the-art competitors on datasets where ground truth is known. We also show that taking into account the semantic information improves the quality of the communities.
Highlights
The search for communities in graphs has given rise to numerous research works [1]
We propose a new method which exploits the text associated with the layers in order to identify communities grouping together nodes connected through several semantically close layers
The paper presents four contribution: (1) the formalization of the problem of detecting communities in transitive multilayer networks associated with textual data, problems which are very widespread in practice; (2) the use of efficient NLP techniques to evaluate the similarity between two layers in a discriminating way; (3) the proposal of an original method which inherits from the mining of closed interval patterns to identify k diverse communities; (4) experiments which show the capacities of the proposed method to identify communities on three large very different datasets and with better results than the existing methods
Summary
The search for communities in graphs has given rise to numerous research works [1]. communities, or groups of nodes similar by their strong connectivity, make possible to structure a graph into fairly independent components that facilitate its analysis. Three real-world examples are considered in our experiments which illustrates the numerous real contexts where one has a multilayer graph with transitive relationships and where semantic information is associated to layers This information is valuable and can be used when building communities to group nodes that are often related to other nodes in layers that have similar characteristics. The paper presents four contribution: (1) the formalization of the problem of detecting communities in transitive multilayer networks associated with textual data, problems which are very widespread in practice; (2) the use of efficient NLP techniques to evaluate the similarity between two layers in a discriminating way; (3) the proposal of an original method which inherits from the mining of closed interval patterns to identify k diverse communities; (4) experiments which show the capacities of the proposed method to identify communities on three large very different datasets and with better results than the existing methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Proceedings of the Canadian Conference on Artificial Intelligence
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.