{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002544135,0.00008131393,0.00008151728,0.00005241074,0.00009237226,0.0002197551,0.000758354,0.00001958211,0.00001984122],"category_scores_gemma":[0.00004846656,0.00006923063,0.0000426271,0.0001583103,0.0000123817,0.0007387848,0.000303806,0.00003261557,0.000121647],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008670345,"about_ca_system_score_gemma":0.000009763966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002780831,"about_ca_topic_score_gemma":0.00001506342,"domain_scores_codex":[0.9992667,0.00001416475,0.00009722065,0.0002708785,0.0001258166,0.0002251478],"domain_scores_gemma":[0.9993569,0.00008660097,0.00003197979,0.0004427002,0.00002632168,0.00005549942],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001819645,0.00003372063,0.0001811351,0.00002798824,0.00001283899,0.00000205981,0.0001026757,0.00004952745,0.0001334776,0.6725795,0.09233344,0.2345418],"study_design_scores_gemma":[0.0005120928,0.00008993563,0.0005056148,0.00001035998,0.000006235533,0.00000111523,0.00003339758,0.5025396,0.0009759119,0.008476977,0.4865994,0.0002493494],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001789163,0.000007487709,0.9406135,0.0008104093,0.0004372481,0.0001393539,0.00000179198,0.0002086831,0.05760257],"genre_scores_gemma":[0.2644143,0.00001198287,0.7089306,0.007784642,0.0004447421,0.00004634369,0.00002502428,0.00002116291,0.01832128],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6641025,"threshold_uncertainty_score":0.2823143,"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."}}