Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (Q2184405)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm |
scientific article; zbMATH DE number 7206119
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm |
scientific article; zbMATH DE number 7206119 |
Statements
Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm (English)
0 references
28 May 2020
0 references
half-space depth computation
0 references
multiple try Metropolis
0 references
simulated annealing
0 references
Markov chain Monte Carlo (MCMC)
0 references
0 references
0.8291736245155334
0 references
0.8074421286582947
0 references
0.8003780841827393
0 references
0.7810254693031311
0 references
0.7697234749794006
0 references
