{"id":"W2115185960","doi":"10.1007/978-3-319-19315-1_27","title":"Kinetic Reverse k-Nearest Neighbor Problem","year":2015,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; University of Waterloo","funders":"","keywords":"k-nearest neighbors algorithm; Combinatorics; Integer (computer science); Dimension (graph theory); Kinetic energy; Set (abstract data type); Nearest-neighbor chain algorithm; Point (geometry); Computer science; Nearest neighbor search; Nearest neighbor graph; Algorithm; Mathematics; Discrete mathematics; Physics; Geometry; Artificial intelligence; Cluster analysis; Quantum mechanics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009719775,0.0004656278,0.000416328,0.000894093,0.0002052377,0.0005554672,0.002382529,0.0002620335,0.00003629131],"category_scores_gemma":[0.0001079248,0.0004402696,0.0001057486,0.0009715699,0.0003439021,0.0006890011,0.001092359,0.0006064624,0.0001794017],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003507056,"about_ca_system_score_gemma":0.001108253,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002273745,"about_ca_topic_score_gemma":0.00005166887,"domain_scores_codex":[0.9961759,0.00004133131,0.0005095857,0.001417143,0.001308315,0.0005477463],"domain_scores_gemma":[0.9975404,0.0002608441,0.0002628871,0.001080425,0.0005867286,0.0002686806],"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.000006604688,0.00003868827,0.00001460631,0.00004015265,0.00001028796,0.0001002553,0.0004303778,0.2380995,0.0001245709,0.08713719,0.00107724,0.6729206],"study_design_scores_gemma":[0.0003876178,0.0002666364,0.00008136051,0.0002572607,0.000009774037,0.0001250537,8.996514e-8,0.5648204,0.000416888,0.3908714,0.0419901,0.0007733812],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000244187,0.0006829327,0.9839795,0.001153854,0.001808885,0.0004259423,0.000005461255,0.000163182,0.01175585],"genre_scores_gemma":[0.05751158,0.00004470447,0.9357195,0.002062848,0.001303573,0.00001841636,0.00003123056,0.00004594544,0.003262141],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6721472,"threshold_uncertainty_score":0.9998049,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02665015439700633,"score_gpt":0.254776265792872,"score_spread":0.2281261113958657,"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."}}