{"id":"W1560603637","doi":"10.1007/978-3-540-45228-7_37","title":"Non-recursive Generation of Frequent K-itemsets from Frequent Pattern Tree Representations","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":32,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Association rule learning; Data mining; Tree (set theory); Tree structure; Dependency (UML); Process (computing); Data structure; Theoretical computer science; Artificial intelligence; 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"],"consensus_categories":[],"category_scores_codex":[0.0003723218,0.0004077025,0.0004572056,0.0004873015,0.000228401,0.0003582861,0.002492363,0.000228594,0.0000330328],"category_scores_gemma":[0.00006036615,0.0003971816,0.0001174503,0.0005965887,0.0004133709,0.0005609849,0.0005961081,0.0004419635,0.00003661628],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002215586,"about_ca_system_score_gemma":0.0003419622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005239549,"about_ca_topic_score_gemma":0.0002748492,"domain_scores_codex":[0.9965373,0.00003215369,0.0006889151,0.001513004,0.0008296933,0.0003989661],"domain_scores_gemma":[0.9967769,0.000258542,0.0005046179,0.001919046,0.000385651,0.0001551929],"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":[6.726866e-7,0.00008210037,0.0002509084,0.00001474499,0.0000319362,0.00003030576,0.001368795,0.007741455,0.002148246,0.007555238,0.0005967847,0.9801788],"study_design_scores_gemma":[0.0005897067,0.0002007056,0.001902993,0.0004927334,0.00004357073,0.0000395676,0.00000139585,0.8618684,0.02702926,0.1045771,0.00206073,0.001193787],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0005449638,0.0002369427,0.9952088,0.000991953,0.001282563,0.0004301242,0.0001456791,0.00005723186,0.001101756],"genre_scores_gemma":[0.06623097,0.0001016325,0.93072,0.001634027,0.0006712919,0.00005339764,0.0003394594,0.00004758711,0.0002016391],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.978985,"threshold_uncertainty_score":0.999848,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0323483048558167,"score_gpt":0.2726592003513841,"score_spread":0.2403108954955674,"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."}}