{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006602325,0.0006217252,0.001412312,0.002060357,0.001032145,0.001133969,0.001508467,0.0009742359,0.003121241],"category_scores_gemma":[0.003577764,0.0004711813,0.0009836471,0.003799632,0.0004408192,0.002587195,0.001692698,0.0008369819,0.002268742],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005232315,"about_ca_system_score_gemma":0.001471913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.008304523,"about_ca_topic_score_gemma":0.009829401,"domain_scores_codex":[0.9986866,0.0001717675,0.00009272542,0.0002359905,0.0007222928,0.00009063568],"domain_scores_gemma":[0.9990482,0.0002418758,0.00008091386,0.0002610051,0.0003304418,0.00003761459],"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.0002850586,0.0002639467,0.002405299,0.0006171166,0.0003969143,0.0004275312,0.0003023946,0.08260993,0.02272752,0.02134811,0.01889886,0.8497174],"study_design_scores_gemma":[0.0001356459,0.0003337687,0.002139638,0.00008002773,0.0001722865,0.002052462,0.0002547969,0.8985834,0.01960817,0.03978513,0.03672504,0.0001296326],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006244716,0.0009355714,0.9884239,0.00007547032,0.00009808308,0.0001440809,0.0001679548,0.001218155,0.002692143],"genre_scores_gemma":[0.09126136,0.0007484317,0.9045633,0.0001035308,0.00005018698,0.0001442846,0.0006946899,0.00007187712,0.002362418],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008304523,"threshold_uncertainty_score":0.01651239,"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."}}