{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001018298,0.0003109902,0.0003714338,0.0007552983,0.0004076085,0.0001782184,0.001185926,0.0001372514,0.0001409702],"category_scores_gemma":[0.0001859016,0.0002382698,0.0001785307,0.003433952,0.0002652433,0.0005675133,0.0001809736,0.0004683801,0.00005000351],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000196333,"about_ca_system_score_gemma":0.0008345009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00185338,"about_ca_topic_score_gemma":0.0001227909,"domain_scores_codex":[0.9965403,0.0002404247,0.000685211,0.0006134995,0.001485451,0.0004351045],"domain_scores_gemma":[0.9976647,0.0009325994,0.0003164276,0.0003072373,0.0006153476,0.0001636464],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001436829,0.0005890613,0.001546951,0.0001959099,0.00008831258,0.00001142544,0.003994981,0.9083483,0.0002686785,0.06784681,0.004507126,0.01245882],"study_design_scores_gemma":[0.0008155772,0.0003338189,0.2596044,0.0002097553,0.0000199644,0.00008537887,0.0004246474,0.7278759,0.0001813362,0.009725319,0.0004306755,0.0002932314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9596735,0.0001909714,0.02335892,0.00333252,0.0002407656,0.001216011,0.0001455121,0.00006016484,0.01178165],"genre_scores_gemma":[0.9853006,0.00001154774,0.01318872,0.001020918,0.00008864938,0.0000280215,0.0001859343,0.00001726021,0.0001583391],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.2580574,"threshold_uncertainty_score":0.9716362,"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."}}