Algoriti ya Taratibu za Matarajio-Uboreshaji (EM)
Algoriti ya Taratibu za Matarajio-Uboreshaji (EM) ni utaratibu wa kurudia wa kuboresha kwa ajili ya kutafuta makadirio ya juu zaidi ya uwezekano (maximum likelihood) au makadirio ya juu zaidi ya uwezekano wa baadae (maximum a posteriori) ya vigezo katika mifumo ya takwimu yenye vigezo fiche (latent variables) au data zilizokosekana. Imeanzishwa na Dempster, Laird, na Rubin katika karatasi yao muhimu ya 1977, EM hubadilishana kati ya kuhesabu uwezekano kamili wa data wa log-uwezekano (E-step) na kuuboresha kulingana na vigezo (M-step), ikihakikisha kuongezeka kwa uwezekano bila kupungua kwa kila hatua ya kurudia.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977). Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society: Series B, 39(1), 1–38. DOI: 10.1111/j.2517-6161.1977.tb01600.x ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Expectation-Maximization Algorithm. ScholarGate. https://scholargate.app/sw/statistics/em-algorithm
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →