Evidence map›Paper›PMID 32871583›Full record

ArticlePloS one2020

A new metric for understanding hidden political influences from voting records.

Corrado Possieri, Chiara Ravazzi, Fabrizio Dabbene, Giuseppe C Calafiore

Abstract read
In one paragraph

Article in PloS one, 2020. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Corrado PossieriIstituto di Analisi dei Sistemi ed Informatica "A. Ruberti", Consiglio Nazionale delle Ricerche (IASI-CNR), Roma, Italy.ORCID 0000-0003-2528-3935
Chiara RavazziIstituto di Elettronica e di Ingegneria dell'informazione e delle Telecomunicazioni, Consiglio Nazionale delle Ricerche (IEIIT-CNR), c/o Politecnico di Torino, Torino, Italy.
Fabrizio DabbeneIstituto di Elettronica e di Ingegneria dell'informazione e delle Telecomunicazioni, Consiglio Nazionale delle Ricerche (IEIIT-CNR), c/o Politecnico di Torino, Torino, Italy.
Giuseppe C CalafioreIstituto di Elettronica e di Ingegneria dell'informazione e delle Telecomunicazioni, Consiglio Nazionale delle Ricerche (IEIIT-CNR), c/o Politecnico di Torino, Torino, Italy.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Inspired by the increasing attention of the scientific community towards the understanding of human relationships and actions in social sciences, in this paper we address the problem of inferring from voting data the hidden influence on individuals from competing ideology groups. As a case study, we present an analysis of the closeness of members of the Italian Senate to political parties during the XVII Legislature. The proposed approach is aimed at automatic extraction of the relevant information by disentangling the actual influences from noise, via a two step procedure. First, a sparse principal component projection is performed on the standardized voting data. Then, the projected data is combined with a generative mixture model, and an information theoretic measure, which we refer to as Political Data-aNalytic Affinity (Political DNA), is finally derived. We show that the definition of this new affinity measure, together with suitable visualization tools for displaying the results of analysis, allows a better understanding and interpretability of the relationships among political groups.

Indexed as

Peer InfluencePoliticsForecastingHumansRecordsSurveys and QuestionnairesWeights and Measures

Identifiers

PMID32871583
PMCPMC7462714

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.