{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00004994025,0.00003668081,0.00003137148,0.00003728693,0.00003059792,0.0000971873,0.000365578,0.00000831197,0.0001471555],"category_scores_gemma":[0.000003097403,0.0000297932,0.00001342389,0.0001552865,0.000006645738,0.0008320238,0.0001227962,0.00001955543,0.0007244228],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005627401,"about_ca_system_score_gemma":6.995007e-7,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000003642032,"about_ca_topic_score_gemma":0.000001810392,"domain_scores_codex":[0.9996324,0.000007547499,0.00005080809,0.0001280331,0.00009904557,0.00008219336],"domain_scores_gemma":[0.9997227,0.000007851297,0.00001491494,0.0002253359,0.000009785712,0.00001943794],"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":[1.13801e-7,0.00002183604,0.000008285948,7.97489e-7,0.000002984696,0.000001854504,0.0000730183,0.000003000494,0.000005724757,0.347229,0.02729571,0.6253576],"study_design_scores_gemma":[0.00009742011,0.00002339974,0.0002522725,0.000001186502,9.928563e-7,6.572678e-7,0.00001458141,0.9810225,0.0001338407,0.003570317,0.01482237,0.00006048001],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003443557,0.00001171691,0.7297686,0.0006112618,0.00006345091,0.00003839071,2.295182e-7,0.0001166734,0.2693553],"genre_scores_gemma":[0.2498332,0.00001791329,0.7029245,0.0007922864,0.00009204325,0.00001369489,0.000004608051,0.000004693356,0.04631703],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9810195,"threshold_uncertainty_score":0.9311231,"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."}}