{"id":"W3184499923","doi":"10.1155/2021/9993860","title":"An Online Map Matching Algorithm Based on Second-Order Hidden Markov Model","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"National Key Research and Development Program of China Stem Cell and Translational Research; National Key Research and Development Program of China; Southeast University; National Natural Science Foundation of China","keywords":"Map matching; Computer science; Hidden Markov model; Viterbi algorithm; Trajectory; Matching (statistics); Algorithm; Sliding window protocol; Markov model; Data mining; Markov process; Key (lock); Markov chain; Artificial intelligence; Window (computing); Machine learning; Global Positioning System; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006754465,0.0007849251,0.001459842,0.001409909,0.0007366086,0.0008633664,0.001981506,0.001004842,0.002506039],"category_scores_gemma":[0.002262483,0.0005542067,0.0009864813,0.001579396,0.0003867237,0.002028097,0.00142525,0.001559426,0.001277122],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007228891,"about_ca_system_score_gemma":0.002321805,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01581434,"about_ca_topic_score_gemma":0.01230518,"domain_scores_codex":[0.9990906,0.00009760488,0.00005378525,0.0003447971,0.0002783078,0.0001348729],"domain_scores_gemma":[0.9993395,0.0002001409,0.00007115238,0.000114142,0.0002273604,0.00004771017],"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.0002849153,0.0002494153,0.004633634,0.0001243719,0.0001805596,0.0001906062,0.0001438186,0.1630336,0.01021987,0.007168565,0.006619687,0.8071509],"study_design_scores_gemma":[0.00002137906,0.00004896198,0.0008012351,0.000005208008,0.00002420581,0.0001112219,0.00003468056,0.9894792,0.004417698,0.003555562,0.001483652,0.00001700618],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01828339,0.0002445775,0.9775849,0.0001065198,0.0001141737,0.00006570364,0.0001868072,0.002427452,0.0009865231],"genre_scores_gemma":[0.5059755,0.0003845884,0.4849828,0.0001691651,0.0001051925,0.0001810627,0.001604554,0.0002652963,0.006331788],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01581434,"threshold_uncertainty_score":0.03144455,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.007739197842240806,"score_gpt":0.2367329725531399,"score_spread":0.2289937747108991,"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."}}