{"id":"W2176441584","doi":"10.1109/pacrim.2015.7334826","title":"The Area Code Tree for nearest neighbour searching","year":2015,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Computer science; Code (set theory); Nearest neighbour; Trie; Tree (set theory); Sequence (biology); k-nearest neighbors algorithm; Nearest neighbor search; Chain code; Algorithm; Theoretical computer science; Data structure; Data mining; Artificial intelligence; Mathematics; Combinatorics; Programming language","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.0005846375,0.00005752131,0.00004980974,0.00002437184,0.000188378,0.0007367128,0.001167966,0.00001037986,0.000002725971],"category_scores_gemma":[0.00007475013,0.00003385056,0.00002844672,0.0001181159,0.00002237742,0.0005318895,0.0004359965,0.00004363135,0.00005794456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000124873,"about_ca_system_score_gemma":0.00003048958,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003132019,"about_ca_topic_score_gemma":0.0001316128,"domain_scores_codex":[0.9993083,0.00001932615,0.00008084349,0.0001764983,0.0001888178,0.0002262024],"domain_scores_gemma":[0.9992639,0.0001327668,0.00002195822,0.0004562509,0.00004391317,0.00008125768],"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.000004418957,0.00001651392,0.000183428,0.000002641616,0.00001136167,0.000003158332,0.0001534964,0.00003811176,0.000006847511,0.4476499,0.1518797,0.4000505],"study_design_scores_gemma":[0.0003066998,0.00005406579,0.0004833963,0.00000265521,0.0000019847,0.000001065267,0.0001092855,0.5386511,0.00006873104,0.01700557,0.4432358,0.00007958917],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002755183,0.00003028804,0.9457122,0.006693606,0.0003177255,0.0001645867,0.000004470901,0.0001179189,0.0466837],"genre_scores_gemma":[0.307747,0.00005233288,0.5702741,0.003626563,0.0009109082,0.0001633639,0.00005686034,0.00004180255,0.117127],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.538613,"threshold_uncertainty_score":0.7104139,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09276382512785833,"score_gpt":0.2980709151642166,"score_spread":0.2053070900363582,"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."}}