{"id":"W2114506861","doi":"10.1109/icdm.2005.38","title":"CanTree: A Tree Structure for Efficient Incremental Mining of Frequent Patterns","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":101,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Tree (set theory); Data mining; Database transaction; Tree structure; Fractal tree index; GSP Algorithm; Interval tree; Search tree; A priori and a posteriori; Segment tree; Incremental decision tree; Apriori algorithm; Association rule learning; Database; Decision tree; Decision tree learning; Algorithm; Binary tree; Mathematics; Search algorithm","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.002390404,0.0009350156,0.001570407,0.005916811,0.001226669,0.002136809,0.002811455,0.00103173,0.002397726],"category_scores_gemma":[0.01448209,0.0009605258,0.00157123,0.007328,0.0006475855,0.004081542,0.002091256,0.001522137,0.001765546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007323554,"about_ca_system_score_gemma":0.002757185,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004155255,"about_ca_topic_score_gemma":0.008506114,"domain_scores_codex":[0.9980693,0.0004891015,0.0002470167,0.0002792222,0.0007926804,0.0001226569],"domain_scores_gemma":[0.9925455,0.003297204,0.0007151631,0.001351179,0.001724201,0.0003667655],"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.0008049444,0.0003265263,0.005678713,0.001393593,0.0004280008,0.001096596,0.0008543167,0.04739581,0.01418618,0.03794434,0.07163277,0.8182582],"study_design_scores_gemma":[0.000434696,0.0005843556,0.003079293,0.0002693811,0.0003555483,0.002714154,0.0003693016,0.7341862,0.01620696,0.120647,0.1209155,0.000237723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009507622,0.001419969,0.9741866,0.0004479619,0.0001628225,0.0004596809,0.003892457,0.008597882,0.001324908],"genre_scores_gemma":[0.04853782,0.0009926354,0.938879,0.0001892396,0.0001182213,0.0005851809,0.00927007,0.0003917582,0.001036088],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005916811,"threshold_uncertainty_score":0.01264179,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01062117673232302,"score_gpt":0.2370530098751351,"score_spread":0.2264318331428121,"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."}}