Learning Political DNA in the Italian Senate

Motivated by the increasing interest of the control community towards social sciences and the study of opinion formation and belief systems, in this paper we address the problem of exploiting voting data for inferring the underlying affinity of individuals to competing ideology groups. In particular, we mine key voting records of the Italian Senate during the XVII legislature, in order to extract the hidden information about the closeness of senators to political parties, based on a parsimonious feature extraction method that selects the most relevant bills. Modeling the voting data as outcomes of a mixture of random variables and using sparse learning techniques, we cast the problem in a probabilistic framework and derive an information theoretic measure, which we refer to as Political Data-aNalytic Affinity (Political DNA). The advantages of this new affinity measure are discussed in the paper. The results of the numerical analysis on voting data unveil underlying relationships among political exponents of the Italian Senate.

[1]  Noah E. Friedkin,et al.  The Problem of Social Control and Coordination of Complex Systems in Sociology: A Look at the Community Cleavage Problem , 2015, IEEE Control Systems.

[2]  Jean-Michel Marin,et al.  Bayesian Modelling and Inference on Mixtures of Distributions , 2005 .

[3]  Anna Scaglione,et al.  Active Sensing of Social Networks , 2016, IEEE Transactions on Signal and Information Processing over Networks.

[4]  Anna Scaglione,et al.  Estimating Social Opinion Dynamics Models From Voting Records , 2018, IEEE Transactions on Signal Processing.

[5]  Rasmus Larsen,et al.  SpaSM: A MATLAB Toolbox for Sparse Statistical Modeling , 2018 .

[6]  Heng Tao Shen,et al.  Principal Component Analysis , 2009, Encyclopedia of Biometrics.

[7]  Shannon Jenkins The Impact of Party and Ideology on Roll Call Voting in State Legislatures , 2006 .

[8]  Patrick J. F. Groenen,et al.  Modern Multidimensional Scaling: Theory and Applications , 2003 .

[9]  Michael I. Jordan,et al.  A Direct Formulation for Sparse Pca Using Semidefinite Programming , 2004, SIAM Rev..

[10]  K. T. Poole,et al.  Nonparametric Unfolding of Binary Choice Data , 2000, Political Analysis.

[11]  Chiara Ravazzi,et al.  Learning Influence Structure in Sparse Social Networks , 2018, IEEE Transactions on Control of Network Systems.

[12]  Brian Everitt,et al.  Principles of Multivariate Analysis , 2001 .

[13]  Anna Scaglione,et al.  Data mining the underlying trust in the US Congress , 2016, 2016 IEEE Global Conference on Signal and Information Processing (GlobalSIP).

[14]  J. Edward Jackson,et al.  A User's Guide to Principal Components. , 1991 .

[15]  Brett J. Borghetti,et al.  A Survey of Distance and Similarity Measures Used Within Network Intrusion Anomaly Detection , 2015, IEEE Communications Surveys & Tutorials.

[16]  Chiara Ravazzi,et al.  Gossips and Prejudices: Ergodic Randomized Dynamics in Social Networks , 2013, ArXiv.

[17]  Igor Brigadir,et al.  Dimensionality Reduction and Visualisation Tools for Voting Records , 2016, AICS.

[18]  R. Tibshirani,et al.  Sparse Principal Component Analysis , 2006 .

[19]  K. T. Poole,et al.  A Spatial Model for Legislative Roll Call Analysis , 1985 .