Browse
Submit Data
Databases
API
Help

Dataset Information

0 Views

0 Connections

0 Citations

0 Reanalyses

0 Downloads

Omics score: 0

Dynamic Dirichlet process mixture model for identifying voting coalitions in the United Nations General Assembly human rights roll call votes.

ABSTRACT: Scholars have been interested in the politicization of humans rights within the United Nations for some time. However, previous research typically looks at simple associations between voting coalitions and observable variables, such as geographic location or membership in international organizations. Our study is the first attempt at estimating the latent coalition structure based on the voting data. We propose a Bayesian Dynamic Dirichlet Process Mixture (DDPM) model to identify voting coalitions based on roll call vote data across multiple time periods. We also propose post-processing methods for analyzing the outputs of the DDPM model. We apply these methods to the United Nations General Assembly (UNGA) human rights roll call vote data from 1992 to 2017. We identify human rights voting coalitions in the UNGA after the Cold War, and polarizing resolutions that divide countries into different coalitions.

SUBMITTER: Yu Q

PROVIDER: S-EPMC9415553 | biostudies-literature | 2022

REPOSITORIES: biostudies-literature

ACCESS DATA

Json Xml

Publications

Dynamic Dirichlet process mixture model for identifying voting coalitions in the United Nations General Assembly human rights roll call votes.

Yu Qiushi Q

Journal of applied statistics 20210520 12

Scholars have been interested in the politicization of humans rights within the United Nations for some time. However, previous research typically looks at simple associations between voting coalitions and observable variables, such as geographic location or membership in international organizations. Our study is the first attempt at estimating the latent coalition structure based on the voting data. We propose a Bayesian Dynamic Dirichlet Process Mixture (DDPM) model to identify voting coalitio ...[more]

PMID: 36035611

Similar Datasets

Cohesion and Coalition Formation in the European Parliament: Roll-Call Votes and Twitter Activities.

Project description:We study the cohesion within and the coalitions between political groups in the Eighth European Parliament (2014-2019) by analyzing two entirely different aspects of the behavior of the Members of the European Parliament (MEPs) in the policy-making processes. On one hand, we analyze their co-voting patterns and, on the other, their retweeting behavior. We make use of two diverse datasets in the analysis. The first one is the roll-call vote dataset, where cohesion is regarded as the tendency to co-vote within a group, and a coalition is formed when the members of several groups exhibit a high degree of co-voting agreement on a subject. The second dataset comes from Twitter; it captures the retweeting (i.e., endorsing) behavior of the MEPs and implies cohesion (retweets within the same group) and coalitions (retweets between groups) from a completely different perspective. We employ two different methodologies to analyze the cohesion and coalitions. The first one is based on Krippendorff's Alpha reliability, used to measure the agreement between raters in data-analysis scenarios, and the second one is based on Exponential Random Graph Models, often used in social-network analysis. We give general insights into the cohesion of political groups in the European Parliament, explore whether coalitions are formed in the same way for different policy areas, and examine to what degree the retweeting behavior of MEPs corresponds to their co-voting patterns. A novel and interesting aspect of our work is the relationship between the co-voting and retweeting patterns.

| S-EPMC5106041 | biostudies-literature

Parliamentary roll-call voting as a complex dynamical system: The case of Chile.

Project description:A method is proposed to study the temporal variability of legislative roll-call votes in a parliament from the perspective of complex dynamical systems. We studied the Chilean Chamber of Deputies' by analyzing the agreement ratio and the voting outcome of each vote over the last 19 years with a Recurrence Quantification Analysis and an entropy analysis (Sample Entropy). Two significant changes in the temporal variability were found: one in 2014, where the voting outcome became more recurrent and with less entropy, and another in 2018, where the agreement ratio became less recurrent and with higher entropy. These changes may be directly related to major changes in the Chilean electoral system and the composition of the Chamber of Deputies, given that these changes occurred just after the first parliamentary elections with non-compulsory voting (2013 elections) and the first elections with a proportional system in conjunction with an increase in the number of deputies (2017 elections) were held.

| S-EPMC10132531 | biostudies-literature

Legislators' roll-call voting behavior increasingly corresponds to intervals in the political spectrum.

Project description:Scaling techniques such as the well known NOMINATE position political actors in a low dimensional space to represent the similarity or dissimilarity of their political orientation based on roll-call voting patterns. Starting from the same kind of data we propose an alternative, discrete, representation that replaces positions (points and distances) with niches (boxes and overlap). In the one-dimensional case, this corresponds to replacing the left-to-right ordering of points on the real line with an interval order. As it turns out, this seemingly simplistic one-dimensional model is sufficient to represent the similarity of roll-call votes by U.S. senators in recent years. In a historic context, however, low dimensionality represents the exception which stands in contrast to what is suggested by scaling techniques.

