{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009603748,0.0005598363,0.001507882,0.0006533272,0.001028489,0.002276459,0.00339581,0.002641149,0.01240795],"category_scores_gemma":[0.005793022,0.00040057,0.0008600238,0.001064779,0.001140086,0.004478463,0.002157669,0.002437485,0.002287179],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008504433,"about_ca_system_score_gemma":0.0009108754,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001636559,"about_ca_topic_score_gemma":0.001411137,"domain_scores_codex":[0.9991517,0.0001996315,0.00006029521,0.000238924,0.0002558755,0.00009359951],"domain_scores_gemma":[0.9984159,0.0007815082,0.0001332478,0.0002812743,0.0002825842,0.0001053771],"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.0004756224,0.0002053198,0.000898973,0.0009813732,0.00009071805,0.0003739202,0.000192273,0.1962546,0.002708885,0.5986477,0.04750977,0.1516609],"study_design_scores_gemma":[0.00009502572,0.00006023388,0.0002251057,0.00006731851,0.00003698832,0.0005107088,0.000174252,0.5733849,0.001923054,0.4062739,0.01720819,0.00004020263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06271581,0.001941731,0.8599668,0.003751864,0.001170437,0.0002010615,0.001605333,0.0005518121,0.06809517],"genre_scores_gemma":[0.6303889,0.002361741,0.2658104,0.001075177,0.0007824831,0.0003903498,0.004306527,0.0005006392,0.09438372],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01240795,"threshold_uncertainty_score":0.04150873,"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."}}