{"id":"W15173781","doi":"10.1007/978-3-642-32600-4_34","title":"Mining Frequent Itemsets Using Node-Sets of a Prefix-Tree","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Trie; Data mining; Prefix; Node (physics); Set (abstract data type); Tree (set theory); Construct (python library); Database; Tree structure; Data structure; Theoretical computer science; Algorithm; 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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007352812,0.0004355335,0.000520008,0.0006209339,0.0002175759,0.000287427,0.003351198,0.0002497269,0.0000157031],"category_scores_gemma":[0.00006754598,0.0004102422,0.00010619,0.0007149594,0.0005276582,0.0007410864,0.001689999,0.0004410814,0.00002027074],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000204248,"about_ca_system_score_gemma":0.0004534037,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000591131,"about_ca_topic_score_gemma":0.00002098092,"domain_scores_codex":[0.9967175,0.00002329291,0.0006167475,0.001152323,0.0008501493,0.0006400035],"domain_scores_gemma":[0.9969814,0.0003129822,0.0004921058,0.001758575,0.000259551,0.0001954306],"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":[9.934852e-7,0.00004894739,0.0002286193,0.00004628527,0.00001459908,0.00001403215,0.0009555106,0.004819452,0.0007927698,0.007269497,0.00002899576,0.9857803],"study_design_scores_gemma":[0.0002704913,0.0000931043,0.0005267026,0.0009217883,0.00002785117,0.0001458791,5.280535e-7,0.9740217,0.004071184,0.01673994,0.002263462,0.0009173446],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0008455006,0.0007004552,0.9957013,0.0002004293,0.0008546669,0.0002631136,0.00002867278,0.00009492877,0.001310992],"genre_scores_gemma":[0.06377203,0.00002729733,0.9355007,0.000315951,0.0002654423,0.000007093086,0.00001441966,0.00003312905,0.00006395834],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.984863,"threshold_uncertainty_score":0.999835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03921261607120276,"score_gpt":0.278510211730896,"score_spread":0.2392975956596932,"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."}}