๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An entropy estimate for the problem of location of ones in a binary matrix

โœ Scribed by Kh. B. Kordonskii; E. B. Khoikhin

Publisher
Springer US
Year
1984
Tongue
English
Weight
417 KB
Volume
20
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Domains of convergence for the EM algori
Domains of convergence for the EM algorithm: a cautionary tale in a location estimation problem
โœ Olcay Arslan; Patrick D. L. Constable; John T. Kent ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Springer US ๐ŸŒ English โš– 449 KB

The EM algorithm is a popular method for maximizing a likelihood in the presence of incomplete data. When the likelihood has multiple local maxima, the parameter space can be partitioned into domains of convergence, one for each local maximum. In this paper we investigate these domains for the locat