{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001778593,0.000124924,0.0001638372,0.00006470903,0.00005208985,0.0005812336,0.0008258533,0.00002921703,0.00002894845],"category_scores_gemma":[0.00002729361,0.0001083184,0.00002906733,0.0004393291,0.0000195461,0.001369705,0.0006871752,0.000109432,0.00009494056],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001534936,"about_ca_system_score_gemma":0.00002871094,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006313547,"about_ca_topic_score_gemma":0.00002624504,"domain_scores_codex":[0.9988489,0.00003217073,0.0002251371,0.0004129169,0.0001886446,0.0002922286],"domain_scores_gemma":[0.999531,0.00001167914,0.00006339262,0.0002709455,0.00002430591,0.00009868432],"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.00003206218,0.00023929,0.006187093,0.0003519597,0.00001846867,0.0005255865,0.004073935,0.000259908,0.0004143711,0.03273305,0.01833515,0.9368291],"study_design_scores_gemma":[0.000641487,0.00005480219,0.003178357,0.00003373367,0.000002684801,0.000004225716,0.0001787375,0.9910141,0.0001942293,0.0009220822,0.003537518,0.0002380956],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008100465,0.00007037673,0.9547943,0.01457545,0.0001602645,0.000354905,0.000004136409,0.0005074739,0.02143259],"genre_scores_gemma":[0.8809787,0.000008543052,0.1121988,0.006071348,0.00009115927,0.00001671125,0.00001789354,0.00001542456,0.0006014449],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9907541,"threshold_uncertainty_score":0.5604849,"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."}}