{"id":"W2041305873","doi":"10.1145/2668064.2677081","title":"(Reverse) <i>k</i> -nearest neighbors for moving objects","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Object (grammar); Simple (philosophy); Trajectory; Nearest neighbor search; Term (time); Artificial intelligence","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.001181375,0.0008343438,0.001092804,0.00164628,0.0009714321,0.001790796,0.002850277,0.00179884,0.006957889],"category_scores_gemma":[0.009258622,0.0004845372,0.0009962094,0.002511576,0.001006628,0.005450096,0.003389452,0.00187012,0.005809832],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005634742,"about_ca_system_score_gemma":0.0007949174,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004237056,"about_ca_topic_score_gemma":0.006939098,"domain_scores_codex":[0.9976352,0.0003577906,0.0002384863,0.0006158629,0.0009614208,0.0001912361],"domain_scores_gemma":[0.9972934,0.0005453078,0.0002372854,0.001329582,0.0005063296,0.00008805816],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008043963,0.0002536087,0.005338657,0.00114899,0.0001469407,0.0008142191,0.0008125983,0.05477235,0.02216385,0.2333149,0.07053845,0.609891],"study_design_scores_gemma":[0.0001283208,0.0002929932,0.002043035,0.0001576124,0.0001096876,0.003351442,0.0005350938,0.5002324,0.02684364,0.334175,0.1319434,0.0001873712],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007224884,0.0009264976,0.982335,0.0005384432,0.0003396973,0.0001211654,0.001140275,0.001386385,0.005987637],"genre_scores_gemma":[0.1634207,0.001058222,0.8159515,0.0006216598,0.000329624,0.0002881367,0.003055897,0.0003922001,0.01488206],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006957889,"threshold_uncertainty_score":0.02327645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0097642879889438,"score_gpt":0.217199817514537,"score_spread":0.2074355295255932,"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."}}