{"id":"W2500152818","doi":"10.1145/2851613.2851884","title":"Efficient closed high-utility itemset mining","year":2016,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Moncton","funders":"","keywords":"Computer science; Closure (psychology); Database transaction; Tree (set theory); State (computer science); Data mining; Projection (relational algebra); Algorithm; Theoretical computer science; 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.0002375442,0.00007436776,0.00007922086,0.00003558216,0.00009470117,0.00006933422,0.0006384916,0.00002610742,0.0000856272],"category_scores_gemma":[0.00003894754,0.00004459307,0.00002626607,0.0002061546,0.0000368402,0.0000950704,0.0002367807,0.00002552027,0.0003141456],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001619844,"about_ca_system_score_gemma":0.00002863888,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003794691,"about_ca_topic_score_gemma":0.000004045763,"domain_scores_codex":[0.9991451,0.00001961533,0.0001455625,0.0003426245,0.0001517324,0.0001953698],"domain_scores_gemma":[0.9989824,0.0001380749,0.000038533,0.0007184691,0.00004194202,0.00008063934],"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.000001272231,0.0001011773,0.0004099871,0.000002495818,0.000006341449,0.000002525485,0.000160886,0.00000760531,0.002212343,0.1223058,0.0212241,0.8535655],"study_design_scores_gemma":[0.001675168,0.0001402607,0.06951735,0.00008076658,0.00001166446,0.00002234349,0.00008714782,0.6743851,0.01427932,0.005060703,0.2339223,0.0008178325],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1278643,0.000008171036,0.8642339,0.002937849,0.0001506483,0.00006763511,0.00002445489,0.000235207,0.004477901],"genre_scores_gemma":[0.7714181,0.000001077678,0.2269026,0.0001661948,0.00003999489,0.00001584212,0.000002661704,0.00000337367,0.001450152],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8527476,"threshold_uncertainty_score":0.4037811,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01745010952650251,"score_gpt":0.2431930098844494,"score_spread":0.2257429003579469,"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."}}