A hidden Markov model for latent temporal clustering with application to ideological alignment in the U.S. Supreme Court

DOI10.1016/j.csda.2016.12.010zbMath1466.62048OpenAlexW2564207870MaRDI QIDQ1658411

Harry Crane

Publication date: 14 August 2018

Published in: Computational Statistics and Data Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.csda.2016.12.010

zbMATH Keywords

clusteringhidden Markov modelexchangeabilitycombinatorial stochastic processSupreme Courtvoting data

Mathematics Subject Classification ID

Computational methods for problems pertaining to statistics (62-08)

Related Items

Exact inference for a class of hidden Markov models on general state spaces, Spatial voting models in circular spaces: a case study of the U.S. House of Representatives

Cites Work

• Unnamed Item
• Convergence rates of Markov chains on spaces of partitions
• The cut-and-paste process
• Optimal filtering and the dual process
• Spatial product partition models
• Two-parameter family of infinite-dimensional diffusions on the Kingman simplex
• The coalescent
• Mixtures of Dirichlet processes with applications to Bayesian nonparametric problems
• Rejoinder: The ubiquitous Ewens sampling formula
• Combinatorial stochastic processes. Ecole d'Eté de Probabilités de Saint-Flour XXXII -- 2002.
• The sampling theory of selectively neutral alleles
• A Bayesian analysis of some nonparametric problems
• How many clusters?
• Two-Parameter Poisson–Dirichlet Measures and Reversible Exchangeable Fragmentation–Coalescence Processes
• Hidden Markov Models for Speech Recognition
• Random partitions in population genetics
• Bayesian Methods for Hidden Markov Models
• RELATIVELY EXCHANGEABLE STRUCTURES
• Objective Priors for Discrete Parameter Spaces
• A pattern analysis of the second Rehnquist U.S. Supreme Court
• Hidden Markov models for bioinformatics