{"id":"W2892216367","doi":"10.1080/03610918.2018.1490429","title":"BiMM tree: a decision tree method for modeling clustered and longitudinal binary outcomes","year":2018,"lang":"en","type":"article","venue":"Communications in Statistics - Simulation and Computation","topic":"Liver Disease Diagnosis and Treatment","field":"Medicine","cited_by":27,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"National Center for Advancing Translational Sciences; National Institute of Arthritis and Musculoskeletal and Skin Diseases; National Institute of Diabetes and Digestive and Kidney Diseases; National Institutes of Health; National Cancer Institute; National Institute of General Medical Sciences; South Carolina Clinical and Translational Research Institute, Medical University of South Carolina","keywords":"Decision tree; Tree (set theory); Binary tree; Computer science; Optimal binary search tree; K-ary tree; Decision tree model; Interval tree; Tree traversal; Mathematics; Machine learning; Tree structure; Combinatorics; Algorithm","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.009232275,0.001000176,0.001571113,0.002048329,0.000648874,0.001026528,0.002685163,0.001290508,0.005502224],"category_scores_gemma":[0.02203144,0.0006793342,0.002241865,0.002480567,0.000470314,0.001361387,0.00193525,0.002664779,0.001674586],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000740915,"about_ca_system_score_gemma":0.002523617,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003743875,"about_ca_topic_score_gemma":0.006342893,"domain_scores_codex":[0.9957259,0.003081733,0.0001865608,0.0003245772,0.0005484642,0.0001327388],"domain_scores_gemma":[0.9928912,0.005352788,0.0004739992,0.0004173655,0.0005997798,0.0002649114],"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.0005160582,0.0002659771,0.01068178,0.0005317427,0.000884296,0.0002870673,0.0003313079,0.3593931,0.001158163,0.0778404,0.02873033,0.5193799],"study_design_scores_gemma":[0.00007202759,0.00008337238,0.0006150546,0.0000673633,0.0000692174,0.00008495653,0.0000244418,0.9265715,0.0003082462,0.0654611,0.006616566,0.00002617236],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002315396,0.0002557281,0.9955848,0.0002066061,0.00006366924,0.00009788212,0.0005560132,0.0005886598,0.0003313318],"genre_scores_gemma":[0.05869288,0.000432534,0.9357864,0.0003145363,0.0001339575,0.0009001514,0.002311782,0.0003106999,0.001117195],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.009232275,"threshold_uncertainty_score":0.0488255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.221400396082826,"score_gpt":0.5037520325529645,"score_spread":0.2823516364701385,"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."}}