{"id":"W2117379916","doi":"10.1109/icde.2005.92","title":"Monitoring k-Nearest Neighbor Queries over Moving Objects","year":2005,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":307,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Search engine indexing; Computer science; Scalability; k-nearest neighbors algorithm; Grid; Data mining; Tree (set theory); Best bin first; Nearest neighbor search; R-tree; Object (grammar); Spatial database; Artificial intelligence; Spatial analysis; Database; 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":[],"consensus_categories":[],"category_scores_codex":[0.0001077251,0.00009752669,0.00007681076,0.00006842743,0.0001057309,0.0004774391,0.0006724987,0.00002086751,0.00009619522],"category_scores_gemma":[0.00001573373,0.00008516241,0.0000297754,0.0002106976,0.00001579864,0.002239634,0.0005255559,0.0000621896,0.00031481],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002633714,"about_ca_system_score_gemma":0.0000133792,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006412081,"about_ca_topic_score_gemma":0.00002033954,"domain_scores_codex":[0.9991605,0.0000113102,0.0001149771,0.0002601796,0.0002084845,0.0002445522],"domain_scores_gemma":[0.9994337,0.00002825843,0.00003001871,0.0004318919,0.00001854353,0.00005760579],"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.000002071062,0.00006526091,0.01268947,0.00001650027,0.00002573828,0.00002913919,0.0006249039,0.0001511573,0.000571659,0.09421487,0.004724487,0.8868847],"study_design_scores_gemma":[0.001346576,0.0001509617,0.1756628,0.0001432385,0.00002102945,0.00001176657,0.0005178123,0.3960638,0.04298736,0.002656728,0.3789272,0.001510781],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06814007,0.0003470975,0.7357662,0.002599268,0.002241099,0.0002806033,0.000002319812,0.001491088,0.1891323],"genre_scores_gemma":[0.8051842,0.00004032377,0.1847251,0.0003425222,0.0006811144,0.000008043694,0.000001546075,0.000009283793,0.009007884],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.885374,"threshold_uncertainty_score":0.4603956,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01336887839657592,"score_gpt":0.2457943660586419,"score_spread":0.232425487662066,"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."}}