{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007692032,0.0006802282,0.001452544,0.002663098,0.001137896,0.001634565,0.00235986,0.001349792,0.005308553],"category_scores_gemma":[0.006616712,0.0005450498,0.0008546354,0.003770209,0.0008260966,0.00322148,0.002075419,0.001007561,0.003844024],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006698109,"about_ca_system_score_gemma":0.001077466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003364893,"about_ca_topic_score_gemma":0.003583255,"domain_scores_codex":[0.9983642,0.0003629085,0.0001583515,0.0002607302,0.0007392538,0.000114598],"domain_scores_gemma":[0.9975526,0.0006208658,0.0001884292,0.0006694813,0.0008711737,0.0000973986],"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.0005728279,0.0003105549,0.001995408,0.0006903636,0.000151466,0.0003837821,0.00077969,0.1717989,0.02476791,0.06483906,0.01877729,0.7149327],"study_design_scores_gemma":[0.00008676943,0.0003038792,0.0006506081,0.00006195338,0.00003329009,0.0009906946,0.0002173861,0.9377773,0.01072382,0.02532113,0.0237318,0.0001012149],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007339363,0.0005415099,0.9883859,0.0001150581,0.0000912718,0.000127913,0.0002180205,0.0008388381,0.002342211],"genre_scores_gemma":[0.1114103,0.0005145565,0.8835533,0.0001413479,0.00007533914,0.0003797175,0.001211846,0.000190178,0.002523393],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005308553,"threshold_uncertainty_score":0.01775885,"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."}}