{"id":"W2261853291","doi":"10.1109/newcas.2011.5981220","title":"Association rules learning technique for knowledge mining about scheduling algorithm performance","year":2011,"lang":"en","type":"article","venue":"","topic":"Data Mining Algorithms and Applications","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Computer science; Scheduling (production processes); Association rule learning; Fair-share scheduling; Two-level scheduling; Dynamic priority scheduling; Machine learning; Algorithm; Artificial intelligence; Engineering; Quality of service","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.0007511117,0.0001191641,0.0001274302,0.0000943621,0.0003613752,0.0001210394,0.0005855978,0.00008883257,0.00001655777],"category_scores_gemma":[0.0001021067,0.0001153995,0.00005084668,0.0002492649,0.00001467839,0.0006012524,0.000174816,0.0001390069,0.00007613797],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007032843,"about_ca_system_score_gemma":0.00005724069,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001654726,"about_ca_topic_score_gemma":0.000002046111,"domain_scores_codex":[0.9989933,0.00002412722,0.0002233071,0.0003392593,0.000117034,0.0003029283],"domain_scores_gemma":[0.9991819,0.0001527877,0.0001487134,0.0002798988,0.0001744082,0.0000623341],"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.000001120762,0.00008440929,0.001527011,0.00002324699,0.0000270357,3.144187e-7,0.002067629,0.00001563659,0.0006997404,0.01102243,0.0007285879,0.9838029],"study_design_scores_gemma":[0.0002164519,0.0001111728,0.002827125,0.00005979869,0.00001267001,0.000005476308,0.0001607305,0.9576726,0.01813482,0.0005638729,0.01995226,0.0002830029],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003920889,0.0000612089,0.9853263,0.00006101426,0.0001284637,0.0002559934,0.000006079984,0.0003451928,0.009894877],"genre_scores_gemma":[0.01870376,0.00002908376,0.9775316,0.00003555827,0.0001010298,0.0003799564,0.00001831715,0.00001336741,0.003187308],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9835199,"threshold_uncertainty_score":0.4705856,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03253282073797621,"score_gpt":0.2663442445716692,"score_spread":0.233811423833693,"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."}}