{"id":"W2144736080","doi":"","title":"Maximum likelihood trajectories for continuous-time Markov chains","year":2009,"lang":"en","type":"article","venue":"","topic":"Bayesian Modeling and Causal Inference","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ottawa Hospital","funders":"","keywords":"Trajectory; Markov chain; Observability; State (computer science); Computer science; Sequence (biology); Time complexity; Mathematics; Inference; Markov process; Function (biology); Mathematical optimization; Likelihood function; Algorithm; Applied mathematics; Estimation theory; Statistics; Artificial intelligence","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.005911156,0.001442845,0.002000543,0.002438915,0.001466434,0.002959862,0.003014343,0.003012166,0.008460223],"category_scores_gemma":[0.0529478,0.001417978,0.001843537,0.002525317,0.003466702,0.008573132,0.002817176,0.004542902,0.001398844],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.004621101,"about_ca_system_score_gemma":0.003065964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006660796,"about_ca_topic_score_gemma":0.00508205,"domain_scores_codex":[0.9965758,0.00158394,0.0002046085,0.0007678466,0.0006139071,0.0002538475],"domain_scores_gemma":[0.9587693,0.03651369,0.001685803,0.001134145,0.001301582,0.0005954484],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001611481,0.00005484739,0.001342517,0.000206754,0.00004595705,0.0001627567,0.0003434397,0.5983091,0.0003748694,0.3776019,0.001674336,0.01972239],"study_design_scores_gemma":[0.00002065155,0.00001063424,0.00009936725,0.00003423704,0.000005659101,0.00001993341,0.00002610097,0.7227386,0.0002122454,0.2760976,0.0007227602,0.00001223861],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006460178,0.0003494608,0.9907359,0.0004078253,0.00001303326,0.00005933322,0.0003473784,0.0003004839,0.001326319],"genre_scores_gemma":[0.3515268,0.001298078,0.6369507,0.0002492471,0.000111819,0.0009450566,0.003117737,0.0004725339,0.005328089],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008460223,"threshold_uncertainty_score":0.03352863,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01200355956278838,"score_gpt":0.2407837295120157,"score_spread":0.2287801699492273,"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."}}