{"id":"W2128723273","doi":"10.1145/775047.775081","title":"Mining frequent item sets by opportunistic projection","year":2002,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":189,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Computer science; Scalability; Set (abstract data type); Tree (set theory); Data mining; Database transaction; Projection (relational algebra); Algorithm; Database; 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":[],"consensus_categories":[],"category_scores_codex":[0.00008162038,0.00007026163,0.00005993569,0.00003759991,0.0001212965,0.0001498685,0.0003610117,0.00002582681,0.0001189594],"category_scores_gemma":[0.00001794379,0.00006278575,0.00001834486,0.0002198614,0.00001551856,0.0002899553,0.00008189142,0.00004565846,0.0001609335],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002218694,"about_ca_system_score_gemma":0.00001008929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004240788,"about_ca_topic_score_gemma":0.000002533151,"domain_scores_codex":[0.999314,0.00001146327,0.000128485,0.0002648373,0.0001295002,0.0001517446],"domain_scores_gemma":[0.9994599,0.00003956295,0.00004216734,0.0003583379,0.00002593212,0.00007405951],"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":[1.388654e-7,0.0001010542,0.00008753959,0.000004197835,0.000006949006,0.000004572882,0.0003232119,0.000001007353,0.0007671422,0.02153234,0.4009188,0.5762531],"study_design_scores_gemma":[0.0001020615,0.00003564468,0.0001224872,0.000007523898,0.000003227634,0.0000272774,0.00005239628,0.8564972,0.0003565506,0.0001900652,0.1424623,0.0001432797],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003660491,0.00005733387,0.9525583,0.002355238,0.0001769478,0.0001454426,0.00002136609,0.0004038716,0.04062096],"genre_scores_gemma":[0.2366847,0.00006419679,0.7307353,0.001412904,0.0001032426,0.0001583909,0.00009458763,0.00002019015,0.03072648],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8564962,"threshold_uncertainty_score":0.2560329,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05014063780212529,"score_gpt":0.2591399793286207,"score_spread":0.2089993415264954,"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."}}