{"id":"W2032469362","doi":"10.1007/s10115-006-0032-8","title":"CanTree: a canonical-order tree for incremental frequent-pattern mining","year":2006,"lang":"en","type":"article","venue":"Knowledge and Information Systems","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":140,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Data mining; Tree (set theory); GSP Algorithm; Database transaction; Tree structure; A priori and a posteriori; Association rule learning; Apriori algorithm; Database; Mathematics; Algorithm; Binary tree","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.0002289257,0.0001017177,0.0001268355,0.00009636548,0.0001920595,0.0003639731,0.0002646018,0.00004684648,0.000002124256],"category_scores_gemma":[0.00001319359,0.0000911038,0.00002537921,0.0002130593,0.00002064592,0.001855865,0.00009218301,0.00003752891,0.00005495962],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004409355,"about_ca_system_score_gemma":0.00008177441,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008626219,"about_ca_topic_score_gemma":0.0002328012,"domain_scores_codex":[0.9991714,0.00001540575,0.0003846003,0.0001368479,0.000108579,0.0001831038],"domain_scores_gemma":[0.9993578,0.00005801074,0.0001303031,0.0002377715,0.0001589832,0.00005708275],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.000004244461,0.0001015958,0.002701929,0.0002825884,0.00003966493,6.97018e-7,0.003894152,0.0000601961,0.0002606819,0.1270139,0.09229397,0.7733464],"study_design_scores_gemma":[0.0007268995,0.00005013138,0.001974117,0.00005602384,0.000007778801,0.00002173418,0.0003484063,0.4438933,0.0001436961,0.00004010799,0.5525398,0.0001980751],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01007841,0.0005016748,0.9589057,0.0002564671,0.0004609165,0.0005374212,0.0001284529,0.0001396263,0.02899131],"genre_scores_gemma":[0.9777804,0.00001669211,0.0198578,0.0001914855,0.0003567098,0.0004578465,0.0003961672,0.000009487901,0.0009334019],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.967702,"threshold_uncertainty_score":0.3715105,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01329467542214002,"score_gpt":0.2450617536862699,"score_spread":0.2317670782641299,"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."}}