{"id":"W2142807487","doi":"10.1109/dexa.2003.1232075","title":"Parallel association rule mining with minimum inter-processor communication","year":2004,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":11,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Association rule learning; Apriori algorithm; Scalability; Data mining; Node (physics); Parallel algorithm; Distributed computing; Parallel computing; 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.0002401505,0.00008779341,0.00009207652,0.00004598206,0.0001716712,0.0002233572,0.0006563236,0.00004304977,0.000009112709],"category_scores_gemma":[0.00003132904,0.00007240437,0.00001977265,0.0003143432,0.0000201983,0.0006233038,0.0001724058,0.00008553734,0.0000902399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001061044,"about_ca_system_score_gemma":0.00006771466,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009220457,"about_ca_topic_score_gemma":0.00007319827,"domain_scores_codex":[0.9992147,0.0000177125,0.0001596865,0.0002381204,0.0001838714,0.0001859118],"domain_scores_gemma":[0.9990307,0.00007062113,0.0001335123,0.0006038248,0.0001082399,0.00005311599],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003367193,0.001447132,0.01144217,0.00006722166,0.0002899408,0.00001674977,0.01875431,0.002752972,0.001307679,0.5491295,0.02868493,0.3860737],"study_design_scores_gemma":[0.01940854,0.00193983,0.07843525,0.0012883,0.0002326773,0.0003014213,0.008523947,0.566717,0.02029529,0.1276134,0.1698208,0.005423523],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02669186,0.00003406836,0.9568461,0.007535289,0.00003192045,0.0001088944,0.000004002286,0.0002465613,0.00850126],"genre_scores_gemma":[0.2564508,0.00001345388,0.741697,0.0004215588,0.00001979208,0.00006196508,0.00002714964,0.000006919269,0.001301379],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.563964,"threshold_uncertainty_score":0.2952565,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01434558581382981,"score_gpt":0.2478035063503976,"score_spread":0.2334579205365677,"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."}}