{"id":"W2613845756","doi":"10.1109/aina.2017.30","title":"A Compact-Trie-Based Structure for K-Nearest-Neighbour Searching","year":2017,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Trie; Nearest neighbour; k-nearest neighbors algorithm; Computer science; Grid; Nearest neighbor search; Space (punctuation); Data structure; Space partitioning; Algorithm; Pattern recognition (psychology); Data mining; Mathematics; Artificial intelligence; Geometry","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0002141507,0.0001080065,0.0001160946,0.00006922437,0.0006609811,0.001887829,0.002286646,0.00002746005,0.00004843432],"category_scores_gemma":[0.00008506889,0.00008538262,0.00005751091,0.00005093939,0.00004308033,0.001086031,0.0003380882,0.00008448883,0.0000254722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001384328,"about_ca_system_score_gemma":0.00004333408,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001074924,"about_ca_topic_score_gemma":0.00004349021,"domain_scores_codex":[0.9990604,0.0000165126,0.0001020795,0.0003090944,0.0002153304,0.0002965993],"domain_scores_gemma":[0.9985291,0.00007450471,0.00008162321,0.001179414,0.0000460148,0.00008933337],"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.00003767564,0.0001177061,0.006880478,0.0001471442,0.00008817523,0.00004581526,0.0002406764,0.0004697834,0.0009088895,0.5395535,0.07855574,0.3729545],"study_design_scores_gemma":[0.001491748,0.000114165,0.02312723,0.00002653681,0.000009381507,0.000001673195,0.00001625721,0.8673784,0.003649513,0.01767951,0.08616097,0.0003446242],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004985149,0.000008038123,0.9813477,0.005432604,0.0003820497,0.0003158321,0.00004567636,0.0001622942,0.00732061],"genre_scores_gemma":[0.8379448,8.661029e-7,0.1590071,0.0005793369,0.0001464742,0.000004557752,0.00002226618,0.000008779411,0.002285775],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8669086,"threshold_uncertainty_score":0.9991483,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03684698012904807,"score_gpt":0.3117793133192961,"score_spread":0.274932333190248,"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."}}