{"id":"W1996077944","doi":"10.1109/tifs.2014.2332816","title":"A Game-Theoretic Framework for Robust Optimal Intrusion Detection in Wireless Sensor Networks","year":2014,"lang":"en","type":"article","venue":"IEEE Transactions on Information Forensics and Security","topic":"Distributed Sensor Networks and Detection Algorithms","field":"Computer Science","cited_by":52,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Saskatchewan","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Intrusion detection system; Wireless sensor network; Game theory; Robust optimization; Sensitivity (control systems); Robustness (evolution); Mathematical optimization; Stability (learning theory); Complete information; Optimization problem; Wireless; Data mining; Computer network; Machine learning; Mathematical economics; Mathematics; Algorithm","routes":{"ca_aff":true,"ca_fund":true,"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.0004052221,0.0002025442,0.0002189279,0.0002327447,0.0002916591,0.0003029561,0.0001648185,0.0002578799,0.000005383208],"category_scores_gemma":[0.00001783207,0.0002003053,0.00009926468,0.0005017009,0.00007942275,0.0009066379,0.000005477039,0.0004354759,0.000007034308],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006687213,"about_ca_system_score_gemma":0.00001611683,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002074786,"about_ca_topic_score_gemma":0.00003356449,"domain_scores_codex":[0.9987147,0.00006605574,0.0004447381,0.0002461311,0.0002109225,0.0003174661],"domain_scores_gemma":[0.9990078,0.0002505645,0.0001552762,0.0002922227,0.0001659918,0.0001281314],"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.0001217566,0.00005097766,0.000003275102,0.00004238556,0.00001409482,4.931278e-7,0.0008668671,0.4317817,0.000005408573,0.05598688,0.00002410518,0.5111021],"study_design_scores_gemma":[0.0006904981,0.000254164,0.00003989952,0.00005023292,0.00001019934,0.00001824782,0.0001045131,0.9809305,0.001053609,0.01569831,0.000920768,0.0002290264],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02042188,0.000005564103,0.9776477,0.0001413155,0.001130624,0.0003736561,0.00002250656,0.0001659441,0.0000908066],"genre_scores_gemma":[0.9633076,0.00007198274,0.03614257,0.0003200138,0.0000727466,0.00005708742,0.00001399879,0.000009669114,0.00000432364],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9428857,"threshold_uncertainty_score":0.8168211,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.006799168688328103,"score_gpt":0.2080178613700099,"score_spread":0.2012186926816818,"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."}}