{"id":"W2482088207","doi":"10.1007/978-3-319-40581-0_31","title":"Computing Theoretically-Sound Upper Bounds to Expected Support for Frequent Pattern Mining Problems over Uncertain Big Data","year":2016,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Data mining; Uncertain data; Probabilistic logic; Database transaction; Big data; Upper and lower bounds; Tree (set theory); Transaction data; Artificial intelligence; Mathematics; Database","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","scholarly_communication","open_science"],"consensus_categories":[],"category_scores_codex":[0.001876145,0.0003218265,0.0003374304,0.0008123234,0.0008029698,0.001418854,0.008325228,0.0001325006,0.00001223581],"category_scores_gemma":[0.0001159814,0.0002829186,0.00004977835,0.0004846184,0.0007835,0.004230019,0.007615951,0.0002604803,0.00005054722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001809797,"about_ca_system_score_gemma":0.0004322384,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001665755,"about_ca_topic_score_gemma":0.00001857332,"domain_scores_codex":[0.9972568,0.00002553543,0.0009953988,0.0007262147,0.0005392802,0.0004568204],"domain_scores_gemma":[0.9931533,0.0006076408,0.0004103681,0.005124376,0.0004863589,0.000217918],"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":[9.849284e-7,0.00001651456,0.00004749139,0.00002006108,0.000008109185,1.424368e-7,0.00187261,0.00002889008,0.000003180375,0.3382821,0.0008642548,0.6588557],"study_design_scores_gemma":[0.0004911913,0.0001203228,0.0007233899,0.0004926239,0.00001200207,0.00002124603,0.00004073614,0.6530701,0.00000468077,0.01790167,0.3264979,0.0006240948],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00004225658,0.00006725871,0.9598421,0.001907895,0.0003891867,0.000831595,0.0003601401,0.0001215788,0.03643803],"genre_scores_gemma":[0.03814169,0.0004218443,0.9536676,0.004163544,0.0003121413,0.0002250792,0.001258541,0.0000428431,0.001766717],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6582316,"threshold_uncertainty_score":0.9999623,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.09379594328863143,"score_gpt":0.3328022195833624,"score_spread":0.2390062762947309,"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."}}