{"id":"W1964492476","doi":"10.1109/icdm.2014.146","title":"Fast Algorithms for Frequent Itemset Mining from Uncertain Data","year":2014,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":64,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Data mining; Computer science; Tree (set theory); Uncertain data; Set (abstract data type); Tree structure; Data set; Data structure; Algorithm; Artificial intelligence; Mathematics; Binary tree","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.0004118796,0.0001218148,0.0001419489,0.00004012251,0.0001612842,0.0002907565,0.002591619,0.00004298976,0.00002445643],"category_scores_gemma":[0.00008766601,0.0001053433,0.00002836611,0.0001754562,0.0000281001,0.0005523749,0.0007262179,0.00005382064,0.00006956821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001579729,"about_ca_system_score_gemma":0.00003971127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000549898,"about_ca_topic_score_gemma":0.00005977038,"domain_scores_codex":[0.9986473,0.00002403602,0.000218088,0.0006877549,0.0001700974,0.0002527756],"domain_scores_gemma":[0.9973745,0.0003562444,0.00007286124,0.002039141,0.00005152416,0.0001057697],"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":[7.243144e-7,0.0000446474,0.00006854263,0.000003599762,0.00001795801,5.566379e-7,0.0001992969,0.0000324932,0.0001878044,0.03035931,0.06756473,0.9015204],"study_design_scores_gemma":[0.0001986057,0.0000279889,0.0001533971,0.000009011947,0.000005518926,0.000001395323,0.00005483256,0.7820416,0.0001837092,0.00250585,0.2146824,0.0001356771],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.000433537,0.0000300085,0.9946169,0.001911296,0.0002433606,0.0001612081,0.0008313909,0.0001890434,0.001583308],"genre_scores_gemma":[0.004550452,0.000004010541,0.9922361,0.0007216547,0.0003147426,0.00006740109,0.001502601,0.00001092543,0.0005921206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9013847,"threshold_uncertainty_score":0.4815915,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0931108935228487,"score_gpt":0.32410135173308,"score_spread":0.2309904582102313,"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."}}