{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","open_science"],"consensus_categories":[],"category_scores_codex":[0.0001907829,0.0003516352,0.0002624104,0.0002308448,0.000355239,0.0008455923,0.009656291,0.0002613342,0.000005642744],"category_scores_gemma":[0.0001842162,0.0002500007,0.00003804621,0.0001429255,0.000365467,0.0004973471,0.007736645,0.0007591789,0.00001883406],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002598511,"about_ca_system_score_gemma":0.00003565713,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002066449,"about_ca_topic_score_gemma":0.00004100352,"domain_scores_codex":[0.9988448,0.00001274364,0.0002217553,0.0005026425,0.0001831031,0.0002349304],"domain_scores_gemma":[0.9899034,0.0003851067,0.0001403614,0.009495675,0.00005548951,0.00001999532],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000001979973,0.00002156177,0.000002629571,0.00005264363,0.0001559378,0.000007647232,0.0001019787,0.0008857964,0.0000555072,0.742537,0.001765677,0.2544116],"study_design_scores_gemma":[0.0001492963,0.0001305556,0.00001484315,0.0004238815,0.0001038035,0.00003140765,0.0001195019,0.3400249,0.0001061434,0.06295052,0.5951785,0.0007666087],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002990992,0.01025027,0.9685019,0.007211106,0.0002393431,0.0004299076,0.0003832903,0.002745166,0.01020916],"genre_scores_gemma":[0.145127,0.02138202,0.8258028,0.0005423572,0.0003720968,0.00008300987,0.002209609,0.000224974,0.004256113],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6795865,"threshold_uncertainty_score":0.9999952,"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."}}