![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Computational Statistics & Data Analysis, Volume 143
Volume 143, March 2020
- Luigi Spezia
:
Bayesian variable selection in non-homogeneous hidden Markov models through an evolutionary Monte Carlo method. - Jin-Chuan Duan, Andras Fulop, Yu-Wei Hsieh
:
Data-cloning SMC2: A global optimizer for maximum likelihood estimation of latent variable models.
- Yingying Ma, Wei Lan, Fanying Zhou, Hansheng Wang
:
Approximate least squares estimation for spatial autoregressive models with covariates. - Ariel Duarte-López
, Marta Pérez-Casany, Jordi Valero:
The Zipf-Poisson-stopped-sum distribution with an application for modeling the degree sequence of social networks. - Dimitris Fouskakis
, Ioannis Ntzoufras
, Konstantinos Perrakis
:
Variations of power-expected-posterior priors in normal regression models. - Andrea Bommert
, Xudong Sun, Bernd Bischl, Jörg Rahnenführer
, Michel Lang
:
Benchmark for filter methods for feature selection in high-dimensional classification data. - Carlos E. Rodríguez
, Gabriel Núñez-Antonio
, Gabriel Escarela:
A Bayesian mixture model for clustering circular data. - Nadine McCloud, Christopher F. Parmeter
:
Determining the Number of Effective Parameters in Kernel Density Estimation.
- Ningren Han
, Rajeev J. Ram:
Bayesian modeling and computation for analyte quantification in complex mixtures using Raman spectroscopy.
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.