{"doi":"10.1002/9780470061572.eqr480","title":"Expectation Maximization Algorithm","abstract":"<jats:title>Abstract</jats:title><jats:p>The expectation maximization (EM) algorithm is a powerful tool for finding maximum‐likelihood estimates in problems where the data are incomplete. Missing data may be an intrinsic feature of the problem or may be artificially imputed to ease estimation. The EM algorithm is an iterative algorithm that consists of two steps—an expectation step (E‐step) and a maximization step (M‐step). The output is a sequence of parameter estimates that converge to a maximum‐likelihood estimate. The implementation of the EM algorithm is illustrated using a finite mixture of exponential densities.</jats:p>","journal":"Encyclopedia of Statistics in Quality and Reliability","year":2007,"id":662136,"datarank":0.6496100010429497,"base_score":4.330733340286331,"endowment":4.330733340286331,"self_citation_contribution":0.6496100010429497,"citation_network_contribution":0.0,"self_endowment_contribution":0.6496100010429497,"citer_contribution":0.0,"corpus_percentile":null,"corpus_rank":null,"citation_count":75,"citer_count":0,"citers_with_citation_signal":0,"citers_with_endowment":0,"datacite_reuse_total":0,"is_dataset":false,"is_dataset_confidence":null,"is_data_producer":false,"deposit_databanks":null,"is_oa":false,"file_count":0,"downloads":0,"has_version_chain":false,"published_date":null,"fair_score":null,"fair_percentile":null,"algorithm_id":"datarank_citation_only_1hop_v6","ranking_scope":"data_only","authors":[{"id":1728559,"name":"Thomas B. Murphy","orcid":null,"position":1,"is_corresponding":false},{"id":50769,"name":"Isobel C. Gormley","orcid":null,"position":0,"is_corresponding":false}],"reference_count":0,"raw_metadata":{"has_enrichment":true,"resolved":true,"title":"Expectation Maximization Algorithm","abstract":"<jats:title>Abstract</jats:title><jats:p>The expectation maximization (EM) algorithm is a powerful tool for finding maximum‐likelihood estimates in problems where the data are incomplete. Missing data may be an intrinsic feature of the problem or may be artificially imputed to ease estimation. The EM algorithm is an iterative algorithm that consists of two steps—an expectation step (E‐step) and a maximization step (M‐step). The output is a sequence of parameter estimates that converge to a maximum‐likelihood estimate. The implementation of the EM algorithm is illustrated using a finite mixture of exponential densities.</jats:p>","is_dataset_classified":null,"base_score":4.330733340286331,"endowment":4.330733340286331,"datacite_reuse_total":0,"file_count":0,"downloads":0,"views":0,"has_version_chain":false,"is_dataset":false,"is_oa":false,"pmid":"19162232","pmcid":null,"openalex_id":"https://openalex.org/W1514609475","authors":[],"funders":[],"total_grants":0,"fwci":null,"citation_percentile":null,"influential_citations":0,"citation_trend":[{"year":2012,"count":4},{"year":2013,"count":3},{"year":2014,"count":5},{"year":2015,"count":4},{"year":2016,"count":1},{"year":2017,"count":4},{"year":2018,"count":6},{"year":2019,"count":6},{"year":2020,"count":4},{"year":2021,"count":5},{"year":2022,"count":3},{"year":2023,"count":5},{"year":2024,"count":1}],"oa_status":"closed","license":"http://doi.wiley.com/10.1002/tdm_license_1.1","oa_locations":[{"url":"https://onlinelibrary.wiley.com/doi/pdf/10.1002/9780470061572.eqr480","host_type":"publisher"},{"url":"https://onlinelibrary.wiley.com/doi/full-xml/10.1002/9780470061572.eqr480","host_type":"publisher"},{"url":"https://doi.org/10.1002/9780470061572.eqr480","host_type":"journal"}],"fields_of_study":["Bayesian Methods and Mixture Models","Statistical Methods and Bayesian Inference","Advanced Statistical Process Monitoring"],"mesh_terms":[],"keywords":["Expectation–maximization algorithm","Maximization","Algorithm","Maximum likelihood","Feature (linguistics)","Missing data","Maximum likelihood sequence estimation","Sequence (biology)","Computer science","Mathematics","Estimation theory","Exponential function","Mathematical optimization","Statistics"],"sdg_mappings":[],"linked_datasets":[],"clinical_trials":[],"software_tools":[],"database_accessions":[],"source":"live","citation_network_status":"fetched"},"created_at":"2026-08-12T12:52:07.857845Z","pmid":null,"pmcid":null,"fwci":null,"citation_percentile":null,"influential_citations":0,"oa_status":null,"license":null,"views":0,"total_file_size_bytes":0,"version_count":0,"fair_f":null,"fair_a":null,"fair_i":null,"fair_r":null,"fair_zscore":null,"fair_rationale":null,"fair_model":null,"fair_agent_version":null,"fair_fulltext_source":null,"fair_has_llm":null,"fair_computed_at":null,"clinical_trials":[],"software_tools":[],"db_accessions":[],"linked_datasets":[],"topics":[]}