{"id":"W2172997417","doi":"10.1016/s0925-7721(00)00021-3","title":"Chromatic nearest neighbor searching: A query sensitive approach☆☆A preliminary version of this paper appeared in the Proceedings of the 7th Canadian Conference on Computational Geometry, 1995, pp. 261–266.","year":2000,"lang":"en","type":"article","venue":"Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"","keywords":"k-nearest neighbors algorithm; Nearest neighbor graph; Preprocessor; Nearest-neighbor chain algorithm; Nearest neighbor search; Best bin first; Computer science; Context (archaeology); Point (geometry); Fixed-radius near neighbors; Chromatic scale; Pattern recognition (psychology); Set (abstract data type); Algorithm; Mathematics; Artificial intelligence; Data mining; Combinatorics; Cluster analysis; Geography; Geometry","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001866108,0.0009587092,0.001840049,0.001498524,0.001662847,0.002027399,0.004430367,0.001379231,0.01909109],"category_scores_gemma":[0.008576974,0.0006066814,0.0007933532,0.004150635,0.001536704,0.004364313,0.004288715,0.0015263,0.003380548],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001577736,"about_ca_system_score_gemma":0.002165055,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01412287,"about_ca_topic_score_gemma":0.02613554,"domain_scores_codex":[0.9966433,0.0006421803,0.0001581976,0.0007468425,0.00148521,0.0003242436],"domain_scores_gemma":[0.9947222,0.00144524,0.0001407391,0.002151882,0.001314734,0.0002251936],"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.002530283,0.0007207146,0.002970336,0.0006554694,0.0002487942,0.0005242905,0.0007225527,0.08321907,0.04604144,0.07888974,0.1153019,0.6681754],"study_design_scores_gemma":[0.0001853689,0.0003380451,0.0009865068,0.00003329068,0.0000834851,0.0005184186,0.0002396767,0.9069695,0.02074946,0.03121121,0.03856446,0.0001205922],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02623054,0.00110608,0.955012,0.001122033,0.0009618969,0.0005979963,0.001032103,0.004336721,0.009600553],"genre_scores_gemma":[0.2989628,0.001150647,0.6724977,0.0006673784,0.0006720293,0.000294231,0.003336282,0.0009890586,0.02142989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01909109,"threshold_uncertainty_score":0.06386608,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01574924328503842,"score_gpt":0.2275778057105498,"score_spread":0.2118285624255114,"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."}}