{"id":"W2953257883","doi":"10.14288/1.0223143","title":"Efficient algorithms for training the parameters of hidden Markov models using stochastic expectation maximization (EM) training and Viterbi training","year":2009,"lang":"en","type":"preprint","venue":"MDC Repository (Max-Delbrueck-Center for Molecular Medicine)","topic":"Genomics and Phylogenetic Studies","field":"Biochemistry, Genetics and Molecular Biology","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Viterbi algorithm; Computer science; Hidden Markov model; Forward algorithm; Iterative Viterbi decoding; Markov model; Markov chain; Soft output Viterbi algorithm; Expectation–maximization algorithm; Algorithm; Maximum-entropy Markov model; Machine learning; Training (meteorology); Artificial intelligence; Variable-order Markov model; Mathematics; Maximum likelihood; Decoding methods","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006680355,0.0006333368,0.0008693076,0.0001864472,0.0003402407,0.00006976404,0.0004015221,0.0003971875,6.599745e-7],"category_scores_gemma":[0.0001643141,0.0005420177,0.0004045469,0.00009584047,0.0002928628,0.00000352666,0.0002345141,0.0002524177,3.690262e-8],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007098474,"about_ca_system_score_gemma":0.0002112001,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003232558,"about_ca_topic_score_gemma":0.00000443079,"domain_scores_codex":[0.9967539,0.0001695534,0.001024315,0.001069736,0.0003960438,0.0005864826],"domain_scores_gemma":[0.9979472,0.0001177524,0.0007900953,0.0006401691,0.0003499126,0.0001548294],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0005153111,0.0001378381,0.00003819283,0.0004904946,0.001134433,0.00001323238,0.04128237,0.2933097,0.6111934,0.00007181013,0.00007011437,0.05174305],"study_design_scores_gemma":[0.006012244,0.001915756,0.0003089514,0.001474401,0.00152061,0.0002490152,0.0193039,0.94103,0.02438954,0.002230453,0.0001722357,0.001392951],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5294872,0.003343659,0.4647556,0.0001018652,0.0007006975,0.001449273,0.00009210587,0.00001047123,0.00005918225],"genre_scores_gemma":[0.9486723,0.00007437846,0.0496728,0.0002651767,0.0004990303,0.0003081983,0.0003720267,0.0001114722,0.00002461335],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.6477202,"threshold_uncertainty_score":0.9997031,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05981510202793494,"score_gpt":0.2818756105327299,"score_spread":0.2220605085047949,"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."}}