Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard (Q2563728)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding the maximum a posteriori probability (MAP) in a Bayesian taxonomic key is NP-hard |
scientific article |
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
