{"id":"W2952549134","doi":"10.48550/arxiv.1409.1842","title":"On Optimal Multiple Changepoint Algorithms for Large Data","year":2014,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Time Series Analysis and Forecasting","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University and Génome Québec Innovation Centre","funders":"Engineering and Physical Sciences Research Council","keywords":"Pruning; Quadratic growth; Dynamic programming; Computer science; Algorithm; Segmentation; Market segmentation; Minimum description length; Binary number; Series (stratigraphy); Mathematical optimization; Mathematics; 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.007755206,0.002516461,0.003336848,0.004356697,0.001286797,0.002522894,0.003882164,0.003376194,0.004518883],"category_scores_gemma":[0.03334089,0.001986215,0.0023428,0.005096326,0.002961097,0.00503102,0.003383984,0.005824431,0.001723468],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002135449,"about_ca_system_score_gemma":0.002302467,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00910583,"about_ca_topic_score_gemma":0.006577301,"domain_scores_codex":[0.9970698,0.001044861,0.0002432762,0.0007947301,0.0006762928,0.0001709554],"domain_scores_gemma":[0.975399,0.02115134,0.0009981156,0.001052656,0.00108916,0.0003096803],"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.00022583,0.0001236375,0.001701085,0.0002731276,0.0001587847,0.0001385953,0.0002087106,0.7481523,0.001886815,0.04964984,0.003212256,0.194269],"study_design_scores_gemma":[0.0000216004,0.00002814729,0.0001849872,0.0000227838,0.00001076352,0.00002583832,0.00001401385,0.9597796,0.0004434827,0.03848623,0.0009708079,0.00001179405],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00337217,0.0007633368,0.994263,0.000307175,0.00004367688,0.00006006534,0.00006510779,0.0006155593,0.0005099794],"genre_scores_gemma":[0.07847198,0.00100988,0.9153335,0.0003480415,0.0002514531,0.0004866257,0.0007273873,0.0005916513,0.002779454],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00910583,"threshold_uncertainty_score":0.04101396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1540997626463188,"score_gpt":0.2183145493307442,"score_spread":0.0642147866844254,"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."}}