G Zanella - Journal of the American Statistical Association, 2020 - Taylor & Francis
There is a lack of methodological results to design efficient Markov chain Monte Carlo (MCMC) algorithms for statistical models with discrete-valued high-dimensional parameters …
Traditional Bayesian random partition models assume that the size of each cluster grows linearly with the number of data points. While this is appealing for some applications, this …
The perfect learning exists. We mean a learning model that can be generalized, and moreover, that can always fit perfectly the test data, as well as the training data. We have …
We have modified the Potts Model Swendsen-Wang algorithm to insert some clusters constraints by applying a modified agglomerative clustering approach (Kurita, 1991). We …