{"id":"W2142996119","doi":"10.1109/icppw.2006.63","title":"PLT- Positional Lexicographic Tree: A New Structure for Mining Frequent Itemsets","year":2006,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Lexicographical order; Computer science; Correctness; Data mining; Association rule learning; Representation (politics); Set (abstract data type); Tree structure; Tree (set theory); Database; Data structure; Search engine indexing; Theoretical computer science; Information retrieval; Algorithm; Mathematics; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00005026247,0.0001024642,0.00008703858,0.00008559745,0.0001641199,0.0002154494,0.0004964849,0.00004545764,0.00003254126],"category_scores_gemma":[0.000006636782,0.00009030347,0.00005309884,0.0003632101,0.00002113187,0.0002809548,0.00007087382,0.00004569237,0.000006980833],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001475402,"about_ca_system_score_gemma":0.00007115243,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002306813,"about_ca_topic_score_gemma":0.0001073229,"domain_scores_codex":[0.999159,0.000006550509,0.0001630583,0.0003218579,0.0001507306,0.0001988509],"domain_scores_gemma":[0.9994251,0.00006236865,0.00005272157,0.0003289692,0.0000561995,0.00007465651],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001733702,0.00007335758,0.0006496405,0.000006906403,0.00001939813,0.000002201872,0.00009683162,0.0001039718,0.003675146,0.6896394,0.1830252,0.1227062],"study_design_scores_gemma":[0.003205496,0.0003788952,0.1107293,0.00008937489,0.00006225328,0.0002288648,0.00009384546,0.3145136,0.01102952,0.3058188,0.2523105,0.00153945],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01436179,0.00006550604,0.9803451,0.002953641,0.0001204602,0.0001771778,0.0001261851,0.0001854409,0.001664696],"genre_scores_gemma":[0.1497023,0.000001050645,0.8477734,0.0004461805,0.0002874575,0.00002713597,0.0002872563,0.000008992025,0.001466192],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3838207,"threshold_uncertainty_score":0.3682469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01153421255386396,"score_gpt":0.2403707526457563,"score_spread":0.2288365400918923,"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."}}