{"id":"W4391417631","doi":"10.48550/arxiv.2401.15330","title":"Optimal Sparse Survival Trees","year":2024,"lang":"en","type":"preprint","venue":"PubMed","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"National Institute on Drug Abuse; Natural Sciences and Engineering Research Council of Canada; National Institutes of Health","keywords":"Tree (set theory); Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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.001701577,0.0009517006,0.001258108,0.001350793,0.0008756638,0.001567175,0.001170822,0.001880218,0.009668672],"category_scores_gemma":[0.01755545,0.0007408949,0.001327796,0.001848161,0.001181738,0.003045626,0.001740181,0.002367358,0.002387814],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001154856,"about_ca_system_score_gemma":0.001365304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002003205,"about_ca_topic_score_gemma":0.004190121,"domain_scores_codex":[0.9988096,0.0003986822,0.00005525236,0.0002919376,0.0002869703,0.0001575667],"domain_scores_gemma":[0.9911238,0.007188229,0.0004257697,0.0004727115,0.0005478609,0.0002416302],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002777956,0.0001515632,0.00371477,0.0004562459,0.00007159662,0.0003270415,0.0004334852,0.5217023,0.002657869,0.2962976,0.04286734,0.1310424],"study_design_scores_gemma":[0.00003231088,0.0000344191,0.0003357576,0.00006463387,0.0000185911,0.0001191267,0.00005770853,0.6047163,0.0005401179,0.3894641,0.004604397,0.00001255669],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04247099,0.0009920121,0.9394518,0.001739184,0.00007837922,0.0001300037,0.003049012,0.001245536,0.01084321],"genre_scores_gemma":[0.6112591,0.002237744,0.36034,0.001037115,0.0003850839,0.0006818772,0.01117518,0.0007605874,0.01212331],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009668672,"threshold_uncertainty_score":0.03234494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0481242319359733,"score_gpt":0.2576262829636149,"score_spread":0.2095020510276417,"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."}}