Random partition models and complementary clustering of Anglo-Saxon place-names
From MaRDI portal
Publication:262348
DOI10.1214/15-AOAS884zbMath1397.62589arXiv1409.6994MaRDI QIDQ262348
Publication date: 29 March 2016
Published in: The Annals of Applied Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1409.6994
bandwidthkernel smoothingMetropolis-Hastings algorithmAnglo-Saxon place-names locationscomplementary clusteringdata association problemsefficient proposal distributionK-cross functionrandom partition models
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Applications of statistics to social sciences (62P25)
Related Items
Random Partition Models for Microclustering Tasks ⋮ Informed Proposals for Local MCMC in Discrete Spaces
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Random partition models with regression on covariates
- Weak convergence and optimal scaling of random walk Metropolis algorithms
- EM, MCMC, and chain flipping for structure from motion with unknown correspondence
- Inference from iterative simulation using multiple sequences
- Area-interaction point processes
- Markov Chain Monte Carlo Convergence Diagnostics: A Comparative Review
- A Kernel Method for Smoothing Point Process Data
- The Complexity of Enumeration and Reliability Problems
- Optimal metropolis algorithms for product measures on the vertices of a hypercube
- Non‐ and semi‐parametric estimation of interaction in inhomogeneous point patterns
- Annealing Markov Chain Monte Carlo with Applications to Ancestral Inference
- Markov Chain Monte Carlo Data Association for Multi-Target Tracking
- Case Studies in Spatial Point Process Modeling
- Prior distributions for variance parameters in hierarchical models (Comment on article by Browne and Draper)