| S-EPMC7566643 | biostudies-literature

Identifying latent subgroups of children with developmental delay using Bayesian sequential updating and Dirichlet process mixture modelling.

Project description:Identifying children who are at-risk for developmental delay, so that these children can have access to interventions as early as possible, is an important and challenging problem in developmental research. This research aimed to identify latent subgroups of children with developmental delay, by modelling and clustering developmental milestones. The main objectives were to (a) create a developmental profile for each child by modelling milestone achievements, from birth to three years of age, across multiple domains of development, and (b) cluster the profiles to identify groups of children who show similar deviations from typical development. The ensemble methodology used in this research consisted of three components: (1) Bayesian sequential updating was used to model the achievement of milestones, which allows for updated predictions of development to be made in real time; (2) a measure was created that indicated how far away each child deviated from typical development for each functional domain, by calculating the area between each child's obtained sequence of posterior means and a sequence of posterior means representing typical development; and (3) Dirichlet process mixture modelling was used to cluster the obtained areas. The data used were 348 binary developmental milestone measurements, collected from birth to three years of age, from a small community sample of young children (N = 79). The model identified nine latent groups of children with similar features, ranging from no delays in all functional domains, to large delays in all domains. The performance of the Dirichlet process mixture model was validated with two simulation studies.

| S-EPMC7266333 | biostudies-literature

Fast Bayesian Inference in Dirichlet Process Mixture Models.

Project description:There has been increasing interest in applying Bayesian nonparametric methods in large samples and high dimensions. As Markov chain Monte Carlo (MCMC) algorithms are often infeasible, there is a pressing need for much faster algorithms. This article proposes a fast approach for inference in Dirichlet process mixture (DPM) models. Viewing the partitioning of subjects into clusters as a model selection problem, we propose a sequential greedy search algorithm for selecting the partition. Then, when conjugate priors are chosen, the resulting posterior conditionally on the selected partition is available in closed form. This approach allows testing of parametric models versus nonparametric alternatives based on Bayes factors. We evaluate the approach using simulation studies and compare it with four other fast nonparametric methods in the literature. We apply the proposed approach to three datasets including one from a large epidemiologic study. Matlab codes for the simulation and data analyses using the proposed approach are available online in the supplemental materials.

| S-EPMC3812957 | biostudies-literature

Latent Dirichlet allocation mixture models for nucleotide sequence analysis.

Project description:Strings of nucleotides carrying biological information are typically described as sequence motifs represented by weight matrices or consensus sequences. However, many signals in DNA or RNA are recognized by multiple factors in temporal sequence, consist of distinct alternative motifs, or are best described by base composition. Here we apply the latent Dirichlet allocation (LDA) mixture model to nucleotide sequences. Using positions in an alignment of human or Drosophila splice sites as samples, we show that LDA readily identifies motifs, including such elusive cases as the intron branch site. Using whole sequences with positional k-mers as features, LDA can identify sequence subtypes enriched in long vs. short introns. LDA with bulk k-mers can reliably distinguish reading frame and species of origin in coding sequences from humans and Drosophila. We find that LDA is a useful model for describing heterogeneous signals, for assigning individual sequences to subtypes, and for identifying and characterizing sequences that do not fit recognized subtypes. Because LDA topic models are interpretable, they also aid the discovery of new motifs, even those present in a small fraction of samples. In summary, LDA can identify and characterize signals in nucleotide sequences, including candidate regulatory factors involved in biological processes.

| S-EPMC11310860 | biostudies-literature

Dirichlet process mixture models for single-cell RNA-seq clustering.

Project description:Clustering of cells based on gene expression is one of the major steps in single-cell RNA-sequencing (scRNA-seq) data analysis. One key challenge in cluster analysis is the unknown number of clusters and, for this issue, there is still no comprehensive solution. To enhance the process of defining meaningful cluster resolution, we compare Bayesian latent Dirichlet allocation (LDA) method to its non-parametric counterpart, hierarchical Dirichlet process (HDP) in the context of clustering scRNA-seq data. A potential main advantage of HDP is that it does not require the number of clusters as an input parameter from the user. While LDA has been used in single-cell data analysis, it has not been compared in detail with HDP. Here, we compare the cell clustering performance of LDA and HDP using four scRNA-seq datasets (immune cells, kidney, pancreas and decidua/placenta), with a specific focus on cluster numbers. Using both intrinsic (DB-index) and extrinsic (ARI) cluster quality measures, we show that the performance of LDA and HDP is dataset dependent. We describe a case where HDP produced a more appropriate clustering compared to the best performer from a series of LDA clusterings with different numbers of clusters. However, we also observed cases where the best performing LDA cluster numbers appropriately capture the main biological features while HDP tended to inflate the number of clusters. Overall, our study highlights the importance of carefully assessing the number of clusters when analyzing scRNA-seq data.

