{"id":"W1497909917","doi":"10.1007/978-3-540-45227-0_59","title":"Efficient Indexing of High Dimensional Normalized Histograms","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Search engine indexing; Histogram; Computer science; Nearest neighbor search; R-tree; Similarity (geometry); Tree (set theory); k-nearest neighbors algorithm; Indexation; Feature (linguistics); Constraint (computer-aided design); Data structure; Feature vector; Data mining; Pattern recognition (psychology); Information retrieval; Artificial intelligence; Spatial analysis; Image (mathematics); Mathematics; Spatial database; Combinatorics","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.000633801,0.0007858374,0.001917956,0.003753336,0.001088179,0.004062666,0.002726252,0.0007380873,0.01818921],"category_scores_gemma":[0.00472733,0.0006276742,0.0007290106,0.01030813,0.0006878882,0.00541219,0.003310127,0.001038588,0.00666806],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001100817,"about_ca_system_score_gemma":0.001396896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002489054,"about_ca_topic_score_gemma":0.004213337,"domain_scores_codex":[0.9988856,0.0001432125,0.0001027753,0.0001555455,0.0005526372,0.0001602688],"domain_scores_gemma":[0.9976707,0.0004658689,0.000126998,0.0009821109,0.0006134789,0.0001408321],"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.0004675357,0.0001937877,0.001176245,0.000384224,0.00004382156,0.0001027292,0.0001677707,0.008973086,0.02649779,0.04764171,0.04156765,0.8727836],"study_design_scores_gemma":[0.0002459374,0.0003819182,0.004149857,0.0001852056,0.0001142038,0.001385393,0.0006141919,0.5146303,0.09079118,0.2773703,0.109929,0.0002025277],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03352613,0.003041481,0.9344286,0.0002894129,0.0004551177,0.000196017,0.003789582,0.01377547,0.01049809],"genre_scores_gemma":[0.201427,0.002095305,0.7651944,0.0001985895,0.0003512968,0.0003239819,0.01427504,0.001627738,0.01450667],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01818921,"threshold_uncertainty_score":0.06084901,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01239648111606394,"score_gpt":0.22114698413863,"score_spread":0.2087505030225661,"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."}}