{"id":"W2043815117","doi":"10.1145/1463434.1463520","title":"Optimal incremental multi-step nearest-neighbor search","year":2008,"lang":"en","type":"article","venue":"","topic":"Advanced Image and Video Retrieval Techniques","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Computer science; k-nearest neighbors algorithm; Process (computing); Set (abstract data type); Algorithm; Nearest-neighbor chain algorithm; Feature (linguistics); Nearest neighbor search; Best bin first; Artificial intelligence; Cluster analysis","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.001545749,0.0006150242,0.001939088,0.001149207,0.0006706406,0.0007772201,0.002685324,0.001369681,0.002079535],"category_scores_gemma":[0.006627877,0.0006052629,0.000844127,0.00105581,0.0005318218,0.001876528,0.001407828,0.0007592475,0.0005496937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006092835,"about_ca_system_score_gemma":0.001354418,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003514391,"about_ca_topic_score_gemma":0.004514627,"domain_scores_codex":[0.9984149,0.0003370129,0.0001377769,0.0003296187,0.0006167222,0.0001638943],"domain_scores_gemma":[0.9976012,0.001114798,0.0001367936,0.0004553924,0.0006253598,0.00006640184],"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.0006194019,0.000256914,0.002033057,0.000239583,0.0001005306,0.0002003186,0.0001502785,0.4278213,0.01045561,0.01328901,0.00422474,0.5406092],"study_design_scores_gemma":[0.00003749744,0.00006113674,0.0002339935,0.000005728192,0.00001713314,0.00008708861,0.00001356602,0.9927052,0.002360629,0.003609757,0.0008552259,0.000013124],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01857361,0.000343056,0.9790823,0.00005671775,0.00004451398,0.000080629,0.00004807036,0.0004706888,0.001300317],"genre_scores_gemma":[0.2375543,0.0001553464,0.7602779,0.0000837589,0.0000482804,0.0001691534,0.0002791662,0.00007051982,0.001361601],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003514391,"threshold_uncertainty_score":0.008174777,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05841050307307297,"score_gpt":0.323476103225885,"score_spread":0.2650656001528121,"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."}}