{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004198606,0.001122529,0.001167305,0.001080993,0.00122742,0.003162787,0.002346853,0.001431326,0.008701347],"category_scores_gemma":[0.03229087,0.0005590392,0.0007894393,0.001738912,0.002313285,0.008240852,0.003045374,0.003451852,0.001583077],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001756215,"about_ca_system_score_gemma":0.00290313,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005506315,"about_ca_topic_score_gemma":0.004935273,"domain_scores_codex":[0.9971281,0.0008981039,0.0001876424,0.0003648835,0.0009607057,0.0004606089],"domain_scores_gemma":[0.97565,0.01975532,0.0006531732,0.002062843,0.001582876,0.0002958158],"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.00215667,0.0002397273,0.002644803,0.0003337396,0.0001371878,0.0002722309,0.0004052083,0.3269089,0.006928788,0.4352904,0.01614078,0.2085415],"study_design_scores_gemma":[0.00007930832,0.00006089329,0.0003799911,0.00003673573,0.00003470044,0.00007907413,0.00004379454,0.8118591,0.002214236,0.1836011,0.001581217,0.00002982512],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0653251,0.002740525,0.9088786,0.003668779,0.0006823658,0.0000862141,0.0003126745,0.0005643595,0.01774131],"genre_scores_gemma":[0.7402973,0.002076421,0.23677,0.0008760919,0.0009407371,0.0003261439,0.0005701552,0.000515246,0.01762795],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008701347,"threshold_uncertainty_score":0.02910894,"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."}}