{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00006754188,0.00007716171,0.00009436961,0.00004624594,0.00006402696,0.00004652607,0.0004242394,0.00002327149,0.00001812129],"category_scores_gemma":[0.000004438771,0.00006387013,0.00003695676,0.00012638,0.00001742696,0.00006265343,0.0001076343,0.00002509069,0.000001138629],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002389706,"about_ca_system_score_gemma":0.00002905074,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001021851,"about_ca_topic_score_gemma":0.0005801606,"domain_scores_codex":[0.9992834,0.000006424645,0.0001873881,0.0002260184,0.0001399489,0.0001568236],"domain_scores_gemma":[0.999499,0.00004142385,0.00007306946,0.0003154839,0.00004049454,0.00003054008],"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.00001024674,0.0006326369,0.01278468,0.0001071078,0.00006862767,0.000006293755,0.001245378,0.00242568,0.05790389,0.3299378,0.0248483,0.5700294],"study_design_scores_gemma":[0.001142176,0.0001516774,0.03212503,0.00004519874,0.00002131089,0.00001426463,0.000275564,0.864171,0.09484439,0.001400787,0.005437534,0.0003710413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3455353,0.00001368198,0.6532123,0.0002035959,0.00006376545,0.0001503591,0.0002330348,0.00004074451,0.0005472184],"genre_scores_gemma":[0.7484725,2.616569e-7,0.2512659,0.00004645303,0.00004177186,0.00001918992,0.00005180979,0.000003850722,0.00009832741],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8617454,"threshold_uncertainty_score":0.2604548,"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."}}