{"id":"W2889180561","doi":"10.1007/978-3-319-98530-5_15","title":"Continuous k-Nearest Neighbour Strategies Using the mqrtree","year":2018,"lang":"en","type":"book-chapter","venue":"Lecture notes on data engineering and communications technologies","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Lethbridge","funders":"","keywords":"k-nearest neighbors algorithm; Best bin first; Computer science; Nearest neighbor search; Nearest neighbor graph; Property (philosophy); Nearest neighbour; Data mining; Pattern recognition (psychology); Algorithm; Artificial intelligence","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.001267989,0.0006902392,0.001928602,0.001342486,0.0007422189,0.001849022,0.003777083,0.001503702,0.005863846],"category_scores_gemma":[0.00534168,0.0004921359,0.0009451097,0.002052408,0.0007510304,0.002336924,0.002470908,0.001461433,0.002428889],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006863666,"about_ca_system_score_gemma":0.0009300493,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005614499,"about_ca_topic_score_gemma":0.006007233,"domain_scores_codex":[0.9988476,0.0003281964,0.00007602788,0.0001569161,0.0005154339,0.00007573494],"domain_scores_gemma":[0.9984316,0.0006955371,0.00007143475,0.0003404615,0.0003908309,0.00007003103],"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.0003311928,0.0002088503,0.0005913868,0.0004502824,0.0001440715,0.0001604933,0.0003067171,0.2826773,0.006993239,0.1141673,0.01037475,0.5835945],"study_design_scores_gemma":[0.00003244328,0.00005749789,0.0001080682,0.00003002315,0.00002068259,0.0001458082,0.00004471629,0.9596698,0.001442083,0.03306231,0.005359616,0.00002702279],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003862499,0.0005664739,0.9923006,0.00006958998,0.00007919023,0.00004082145,0.00005710793,0.0004525451,0.002571134],"genre_scores_gemma":[0.1032949,0.0005871325,0.8904213,0.00009565149,0.0000750153,0.0001141524,0.0002377762,0.0002774983,0.004896632],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005863846,"threshold_uncertainty_score":0.01961654,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05135188821761769,"score_gpt":0.2660235016565628,"score_spread":0.2146716134389451,"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."}}