{"id":"W2786426445","doi":"","title":"CIGA+ : an Algorithm for Computing a Concise Set of Frequently closed Item Sets","year":2006,"lang":"en","type":"article","venue":"E-ti","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Computer science; Data mining; Set (abstract data type); Association rule learning; Graph; Algorithm; Null (SQL); Dependency (UML); Task (project management); Dependency graph; Data set; Artificial intelligence; Theoretical computer science; Engineering","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.000280633,0.000119636,0.0001813228,0.00005932336,0.0001375661,0.0001045576,0.0007136301,0.00005031074,0.000006938394],"category_scores_gemma":[0.00001512629,0.0001194079,0.00006074827,0.0002624692,0.00004502656,0.0002951757,0.0001303691,0.00006825402,0.00001588391],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002198875,"about_ca_system_score_gemma":0.00005837806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001607123,"about_ca_topic_score_gemma":0.000008380232,"domain_scores_codex":[0.9988794,0.00002497904,0.0002975906,0.0003698775,0.0001759337,0.000252262],"domain_scores_gemma":[0.9990437,0.0001329445,0.0001550458,0.0004794211,0.000115766,0.00007311775],"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.000001364528,0.0001181938,0.00009597187,0.00001673224,0.00001371044,0.00000513952,0.0004665586,0.00005418991,0.001303593,0.01455304,0.008801655,0.9745699],"study_design_scores_gemma":[0.0006050775,0.0001151555,0.002654975,0.00002490939,0.000009985196,0.00001354928,0.00004681786,0.9670234,0.00317384,0.003279562,0.02284507,0.0002076646],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.04266364,0.00005812832,0.9553871,0.0002252219,0.0001415715,0.0002876219,0.0003553496,0.0001570065,0.0007244175],"genre_scores_gemma":[0.1549487,0.00000137477,0.8442423,0.0001356975,0.0002178695,0.00002818595,0.0002037184,0.00001425805,0.0002078986],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9743622,"threshold_uncertainty_score":0.4869311,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02562404693190174,"score_gpt":0.2945604521471573,"score_spread":0.2689364052152555,"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."}}