{"id":"W2009254877","doi":"10.1007/s10472-013-9372-8","title":"A fast compound algorithm for mining generators, closed itemsets, and computing links between equivalence classes","year":2013,"lang":"en","type":"article","venue":"Annals of Mathematics and Artificial Intelligence","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal; Université du Québec à Montréal","funders":"","keywords":"Schema (genetic algorithms); Computer science; Computation; Data mining; Association rule learning; Scalability; Algorithm; Theoretical computer science; Machine learning; Database","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.0004982394,0.0001668624,0.0003070215,0.00008243743,0.0002447878,0.000385118,0.0004504164,0.00009092657,0.000003797171],"category_scores_gemma":[0.0000851084,0.0001532937,0.00004780552,0.000201836,0.000165159,0.0003176595,0.0002765375,0.0001128096,0.000006443518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000003122429,"about_ca_system_score_gemma":0.0000269914,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004091586,"about_ca_topic_score_gemma":0.000002530437,"domain_scores_codex":[0.9985803,0.00001861716,0.000584206,0.0003565886,0.0001730116,0.0002873152],"domain_scores_gemma":[0.9983253,0.0007086141,0.0002664497,0.0003165888,0.000256273,0.0001268046],"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":[2.649232e-7,0.00007465586,0.00003867721,0.0000773248,0.00002038026,4.360274e-7,0.001139457,0.00001093535,0.0006867506,0.04798188,0.0002493743,0.9497198],"study_design_scores_gemma":[0.0000252913,0.0001278053,0.0001165719,0.0001464015,0.00001111183,0.000005979078,0.0008367178,0.9096373,0.02380418,0.06476445,0.0003123926,0.0002118052],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1247654,0.0002202693,0.8737239,0.0008101568,0.00004971392,0.0002978957,0.00005253163,0.00003909896,0.00004107603],"genre_scores_gemma":[0.2561936,0.00011118,0.7433957,0.0001212667,0.000119089,0.00002521283,0.0000105964,0.00001077575,0.00001261998],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9495081,"threshold_uncertainty_score":0.6251135,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1431348549864317,"score_gpt":0.3557784039373261,"score_spread":0.2126435489508944,"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."}}