{"id":"W2096077837","doi":"10.1109/cvpr.1997.609451","title":"Shape indexing using approximate nearest-neighbour search in high-dimensional spaces","year":2002,"lang":"en","type":"article","venue":"","topic":"Image Retrieval and Classification Techniques","field":"Computer Science","cited_by":883,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Search engine indexing; Computer science; Curse of dimensionality; Pattern recognition (psychology); Nearest neighbor search; Hash function; Best bin first; Feature vector; Feature (linguistics); k-nearest neighbors algorithm; k-d tree; Object (grammar); R-tree; Cover tree; Artificial intelligence; Data mining; Algorithm; Mathematics; Spatial database; Spatial analysis; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003144819,0.0001153336,0.000132372,0.0002073494,0.0001144949,0.0002382897,0.0004853363,0.00006833624,0.0003512319],"category_scores_gemma":[0.00002480704,0.00009802065,0.00003399385,0.0007015346,0.00005263559,0.0005730937,0.0002480961,0.000181486,0.00006191293],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006722023,"about_ca_system_score_gemma":0.00003112356,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001663538,"about_ca_topic_score_gemma":0.000003885293,"domain_scores_codex":[0.9986902,0.00006812475,0.0002086939,0.0003469217,0.0003747371,0.0003112968],"domain_scores_gemma":[0.9994361,0.00005694922,0.00004553534,0.0003079273,0.00008088486,0.00007263826],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002694128,0.0009192653,0.01701837,0.0001356318,0.00003860438,0.0002394588,0.002239398,0.001003949,0.111034,0.4892129,0.001265147,0.3768664],"study_design_scores_gemma":[0.0001535505,0.00002431435,0.001889235,0.0000239669,8.975399e-7,0.00001580929,0.0000181803,0.9629192,0.0331849,0.001506512,0.0001164379,0.0001469792],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2249658,0.000159399,0.7684211,0.002353053,0.0001099694,0.0002386395,0.000001199941,0.0005108344,0.003240016],"genre_scores_gemma":[0.8697377,0.00001295355,0.1292931,0.0002224785,0.0000287682,0.000004935496,6.761106e-7,0.000007680976,0.0006916711],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9619153,"threshold_uncertainty_score":0.3997166,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05703096822241217,"score_gpt":0.2762426762444814,"score_spread":0.2192117080220692,"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."}}