{"id":"W4312121787","doi":"10.48550/arxiv.2212.11364","title":"A Projected Upper Bound for Mining High Utility Patterns from Interval-Based Event Sequences","year":2022,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Pruning; Interval (graph theory); Upper and lower bounds; Constraint (computer-aided design); Event (particle physics); Computer science; Branch and bound; Data mining; Mathematical optimization; Algorithm; Mathematics; Combinatorics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0003123507,0.0003082006,0.0003405584,0.000185558,0.000363877,0.0002601161,0.002623012,0.0001485905,0.0001898543],"category_scores_gemma":[0.00004083309,0.0003525307,0.0002478438,0.0003819577,0.00008629802,0.0002885737,0.002212616,0.0003962229,0.00001024515],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002636059,"about_ca_system_score_gemma":0.0004799728,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002806397,"about_ca_topic_score_gemma":0.0001654828,"domain_scores_codex":[0.997521,0.0001475645,0.000278017,0.001564609,0.0001338131,0.0003549638],"domain_scores_gemma":[0.9975464,0.0002870587,0.0003280897,0.001576465,0.0001364985,0.0001255261],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0008748264,0.006517343,0.2414859,0.002224455,0.003274851,0.001434881,0.01417561,0.2581312,0.0006191453,0.2920194,0.01859876,0.1606436],"study_design_scores_gemma":[0.0005483499,0.00009682892,0.008801592,0.0001243141,0.00008893348,8.127789e-7,0.0002960117,0.9709378,0.0001592734,0.01498263,0.003462691,0.0005007465],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4425382,0.00001381162,0.5549192,0.0001829573,0.0003794453,0.0004265966,0.001302677,0.0001792366,0.00005792365],"genre_scores_gemma":[0.9627589,0.00001194399,0.03561949,0.0001481829,0.00007443636,0.00005040285,0.0009387827,0.00001905431,0.0003788138],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7128066,"threshold_uncertainty_score":0.9998927,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09598394824550048,"score_gpt":0.2320874090145004,"score_spread":0.1361034607689999,"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."}}