{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005056363,0.0009756967,0.001370943,0.00271685,0.001225813,0.001059005,0.002390252,0.0008970748,0.008746012],"category_scores_gemma":[0.001416471,0.000609264,0.001017026,0.003425366,0.000360066,0.002085855,0.002051453,0.0008094974,0.002756471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007992031,"about_ca_system_score_gemma":0.002628593,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01296934,"about_ca_topic_score_gemma":0.01390673,"domain_scores_codex":[0.9992576,0.00005253418,0.0000449436,0.000209966,0.000327473,0.0001074841],"domain_scores_gemma":[0.9995487,0.00005671191,0.00003173005,0.00009514139,0.0002359423,0.00003172827],"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.0004441203,0.0001653666,0.001806653,0.0002918768,0.0001224231,0.0001838596,0.0002152012,0.06895158,0.02413259,0.0105989,0.0126328,0.8804546],"study_design_scores_gemma":[0.00007532107,0.0001186706,0.001273338,0.00002175294,0.00008810201,0.000407185,0.0002131281,0.9459236,0.02630048,0.01340291,0.01212946,0.00004593386],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0213354,0.0003061976,0.9710569,0.00007819808,0.0001095161,0.0001849638,0.0004455673,0.00267667,0.003806615],"genre_scores_gemma":[0.1894713,0.0004086281,0.7971514,0.00007741492,0.00005597459,0.0002776309,0.002826865,0.0002873624,0.009443494],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01296934,"threshold_uncertainty_score":0.02925825,"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."}}