Some properties of adding a smoothing step to the EM algorithm (Q583872): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claims
Set OpenAlex properties.
 
(3 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Douglas W. Nychka / rank
 
Normal rank
Property / reviewed by
 
Property / reviewed by: Sotirios Loukas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4139463 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A statistical perspective on ill-posed inverse problems (with discussion) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3482744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Statistical Model for Positron Emission Tomography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further results on the consistent directions of least squares estimators / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0167-7152(92)90015-w / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990774149 / rank
 
Normal rank

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
Some properties of adding a smoothing step to the EM algorithm
scientific article

    Statements

    Some properties of adding a smoothing step to the EM algorithm (English)
    0 references
    1990
    0 references
    The EM algorithm is an iterative statistical and numerical method that in many cases is useful for finding the maximum of a likelihood. Adding a smoothing step after the usual expectation and maximization steps of the EM algorithm results in a useful method for solving statistical problems in image analysis and integral equations. The author gives some connections between this algorithm, known as EMS, and maximizing a penalized likelihood and derives an upper bound on the convergence rate.
    0 references
    EM algorithm
    0 references
    smoothing step
    0 references
    image analysis
    0 references
    penalized likelihood
    0 references
    convergence rate
    0 references
    0 references

    Identifiers