{"id":"W2169474320","doi":"10.1109/ideas.2003.1214917","title":"Incremental mining of frequent patterns without candidate generation or support constraint","year":2003,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":216,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Constraint (computer-aided design); Data mining; Tree (set theory); Tree structure; Binary tree; Algorithm; Engineering; 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":[],"consensus_categories":[],"category_scores_codex":[0.0002184131,0.00007683773,0.00009743316,0.00004074194,0.00006412523,0.00006526377,0.0002471858,0.00002191404,0.0002933582],"category_scores_gemma":[0.00001486152,0.00005976217,0.00002036615,0.0001117966,0.00003033142,0.0002077112,0.00005673254,0.00003374216,0.00001210624],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002264699,"about_ca_system_score_gemma":0.0001206557,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001832108,"about_ca_topic_score_gemma":0.0001728693,"domain_scores_codex":[0.9992406,0.00002519566,0.0002243041,0.0002224665,0.0001500113,0.0001374349],"domain_scores_gemma":[0.9994816,0.00001584793,0.00008015084,0.0003219804,0.00004031074,0.00006015196],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00000790893,0.0006512692,0.08537741,0.00005876334,0.0001634639,0.00004830127,0.00413391,0.00008860336,0.09885857,0.4277788,0.01674204,0.3660909],"study_design_scores_gemma":[0.002752633,0.0008325762,0.01031378,0.00009013685,0.00005790886,0.0004433412,0.002185033,0.2765062,0.678694,0.0004263099,0.02647762,0.001220535],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2385033,0.000003341389,0.7574009,0.0001142158,0.0001001524,0.0001105055,0.00004418679,0.00004317986,0.003680219],"genre_scores_gemma":[0.7430863,0.000004087848,0.2564383,0.0001771561,0.00001718554,0.00001678863,0.00002953583,0.000003397795,0.0002272302],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5798354,"threshold_uncertainty_score":0.3212067,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0403410905032692,"score_gpt":0.284965270308043,"score_spread":0.2446241798047738,"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."}}