{"id":"W54192826","doi":"10.1007/978-3-642-32584-7_17","title":"A Fast Algorithm for Frequent Itemset Mining Using Patricia* Structures","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Trie; Tree traversal; Prefix; Computer science; Tree (set theory); Interval tree; Data structure; Data mining; Algorithm; Tree structure; Theoretical computer science; Segment tree; Fractal tree index; Node (physics); Search tree; Binary tree; Mathematics; Search algorithm; Combinatorics; Programming language","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.001267498,0.001173206,0.001723396,0.003736973,0.001730458,0.001907393,0.00297621,0.00133443,0.00616701],"category_scores_gemma":[0.00635723,0.001358482,0.001757767,0.005448355,0.0004176985,0.003192982,0.002153384,0.001571391,0.005833063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005994141,"about_ca_system_score_gemma":0.002089701,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002171345,"about_ca_topic_score_gemma":0.003375092,"domain_scores_codex":[0.9988619,0.0001867747,0.00015486,0.0002815032,0.0004087915,0.0001061496],"domain_scores_gemma":[0.9974717,0.001007426,0.0001445707,0.0005932113,0.0007050416,0.00007807217],"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.0004059766,0.0002310667,0.002262805,0.0002859466,0.0001361115,0.000224368,0.0001657759,0.009404694,0.007690521,0.00778107,0.02538821,0.9460234],"study_design_scores_gemma":[0.0004067583,0.0006516188,0.002810563,0.000137997,0.000210397,0.002414153,0.000267524,0.8771155,0.02311842,0.04901193,0.04373371,0.0001213884],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01610289,0.0006830358,0.9669142,0.0003143582,0.0001428083,0.0003778775,0.001703677,0.01199438,0.001766756],"genre_scores_gemma":[0.02490564,0.0001508165,0.9696473,0.0000830206,0.0000401404,0.0003068008,0.003218792,0.0001895557,0.001457981],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.00616701,"threshold_uncertainty_score":0.02063078,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03314512769457269,"score_gpt":0.2800462179408509,"score_spread":0.2469010902462782,"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."}}