{"id":"W2151953639","doi":"10.1109/tkde.2005.166","title":"Fast algorithms for frequent itemset mining using FP-trees","year":2005,"lang":"en","type":"article","venue":"IEEE Transactions on Knowledge and Data Engineering","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":552,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Computer science; Data mining; Traverse; Association rule learning; Algorithm; Tree (set theory); Data structure; Tree structure; Trie; Prefix; Binary tree; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.006331121,0.002710182,0.003150566,0.007442361,0.002156128,0.002559494,0.003521581,0.002636136,0.004388689],"category_scores_gemma":[0.02853196,0.001748009,0.002424892,0.01038756,0.000772853,0.006881258,0.001551706,0.002630675,0.005217967],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001013653,"about_ca_system_score_gemma":0.002183775,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002423296,"about_ca_topic_score_gemma":0.002118937,"domain_scores_codex":[0.9952855,0.001128476,0.0007426538,0.0007659665,0.001780671,0.000296862],"domain_scores_gemma":[0.98015,0.0130163,0.001323591,0.001565065,0.003760589,0.0001844281],"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.0004819868,0.0002638352,0.003242886,0.0008821056,0.0003762087,0.0003620489,0.0003072555,0.0569064,0.004409283,0.01765049,0.01712701,0.8979905],"study_design_scores_gemma":[0.000334072,0.0003799578,0.001654827,0.00027508,0.0002647925,0.001877789,0.0002277501,0.8398507,0.01417568,0.1123861,0.02840991,0.0001634568],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004194064,0.001256618,0.990008,0.0002194829,0.0001194287,0.000227195,0.0004799875,0.002760461,0.0007347819],"genre_scores_gemma":[0.02491221,0.0008922489,0.9714082,0.00008709006,0.0001118427,0.00055577,0.001323147,0.0001381519,0.0005714179],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007442361,"threshold_uncertainty_score":0.03348255,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05517782314487753,"score_gpt":0.3067297556925058,"score_spread":0.2515519325476283,"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."}}