{"id":"W2542031809","doi":"10.1109/icdmw.2014.129","title":"DISC: Efficient Uncertain Frequent Pattern Mining with Tightened Upper Bounds","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Upper and lower bounds; Computer science; Set (abstract data type); Space (punctuation); Tree (set theory); Data mining; Branch and bound; Algorithm; Mathematical optimization; Mathematics; Combinatorics","routes":{"ca_aff":true,"ca_fund":true,"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":[],"consensus_categories":[],"category_scores_codex":[0.0002089215,0.0001289528,0.00011621,0.0000537712,0.0001843097,0.0002771968,0.0006996153,0.00002741914,0.00003484123],"category_scores_gemma":[0.000008677225,0.00008519988,0.00002920828,0.0002512134,0.00004863989,0.0001448083,0.0001750156,0.00006143977,0.00009758183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002697654,"about_ca_system_score_gemma":0.00003563193,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001724529,"about_ca_topic_score_gemma":0.0000322757,"domain_scores_codex":[0.9988732,0.00002715598,0.0001534317,0.0004247801,0.0002485564,0.0002728315],"domain_scores_gemma":[0.9989864,0.000066243,0.00005423995,0.0007359594,0.00004620866,0.0001109695],"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.000002890691,0.000269169,0.005707532,0.00001540995,0.00003807028,0.000008667902,0.001690461,0.001398777,0.0005152692,0.113284,0.005049287,0.8720205],"study_design_scores_gemma":[0.0003469688,0.0001359619,0.00644465,0.00003273306,0.000007345795,0.00001693686,0.00008311868,0.9688326,0.0008701747,0.0003057208,0.02263997,0.0002838877],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06061101,0.000009469652,0.9310395,0.001998674,0.00008243814,0.00008633677,0.000004735281,0.0001701966,0.00599766],"genre_scores_gemma":[0.72183,9.894958e-7,0.2764652,0.0007436957,0.00006521014,0.00004872293,0.00001695933,0.00001047146,0.0008187742],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9674338,"threshold_uncertainty_score":0.347435,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01043820453891834,"score_gpt":0.2287734040819601,"score_spread":0.2183351995430418,"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."}}