{"id":"W1841647363","doi":"","title":"k-Nearest Neighbors Queries in Time-Dependent Road Networks","year":2012,"lang":"en","type":"article","venue":"Cadernos de Linguística e Teoria da Literatura (Universidade Federal de Minas Gerais)","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Correctness; Pruning; k-nearest neighbors algorithm; Speedup; Effi; Data mining; Constant (computer programming); Algorithm; Artificial intelligence; Database","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.001601018,0.0005716973,0.001579813,0.001533881,0.0014267,0.001973596,0.001825728,0.001860728,0.001336443],"category_scores_gemma":[0.01114472,0.0004971296,0.0008110637,0.00342512,0.0007466018,0.005347379,0.001271462,0.0008213671,0.000434482],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001190183,"about_ca_system_score_gemma":0.0008403967,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.009872768,"about_ca_topic_score_gemma":0.009498845,"domain_scores_codex":[0.9972791,0.0007794356,0.0002968018,0.0007742437,0.0006282778,0.0002420534],"domain_scores_gemma":[0.9920644,0.005684716,0.0006861027,0.0007416332,0.0006212459,0.0002019839],"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.001039262,0.0002811957,0.008539466,0.0004709925,0.000218728,0.001006085,0.0009185708,0.8235183,0.005892613,0.02909639,0.006829046,0.1221893],"study_design_scores_gemma":[0.00003319123,0.00005322626,0.0009036395,0.00001588563,0.00003136183,0.000283168,0.0005013846,0.9652869,0.002430551,0.0279271,0.002512533,0.00002099216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3655565,0.002541643,0.6223951,0.001406442,0.0001296923,0.0002441429,0.001825534,0.001066334,0.004834554],"genre_scores_gemma":[0.835033,0.0007191397,0.159865,0.0001315293,0.00008357227,0.00009133126,0.001839601,0.00009262198,0.002144195],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009872768,"threshold_uncertainty_score":0.01963061,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009278389424483256,"score_gpt":0.227092016744194,"score_spread":0.2178136273197107,"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."}}