Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard (Q2563728)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 958435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard |
scientific article; zbMATH DE number 958435 |
Statements
Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard (English)
0 references
22 January 1997
0 references
Hamiltonian circuit
0 references
tabular keys
0 references
Bayes formula
0 references
maximum a posterior probability
0 references
Bayesian key
0 references
NP-hard
0 references
0.7475528717041016
0 references
0.7395980358123779
0 references
0.7261228561401367
0 references