| S-EPMC9002799 | biostudies-literature

mSigHdp: hierarchical Dirichlet process mixture modeling for mutational signature discovery.

Project description:Mutational signatures are characteristic patterns of mutations caused by endogenous or exogenous mutational processes. These signatures can be discovered by analyzing mutations in large sets of samples-usually somatic mutations in tumor samples. Most programs for discovering mutational signatures are based on non-negative matrix factorization (NMF). Alternatively, signatures can be discovered using hierarchical Dirichlet process (HDP) mixture models, an approach that has been less explored. These models assign mutations to clusters and view each cluster as being generated from the signature of a particular mutational process. Here, we describe mSigHdp, an improved approach to using HDP mixture models to discover mutational signatures. We benchmarked mSigHdp and state-of-the-art NMF-based approaches on four realistic synthetic data sets. These data sets encompassed 18 cancer types. In total, they contained 3.5 × 107 single-base-substitution mutations representing 32 signatures and 6.1 × 106 small insertion and deletion mutations representing 13 signatures. For three of the four data sets, mSigHdp had the best positive predictive value for discovering mutational signatures, and for all four data sets, it had the best true positive rate. Its CPU usage was similar to that of the NMF-based approaches. Thus, mSigHdp is an important and practical addition to the set of tools available for discovering mutational signatures.

| S-EPMC9869330 | biostudies-literature

A Dirichlet process mixture model for clustering longitudinal gene expression data.

Project description:Subgroup identification (clustering) is an important problem in biomedical research. Gene expression profiles are commonly utilized to define subgroups. Longitudinal gene expression profiles might provide additional information on disease progression than what is captured by baseline profiles alone. Therefore, subgroup identification could be more accurate and effective with the aid of longitudinal gene expression data. However, existing statistical methods are unable to fully utilize these data for patient clustering. In this article, we introduce a novel clustering method in the Bayesian setting based on longitudinal gene expression profiles. This method, called BClustLonG, adopts a linear mixed-effects framework to model the trajectory of genes over time, while clustering is jointly conducted based on the regression coefficients obtained from all genes. In order to account for the correlations among genes and alleviate the high dimensionality challenges, we adopt a factor analysis model for the regression coefficients. The Dirichlet process prior distribution is utilized for the means of the regression coefficients to induce clustering. Through extensive simulation studies, we show that BClustLonG has improved performance over other clustering methods. When applied to a dataset of severely injured (burn or trauma) patients, our model is able to identify interesting subgroups. Copyright © 2017 John Wiley & Sons, Ltd.

| S-EPMC5583037 | biostudies-literature

A Predictive Study of Dirichlet Process Mixture Models for Curve Fitting.

Project description:This paper examines the use of Dirichlet process (DP) mixtures for curve fitting. An important modelling aspect in this setting is the choice between constant or covariate-dependent weights. By examining the problem of curve fitting from a predictive perspective, we show the advantages of using covariate-dependent weights. These advantages are a result of the incorporation of covariate proximity in the latent partition. However, closer examination of the partition yields further complications, which arise from the vast number of total partitions. To overcome this, we propose to modify the probability law of the random partition to strictly enforce the notion of covariate proximity, while still maintaining certain properties of the DP. This allows the distribution of the partition to depend on the covariate in a simple manner and greatly reduces the total number of possible partitions, resulting in improved curve fitting and faster computations. Numerical illustrations are presented.

| S-EPMC4225571 | biostudies-literature

OmicsDI is part of the ELIXIR infrastructure

OmicsDI is an Elixir interoperability service. Learn more ›

Tweets

OmicsDI Databases

PRIDE
PeptideAtlas
MassIVE
JPOST Repository
Physiome Model Repository

EGA
EVA
ENA
LINCS
PAXDB
Cell Collective

MetaboLights
Metabolomics Workbench
MetabolomeExpress
GNPS
BioModels
FAIRDOMHub

ArrayExpress
dbGaP
ExpressionAtlas
GEO
NODE

Information

Databases
Help
API
Contact us
Code on GitHub
Terms of use
Submit Data