{"id":"W2800366488","doi":"10.1155/2018/8068196","title":"A Novel Entropy-Based Decoding Algorithm for a Generalized High-Order Discrete Hidden Markov Model","year":2018,"lang":"en","type":"article","venue":"Journal of Probability and Statistics","topic":"Blind Source Separation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Forward algorithm; Algorithm; Viterbi algorithm; Hidden Markov model; Entropy (arrow of time); Computation; Mathematics; Sequence (biology); Decoding methods; Markov model; Hidden semi-Markov model; Markov chain; Iterative Viterbi decoding; Computer science; Artificial intelligence; Sequential decoding; Markov property; Variable-order Markov model; Block code","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.001044612,0.0001232104,0.0002498094,0.00009006033,0.0001394956,0.0001845196,0.0003106831,0.00006603658,0.000006031608],"category_scores_gemma":[0.0003073403,0.0001014693,0.00005536119,0.0001253932,0.0001259272,0.0003033906,0.00006781311,0.0001337917,3.90149e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005717443,"about_ca_system_score_gemma":0.0002922515,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000109424,"about_ca_topic_score_gemma":0.00002072682,"domain_scores_codex":[0.9987829,0.00008088631,0.0004962201,0.0001979493,0.0002583227,0.0001837423],"domain_scores_gemma":[0.99822,0.0002350055,0.0003537432,0.0002152574,0.0008633595,0.0001126705],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001146469,0.0002614516,0.00006237664,0.00009645891,0.00005967626,0.000004392208,0.001158816,0.0007256144,0.001935594,0.7522253,0.002442395,0.2409133],"study_design_scores_gemma":[0.0008148032,0.0003597093,0.0000737044,0.00001720677,0.00002178547,0.0000119274,0.000004550005,0.777588,0.0008544418,0.2199749,0.0001804735,0.00009849192],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001878541,0.00002150631,0.9965929,0.0009473942,0.0001181014,0.0002597606,0.0001355612,0.00003102868,0.00001517026],"genre_scores_gemma":[0.01377386,0.000008980319,0.9856163,0.0004455109,0.00009498982,0.00001037754,0.000004723533,0.000008274034,0.00003694178],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7768624,"threshold_uncertainty_score":0.4137798,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02914158238759035,"score_gpt":0.2979468758040299,"score_spread":0.2688052934164396,"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."}}