{"id":"W2165398449","doi":"10.1186/1748-7188-5-38","title":"Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization (EM) training and Viterbi training","year":2010,"lang":"en","type":"article","venue":"Algorithms for Molecular Biology","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Viterbi algorithm; Computer science; Hidden Markov model; Iterative Viterbi decoding; Forward algorithm; Markov model; Markov chain; Soft output Viterbi algorithm; Expectation–maximization algorithm; Training (meteorology); Machine learning; Algorithm; Maximum-entropy Markov model; Artificial intelligence; Variable-order Markov model; Maximum likelihood; Decoding methods; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007773076,0.0002496256,0.0003658791,0.0001713434,0.0002517985,0.00009132604,0.0004746495,0.0002037065,9.070944e-7],"category_scores_gemma":[0.0001883825,0.0002101343,0.0001397553,0.0002347176,0.0001861803,0.0001104641,0.00008868791,0.0002009705,1.199514e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002002684,"about_ca_system_score_gemma":0.0001430368,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002202593,"about_ca_topic_score_gemma":0.000004461321,"domain_scores_codex":[0.9982051,0.00009709285,0.000450339,0.0005988691,0.0001490132,0.000499624],"domain_scores_gemma":[0.9986522,0.0004289897,0.000268188,0.0003494026,0.0002030992,0.00009813903],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002853083,0.00003673795,0.000001548105,0.00002644828,0.00009125689,0.000001879538,0.02759005,0.09988469,0.07233888,0.02001729,0.000001411906,0.7799813],"study_design_scores_gemma":[0.0006370533,0.0002591891,0.000005494009,0.00003014408,0.00004641131,0.00004913033,0.001479246,0.9663659,0.001978411,0.02890578,0.000002707964,0.0002405407],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1824783,0.0001020858,0.8162019,0.0001436714,0.0004206325,0.0005645189,0.00002815018,0.00005296434,0.000007788253],"genre_scores_gemma":[0.5290615,0.000001148718,0.4706912,0.00008581219,0.00003811783,0.00008665861,0.00001697803,0.00001683274,0.000001735376],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8664812,"threshold_uncertainty_score":0.8569027,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07937526116788873,"score_gpt":0.3143771748915459,"score_spread":0.2350019137236571,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}