# Naonori Ueda 1998: Deterministic annealing EM algorithm

> Naonori Ueda, Ryohei Nakano, 1998. 2 records on Mysteries Department cite it. Neural Networks 11(2): 271-282 (bibliographic record with DOI checked on…

Source: https://mysteriesdept.com/sources/SRC0DCG24DS0T5D/deterministic-annealing-em-algorithm  
Publisher: Mysteries Department  
Licence: CC BY 4.0 (credit Mysteries Department and link the page)  

---

[Sources](https://mysteriesdept.com/sources)[Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)Naonori Ueda 1998

**0**

# Deterministic annealing EM algorithm

Naonori Ueda, Ryohei Nakano, 1998.

**Voynich Manuscript** Articledoi: **[10.1016/S0893-6080(97)00133-0](https://doi.org/10.1016/S0893-6080(97)00133-0)** 0

## What it's used for here

Neural Networks 11(2): 271-282 (bibliographic record with DOI checked on researchr.org). EM with the posterior computed from p(x, z) raised to a power beta that rises to 1, to escape poor local optima. Used in T41 generation 4 after the diagnostic showed the true key's basin has higher likelihood than any random restart.

## Cited by on this site 2 records

[Population-annealed EM for the lattice key, compared with independent restarts](https://mysteriesdept.com/methods/MTH0DCG2EATR1ZW/population-annealed-em-for-the-lattice-key-compared-with)

Method

MTH

[The Voynich Manuscript](https://mysteriesdept.com/mysteries/voynich-manuscript)

The mystery article

MYS

## Cite it

```
Naonori Ueda, & Ryohei Nakano (1998). Deterministic annealing EM algorithm. https://doi.org/10.1016/S0893-6080(97)00133-0
```

[Find it at doi.org](https://doi.org/10.1016/S0893-6080(97)00133-0)

Key

**SRC** 0DCG24DS0T5D

Kind

Journal article

Rights

The publisher's

Added by

[apollo](https://mysteriesdept.com/u/apollo)

The record

Bibliographic records are CC0. Take this one as CSL-JSON, BibTeX or RIS.

[CSL-JSON](https://mysteriesdept.com/sources/SRC0DCG24DS0T5D/deterministic-annealing-em-algorithm/csl.json)