{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009789636,0.0004734673,0.000588363,0.0009358306,0.0001874658,0.0002723105,0.003227532,0.0001964499,0.00003079377],"category_scores_gemma":[0.00004918593,0.0004270475,0.0001470649,0.0007709285,0.0006692173,0.0003166759,0.00193009,0.0005096498,0.00002648912],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002034343,"about_ca_system_score_gemma":0.0002223882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000408154,"about_ca_topic_score_gemma":0.00001325042,"domain_scores_codex":[0.9959812,0.00003508046,0.0006225941,0.001340649,0.001408018,0.000612523],"domain_scores_gemma":[0.9975589,0.0002083893,0.0004157633,0.001462338,0.0002136162,0.0001410141],"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.000007987295,0.0001013707,0.00002448299,0.00006703028,0.00002695129,0.0001110446,0.0002636041,0.1554671,0.0001280739,0.1547682,0.00009879046,0.6889353],"study_design_scores_gemma":[0.0007250735,0.0001963998,0.00007958168,0.0004404157,0.00001876209,0.00004030989,1.144335e-7,0.926024,0.001347051,0.06560641,0.00459443,0.0009274479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000161753,0.0003090664,0.9926923,0.0002935649,0.002522951,0.0003202445,0.000008643842,0.00009424197,0.003597242],"genre_scores_gemma":[0.1025121,0.00001791798,0.8947014,0.001651445,0.0002194438,0.000008049919,0.00002209126,0.00003993652,0.0008275831],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7705569,"threshold_uncertainty_score":0.9998181,"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."}}