{"id":"W2124125906","doi":"10.1016/j.patrec.2009.09.023","title":"On the memory complexity of the forward–backward algorithm","year":2009,"lang":"en","type":"article","venue":"Pattern Recognition Letters","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":54,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Ottawa; École de Technologie Supérieure","funders":"","keywords":"Computational complexity theory; Algorithm; Computer science; Hidden Markov model; Time complexity; Sequence (biology); Overhead (engineering); Worst-case complexity; Forward algorithm; Markov chain; Markov model; Artificial intelligence; Variable-order Markov model; Machine learning","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.0003101616,0.0001468917,0.0001409567,0.00004932508,0.000227774,0.00008632055,0.0009751758,0.0000461937,0.0001243633],"category_scores_gemma":[0.00004030468,0.00008647626,0.0001465753,0.0002499035,0.0001468585,0.0001511274,0.0001093205,0.0002819048,0.0001438757],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002085414,"about_ca_system_score_gemma":0.000009553521,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002392081,"about_ca_topic_score_gemma":0.000002928565,"domain_scores_codex":[0.9985812,0.0002211454,0.0002615178,0.0002948886,0.0003976749,0.000243628],"domain_scores_gemma":[0.9987069,0.0002693649,0.0001742651,0.0007425293,0.00006056138,0.00004635478],"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.000005715515,0.00008700162,0.0001149363,0.000006040381,0.00001836146,0.000006381559,0.0003179244,0.0001214676,0.0007502247,0.0005769835,0.05523909,0.9427559],"study_design_scores_gemma":[0.006316245,0.001248115,0.2307294,0.002161729,0.00023224,0.0003808029,0.0005166383,0.3525282,0.1265009,0.255356,0.02006488,0.003964756],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1507917,0.00001691026,0.7802157,0.06587373,0.001307224,0.0003533664,0.00009518205,0.0001538198,0.001192298],"genre_scores_gemma":[0.9278035,0.000008815126,0.007983803,0.06392772,0.000208715,0.0000109511,0.00002763994,0.000009440213,0.00001946971],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9387911,"threshold_uncertainty_score":0.35264,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03804562585249782,"score_gpt":0.2327220510240789,"score_spread":0.1946764251715811,"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."}}