Multiple Partitioning of Multiplex Signed Networks: Application to European Parliament Votes
arXiv:1811.10337 · doi:10.1016/j.socnet.2019.02.001
Abstract
For more than a decade, graphs have been used to model the voting behavior taking place in parliaments. However, the methods described in the literature suffer from several limitations. The two main ones are that 1) they rely on some temporal integration of the raw data, which causes some information loss, and/or 2) they identify groups of antagonistic voters, but not the context associated to their occurrence. In this article, we propose a novel method taking advantage of multiplex signed graphs to solve both these issues. It consists in first partitioning separately each layer, before grouping these partitions by similarity. We show the interest of our approach by applying it to a European Parliament dataset.
arXiv commentSocial Networks, 2020, 60, 83 - 102
References in corpus (15)
- Finding and evaluating community structure in networks
- Community detection in graphs
- Natural Scales in Geographical Patterns
- Multilayer Networks
- Community Structure in Time-Dependent, Multiscale, and Multiplex Networks
- Consensus clustering in complex networks
- Community detection for correlation matrices
- Significant Scales in Community Structure
- A network-based prediction of retail stores commercial categories and optimal locations
- Community Structure in the United Nations General Assembly
- Justice blocks and predictability of US Supreme Court votes
- Voting Behavior, Coalitions and Government Strength through a Complex Network Analysis
- Generalized Measures for the Evaluation of Community Detection Methods
- Synchronization over and community detection in multiplex signed networks with constraints
- Relevance of Negative Links in Graph Partitioning: A Case Study Using Votes From the European Parliament
Cited by in corpus (3)
- Detecting coalitions by optimally partitioning signed networks of political collaboration
- Characterizing and comparing external measures for the assessment of cluster analysis and community detection
- Multiplicity and Diversity: Analyzing the Optimal Solution Space of the Correlation Clustering Problem on Complete Signed Graphs