{"id":"W2606633748","doi":"10.1007/978-3-319-57351-9_19","title":"Sequence-Based Bidirectional Merge Map-Matching Algorithm for Simplified Road Network","year":2017,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; Map matching; Merge (version control); Algorithm; Merge algorithm; Outlier; Blossom algorithm; Matching (statistics); Sequence (biology); Global Positioning System; Artificial intelligence; Mathematics","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001611815,0.0006757598,0.0006412764,0.0006150806,0.001118938,0.001823392,0.006009014,0.0002986119,0.00002330573],"category_scores_gemma":[0.00005842119,0.0006405182,0.0002605465,0.0002852971,0.000564245,0.001369162,0.001641223,0.0006368429,0.00005227192],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002736465,"about_ca_system_score_gemma":0.0006124076,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006791933,"about_ca_topic_score_gemma":0.00008129915,"domain_scores_codex":[0.9951941,0.00003369975,0.0005732494,0.002032979,0.001111426,0.00105448],"domain_scores_gemma":[0.9964088,0.0004398265,0.0005526905,0.002123574,0.000267915,0.0002072412],"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.000003542092,0.00001828432,0.000004205949,0.00003336158,0.00002178203,0.00004378138,0.0000543859,0.03116007,0.00001367003,0.009386236,0.0004194166,0.9588413],"study_design_scores_gemma":[0.0003474634,0.0001008131,0.0000237491,0.000299419,0.00001365564,0.000009790945,5.575507e-8,0.7820284,0.0001203102,0.1911947,0.02518412,0.0006774718],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000001738354,0.0002664396,0.9888998,0.001109235,0.006823633,0.0007451834,0.00006811113,0.0002784463,0.0018074],"genre_scores_gemma":[0.000953478,0.00002640995,0.9928571,0.001606385,0.002381688,0.00005003835,0.0001065397,0.00005177132,0.001966614],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9581638,"threshold_uncertainty_score":0.9996046,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03445042403683292,"score_gpt":0.276466503553487,"score_spread":0.2420160795166541,"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."}}