Computationally tractable approximate and smoothed Polya trees (Q517373): Difference between revisions
From MaRDI portal
Latest revision as of 14:31, 13 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Computationally tractable approximate and smoothed Polya trees |
scientific article |
Statements
Computationally tractable approximate and smoothed Polya trees (English)
0 references
23 March 2017
0 references
Bayesian nonparametric
0 references
density estimation
0 references
generalized linear mixed model
0 references
meta-analysis
0 references
0 references
0 references
0 references
0 references