{"id":"W27140714","doi":"10.1007/978-3-642-29038-1_21","title":"Fast Tree-Based Mining of Frequent Itemsets from Uncertain Data","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":56,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Data mining; Tree (set theory); Key (lock); Compact space; Tree structure; Data structure; Uncertain data; Mathematics","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.0008166118,0.000438715,0.0005263666,0.0004684309,0.0001798538,0.0003348246,0.008308007,0.000232751,0.00003680634],"category_scores_gemma":[0.00008096716,0.0004047143,0.00007010245,0.0006497199,0.000592807,0.0008038949,0.002725045,0.0004467239,0.00002988231],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001395061,"about_ca_system_score_gemma":0.0006435896,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002721431,"about_ca_topic_score_gemma":0.0001308287,"domain_scores_codex":[0.9962561,0.00003145572,0.0006094989,0.001648415,0.0008992886,0.0005552044],"domain_scores_gemma":[0.9943032,0.0006708686,0.000467716,0.004168055,0.000189124,0.0002010367],"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.000001212981,0.00004499658,0.0001582793,0.00001388076,0.00001190898,0.0000121291,0.0003196019,0.003182932,0.0001924486,0.002220876,0.0001412442,0.9937005],"study_design_scores_gemma":[0.0002722097,0.00006476238,0.0004879509,0.0004405143,0.00002123961,0.000008922127,4.622138e-7,0.9835011,0.001544434,0.007372248,0.005666099,0.0006200731],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001266842,0.0007127342,0.9963012,0.0005596893,0.0007846791,0.000236268,0.0004334032,0.0001010472,0.0007442429],"genre_scores_gemma":[0.03315586,0.00002269213,0.9651917,0.0005679919,0.0004434423,0.000007540159,0.0005139446,0.00003144156,0.00006538224],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9930804,"threshold_uncertainty_score":0.9998405,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05112431804604601,"score_gpt":0.2813581045961621,"score_spread":0.2302337865501161,"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."}}