Simulations with distribution- and matrix-valued responses show that the proposed spatial distance-clustering framework improves region recovery relative to existing distance-clustering methods, while the frailty layer provides interpretable centrality summaries.
Abstract
Clustering problems increasingly involve complex objects observed over space, such as distributions, matrices, functions, images, or multivariate data, for which a scientifically meaningful dissimilarity between objects is often easier to specify and computationally more tractable than an object-response likelihood model. We propose DISCCO, a Bayesian framework for clustering spatially indexed complex objects using only a pairwise distance matrix and a spatial adjacency graph, with broad applicability and minimal user modeling requirements. The model combines a hierarchical distance-based likelihood accounting for within-cluster compactness and between-cluster separation with a random spatial graph partition prior, ensuring that posterior clusters are spatially contiguous. A key model feature is a set of node-specific frailty parameters that induce dependence among overlapping within-cluster distances and provide posterior summaries of object-level centrality or peripherality within each inferred cluster. We develop a partially collapsed Markov chain Monte Carlo algorithm for posterior inference. Simulations with distribution- and matrix-valued responses show that the proposed spatial distance-clustering framework improves region recovery relative to existing distance-clustering methods, while the frailty layer provides interpretable centrality summaries. Real applications to Houston Census Block Group racial-composition distributions and Western US county-level cancer mortality matrices illustrate how the method recovers interpretable contiguous clusters and frailty-based centrality maps.
Spatial clustering increasingly involves complex objects, including probability distributions, networks, and structured matrices, for which conventional parametric likelihoods may be difficult to specify. We construct a generalized likelihood by exponentiating a cluster-specific Bregman loss on fixed representations of...
This work interprets denoising as a dynamical Bayesian classifier, and proves that the KL error bound depends linearly on the maximum intrinsic dimension of a cluster, up to a logarithmic factor, even when $K$ grows polynomially with $D$.
Comparisons with MCMC indicate that the variational approximation produces clustering results and parameter estimates that are in close agreement with those obtained by MCMC, while requiring substantially lower computational cost.
Neighborhoods are multifaceted entities whose attributes span sociocultural, economic, and environmental dimensions. Clustering neighborhoods based on social determinants of health (SDoH) can inform the allocation of public health resources and interventions tailored to community needs. Continuous and bounded data, as...
Carmen B Rodriguez, Briana J. K. Stephenson· 0 citations
This work presents 3CPO, a clustering algorithm based on statistically solid modeling of count data, and proposes a simple iterative algorithm that maximizes the posterior probability to find good clustering solutions and discusses its properties.
Collin Leiber, K. Puolamäki, H. Mannila· Data mining and knowledge di...· 0 citations