{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003794612,0.002586787,0.001880579,0.001219886,0.000697683,0.002587309,0.003064375,0.002251571,0.002476849],"category_scores_gemma":[0.007161948,0.0008901492,0.001757605,0.001191875,0.003419081,0.00266058,0.002296866,0.002998625,0.0004001544],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002991508,"about_ca_system_score_gemma":0.002536053,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004228934,"about_ca_topic_score_gemma":0.002828188,"domain_scores_codex":[0.9971614,0.001438025,0.0001305627,0.0003793515,0.0006541012,0.0002365435],"domain_scores_gemma":[0.9970593,0.0020559,0.0003477956,0.0001085496,0.0002983942,0.0001301743],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0000211788,0.00002894409,0.00009793087,0.0000892994,0.00004191171,0.0001038925,0.00007739607,0.7516288,0.0007663965,0.2409099,0.0005549366,0.005679343],"study_design_scores_gemma":[0.0000131312,0.00004624841,0.00003570192,0.00001732616,0.00001159892,0.00003119554,0.00001953696,0.9230592,0.0001497617,0.07557666,0.00102529,0.00001441783],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002341828,0.0002283391,0.9934841,0.0002086844,0.00004249225,0.00005747239,0.00003690436,0.00003973104,0.003560442],"genre_scores_gemma":[0.6825526,0.001740208,0.3050643,0.0003428489,0.0002559539,0.001069623,0.0001674933,0.0001118362,0.008695203],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004228934,"threshold_uncertainty_score":0.02170503,"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."}}