{"id":"W2069358561","doi":"10.1007/s00454-004-1152-0","title":"Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries","year":2005,"lang":"en","type":"article","venue":"Discrete & Computational Geometry","topic":"Computational Geometry and Mesh Generation","field":"Computer Science","cited_by":168,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University; Carleton University; University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada; McGill University; Alexander von Humboldt-Stiftung","keywords":"Mathematics; Combinatorics; Boundary (topology); Algorithm; Nearest neighbour; Set (abstract data type); Point (geometry); Decision boundary; Decision rule; Line segment; k-nearest neighbors algorithm; Computer science; Artificial intelligence; Geometry; Statistics; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":true,"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.00482629,0.001228619,0.002216626,0.001912105,0.001456076,0.002933954,0.003945647,0.002496717,0.006467793],"category_scores_gemma":[0.02609133,0.001011947,0.001021929,0.002036292,0.001371673,0.003007807,0.004072119,0.003074788,0.001606115],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001881532,"about_ca_system_score_gemma":0.001879364,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003977254,"about_ca_topic_score_gemma":0.004708797,"domain_scores_codex":[0.9961483,0.001129212,0.0003262533,0.0005813779,0.001565832,0.0002489666],"domain_scores_gemma":[0.9866394,0.009012174,0.0005362732,0.001389252,0.002187992,0.0002348067],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0006126647,0.0002231292,0.001369416,0.0002439335,0.00009033246,0.00009443065,0.0002395411,0.4753016,0.004222755,0.041286,0.004565534,0.4717507],"study_design_scores_gemma":[0.0000213441,0.0000290125,0.0001229186,0.00001399053,0.0000118996,0.00002592018,0.0000183578,0.9759057,0.002617449,0.02060439,0.0006186398,0.00001029732],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006086241,0.0001392936,0.9920345,0.0000663906,0.00003913838,0.00005425427,0.00006011784,0.000744778,0.00077529],"genre_scores_gemma":[0.2171212,0.0001496074,0.7786116,0.000186187,0.00007193751,0.0002715776,0.0005829132,0.0004271852,0.002577822],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006467793,"threshold_uncertainty_score":0.0255242,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02113207701903566,"score_gpt":0.2978808491474306,"score_spread":0.2767487721283949,"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."}}