{"id":"W4387145819","doi":"10.1007/978-3-031-42430-4_30","title":"A Projected Upper Bound for Mining High Utility Patterns from Interval-Based Event Sequences","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Pruning; Interval (graph theory); Upper and lower bounds; Event (particle physics); Constraint (computer-aided design); Computer science; Branch and bound; Data mining; Mathematical optimization; Algorithm; Mathematics; Combinatorics; Physics","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":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001095248,0.0002495733,0.0002896597,0.0006956108,0.0006245818,0.001069616,0.004037803,0.000124103,0.00000804754],"category_scores_gemma":[0.00007964279,0.0002445863,0.00007174596,0.0004337333,0.0005691176,0.003813291,0.001960268,0.0002767606,0.00003401826],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001251425,"about_ca_system_score_gemma":0.0005140306,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001853868,"about_ca_topic_score_gemma":0.00006843248,"domain_scores_codex":[0.9979739,0.00003178932,0.0008009506,0.0004895817,0.0004209016,0.0002828501],"domain_scores_gemma":[0.9959934,0.0006287606,0.0004132308,0.002427378,0.0004343225,0.000102866],"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.000004617075,0.00004527928,0.0002393912,0.00006628283,0.00001806116,4.20599e-7,0.00285872,0.0001332535,0.00000456525,0.2834808,0.0008041227,0.7123445],"study_design_scores_gemma":[0.000310182,0.00005994141,0.00413002,0.000408831,0.000009285674,0.000002316874,0.00004420564,0.942945,0.00002005885,0.01275978,0.03898763,0.0003227439],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008878924,0.00006170234,0.9911016,0.001839849,0.0004150938,0.0008055971,0.0006673442,0.000236963,0.003983975],"genre_scores_gemma":[0.08278038,0.0005128325,0.9117039,0.001371816,0.00009840389,0.000573951,0.001867425,0.00002689651,0.001064428],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9428117,"threshold_uncertainty_score":0.9999674,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07527730592061883,"score_gpt":0.3262254763385196,"score_spread":0.2509481704179007,"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."}}