{"id":"W3010039787","doi":"10.1109/access.2020.2977683","title":"A Machine Learning Auxiliary Approach for the Distributed Dense RFID Readers Arrangement Algorithm","year":2020,"lang":"en","type":"article","venue":"IEEE Access","topic":"RFID technology advancements","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Leverage (statistics); Collision problem; Workload; Collision; Feature (linguistics); Distributed algorithm; Collision avoidance; Distributed computing; Algorithm design; Machine learning; Artificial intelligence; Computer security","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001415072,0.0009258228,0.00152649,0.0009369744,0.0009691304,0.001237322,0.003577791,0.001450478,0.006879649],"category_scores_gemma":[0.005858258,0.0004719165,0.000842251,0.001787407,0.001120062,0.002288098,0.002146185,0.002762963,0.00218196],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250944,"about_ca_system_score_gemma":0.002351802,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002414384,"about_ca_topic_score_gemma":0.00265393,"domain_scores_codex":[0.9984652,0.0003684704,0.00007700235,0.0004783988,0.000422612,0.0001882951],"domain_scores_gemma":[0.996926,0.001378232,0.000237108,0.0005657819,0.0007542934,0.0001385975],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002017391,0.0002463119,0.0008842699,0.0001325747,0.00005024965,0.0001017183,0.00008553608,0.6438477,0.002457371,0.04584053,0.00731079,0.2988412],"study_design_scores_gemma":[0.00002056347,0.00002996747,0.00006031932,0.000003971001,0.00000438541,0.00002284785,0.000006696039,0.98814,0.0004318008,0.01009285,0.00118203,0.000004560914],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002792797,0.0001060451,0.994952,0.0001476551,0.00006272826,0.0000459287,0.00002959241,0.0004328775,0.001430531],"genre_scores_gemma":[0.2804907,0.0002767203,0.7085016,0.000480907,0.0003214288,0.0004786375,0.0005286428,0.0002691902,0.00865212],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006879649,"threshold_uncertainty_score":0.02301472,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03608801242035825,"score_gpt":0.2665501647852253,"score_spread":0.2304621523648671,"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."}}