{"id":"W165396895","doi":"","title":"K-Nearest Neighbor Search using the Pyramid Technique.","year":2006,"lang":"en","type":"article","venue":"Canadian Conference on Computational Geometry","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Pyramid (geometry); k-nearest neighbors algorithm; RADIUS; Best bin first; Nearest neighbor graph; Nearest neighbor search; Nearest-neighbor chain algorithm; Range (aeronautics); Point (geometry); Range query (database); Mathematics; Computer science; Pattern recognition (psychology); Algorithm; Artificial intelligence; Combinatorics; Geometry; Search engine; Information retrieval; Cluster analysis; Web search query","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.0003321209,0.0001592955,0.0001164153,0.0005515924,0.0004152929,0.0007250426,0.001274665,0.00005508286,0.0001345879],"category_scores_gemma":[0.00001809414,0.0001345855,0.00004681569,0.001111447,0.0001230558,0.0003805865,0.0001579021,0.0002200421,0.0001441538],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001789497,"about_ca_system_score_gemma":0.0007405661,"about_ca_topic_candidate":true,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.02386615,"about_ca_topic_score_gemma":0.00443914,"domain_scores_codex":[0.9984418,0.00006019503,0.0001944207,0.000395789,0.0004650658,0.0004426889],"domain_scores_gemma":[0.998996,0.0001159614,0.00005317559,0.0004473826,0.000201597,0.000185932],"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.000001802048,0.00002830915,0.0005418776,0.000008387229,0.00001419252,0.00005894303,0.00002573104,0.02988347,0.00003958682,0.9454305,0.005021274,0.01894595],"study_design_scores_gemma":[0.0001895945,0.0000595707,0.01248828,0.00003522048,0.00000555418,0.00002152367,0.00004273995,0.935026,0.000112969,0.03949968,0.01219313,0.0003256694],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00622216,0.00003740421,0.9696585,0.004957411,0.0003216359,0.0003950076,0.00008280575,0.00011054,0.01821453],"genre_scores_gemma":[0.9611409,0.000001772226,0.03685314,0.001125814,0.0001625276,0.00001639037,0.0001016609,0.00001164973,0.0005861534],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9549187,"threshold_uncertainty_score":0.982634,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04234192041526704,"score_gpt":0.2690653430377264,"score_spread":0.2267234226224593,"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."}}