{"id":"W3116728211","doi":"10.1109/iemcon51383.2020.9284839","title":"Approximate Continuous Nearest Neighbour Query Processing in Clustered Point Sets","year":2020,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Lethbridge","funders":"","keywords":"Nearest neighbour; Computer science; k-nearest neighbors algorithm; Set (abstract data type); Point (geometry); Cluster analysis; Data mining; Nearest-neighbor chain algorithm; Pattern recognition (psychology); Artificial intelligence; Mathematics; Fuzzy clustering; Canopy clustering algorithm","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.002412157,0.001054905,0.002476043,0.002275274,0.00136048,0.002744726,0.004187848,0.0021549,0.002378072],"category_scores_gemma":[0.01268035,0.0008098535,0.001296389,0.0051309,0.001011461,0.004295071,0.00309694,0.001492449,0.001878575],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001438595,"about_ca_system_score_gemma":0.001214896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01060174,"about_ca_topic_score_gemma":0.01019451,"domain_scores_codex":[0.9940062,0.001007266,0.0005245612,0.001240497,0.002780124,0.0004413418],"domain_scores_gemma":[0.9947056,0.001954003,0.0003550334,0.001486724,0.001347196,0.0001515146],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001485416,0.0004385671,0.005111529,0.0007146587,0.0003420037,0.0007860826,0.001293507,0.5548524,0.03031351,0.02726289,0.009475603,0.3679239],"study_design_scores_gemma":[0.00003083716,0.0001004453,0.0006467763,0.00001870682,0.00001784803,0.0002695033,0.0002695053,0.9759107,0.005542157,0.01462537,0.002530082,0.00003804643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02644238,0.000523852,0.9696871,0.0001383058,0.0000705432,0.0001199905,0.0002948169,0.00150306,0.001220002],"genre_scores_gemma":[0.3879966,0.000305548,0.6078246,0.0001657933,0.00008486561,0.0001744346,0.001573104,0.000203359,0.001671767],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01060174,"threshold_uncertainty_score":0.02108008,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02447900790616914,"score_gpt":0.2410318627861896,"score_spread":0.2165528548800205,"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."}}