{"id":"W2349743712","doi":"","title":"ADAPTIVE APPROXIMATION TREE","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Management and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"CAE (Canada)","funders":"","keywords":"Computer science; Tree structure; Data structure; Curse of dimensionality; Space partitioning; Tree (set theory); Partition (number theory); Search tree; k-d tree; Skew; Algorithm; Data mining; Trie; Search engine indexing; Tree traversal; Theoretical computer science; Search algorithm; Artificial intelligence; Mathematics","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.0006751074,0.0002816273,0.0009365183,0.00144512,0.0007154523,0.001424575,0.001169487,0.0006718797,0.002767988],"category_scores_gemma":[0.004459486,0.0002543855,0.0005977238,0.002888368,0.0005072375,0.002704437,0.001033252,0.0009875491,0.0009846775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006974915,"about_ca_system_score_gemma":0.0009453375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002240145,"about_ca_topic_score_gemma":0.001555931,"domain_scores_codex":[0.999235,0.0001415144,0.00005292068,0.0001202405,0.0003772166,0.00007314282],"domain_scores_gemma":[0.9986861,0.0004808252,0.0001085036,0.0002374109,0.0004148917,0.00007231425],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0002581732,0.0001094634,0.003898858,0.0003765619,0.0001092313,0.0002560183,0.0003438367,0.1497576,0.01205975,0.2421374,0.01509254,0.5756005],"study_design_scores_gemma":[0.0000239799,0.0001497333,0.0006415306,0.00003649519,0.00004162079,0.0005294837,0.00007871491,0.8916227,0.00391885,0.081448,0.02148321,0.00002577338],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0134782,0.001713117,0.9806126,0.0002456592,0.00009607051,0.00004449733,0.0001465873,0.0003878366,0.00327542],"genre_scores_gemma":[0.2602466,0.00278862,0.7293226,0.000212938,0.0001742297,0.0001763057,0.0009815366,0.0001381927,0.005958964],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002767988,"threshold_uncertainty_score":0.00925982,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0378300175276246,"score_gpt":0.2109307021366941,"score_spread":0.1731006846090695,"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."}}