{"id":"W1518718261","doi":"","title":"Efficiently mining frequent itemsets from very large databases","year":2004,"lang":"en","type":"dissertation","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Data mining; Computer science; Association rule learning; Scalability; Tree (set theory); Trie; Data cube; Data structure; Tree structure; Traverse; Algorithm; Database; Mathematics; Binary tree","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.0001422866,0.0002876681,0.0002678427,0.0001472168,0.0002504349,0.0003521592,0.001391886,0.0001192251,0.0001542275],"category_scores_gemma":[0.00005631003,0.0002751206,0.00007894063,0.0004366426,0.00001349695,0.0004521038,0.0002122696,0.0002062423,0.0003896756],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007505464,"about_ca_system_score_gemma":0.0003019973,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001192267,"about_ca_topic_score_gemma":0.0005631158,"domain_scores_codex":[0.9979832,0.00002049896,0.0003571217,0.0008708451,0.000410769,0.0003576291],"domain_scores_gemma":[0.9981974,0.0001251434,0.0002032053,0.001241716,0.0001072506,0.0001253248],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0000228714,0.003001516,0.0009136738,0.0003568363,0.0005760341,0.0002949689,0.01361729,0.0002666913,0.003674165,0.3952328,0.2180665,0.3639767],"study_design_scores_gemma":[0.005297448,0.0003235639,0.04786143,0.004361071,0.0005073884,0.00004518291,0.008886014,0.111973,0.04183277,0.004465621,0.7669426,0.007503964],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1365468,0.001633439,0.8278234,0.0003497444,0.003872914,0.0006471052,0.004265501,0.001160498,0.0237006],"genre_scores_gemma":[0.05447515,0.0001927087,0.816192,0.0009516234,0.0007047554,0.0002283087,0.1095835,0.0001160291,0.01755593],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.548876,"threshold_uncertainty_score":0.9999701,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02138563043240531,"score_gpt":0.288638789436547,"score_spread":0.2672531590041417,"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."}}