{"id":"W2091097976","doi":"10.1068/b33118","title":"Dynamic accessibility analysis in location-based service using an incremental parallel algorithm","year":2008,"lang":"en","type":"article","venue":"Environment and Planning B Planning and Design","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"MRF Geosystems (Canada)","funders":"","keywords":"Dijkstra's algorithm; Computer science; Voronoi diagram; k-nearest neighbors algorithm; Path (computing); Shortest path problem; Pathfinding; Algorithm; Euclidean distance; Service (business); Data mining; Computer network; Artificial intelligence; Theoretical computer science; 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.0005720818,0.0006708461,0.001044068,0.001391091,0.0008140582,0.001003323,0.00167876,0.0005763093,0.002411183],"category_scores_gemma":[0.002557015,0.0004749964,0.0007287567,0.001539662,0.0006203366,0.001531174,0.001230246,0.0005333816,0.0004814455],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001183883,"about_ca_system_score_gemma":0.001719631,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01459898,"about_ca_topic_score_gemma":0.01003641,"domain_scores_codex":[0.9994398,0.00009446166,0.00002481267,0.0001174897,0.0002270878,0.00009642199],"domain_scores_gemma":[0.9992448,0.0002981589,0.00008482323,0.0001049373,0.0002151832,0.0000522241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001165398,0.00008188852,0.001426235,0.00005533668,0.00003235582,0.0001256113,0.00008563718,0.8442554,0.001984985,0.01291387,0.00153501,0.1373871],"study_design_scores_gemma":[0.000008942005,0.00001176142,0.00008163563,0.000001188919,0.000006377041,0.00003035934,0.00001070571,0.995757,0.0003706356,0.003291169,0.0004270631,0.000003118949],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02258065,0.00007992296,0.9740527,0.00008952143,0.00001948863,0.00005954525,0.00004254549,0.0008393603,0.002236337],"genre_scores_gemma":[0.4888626,0.0001504613,0.5078315,0.00004259176,0.00004047117,0.0001727233,0.0002488118,0.0001095001,0.002541407],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01459898,"threshold_uncertainty_score":0.029028,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05445833725858438,"score_gpt":0.2741563962339289,"score_spread":0.2196980589753445,"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."}}