{"id":"W2117631199","doi":"10.1007/3-540-45110-2_125","title":"A Linear Genetic Programming Approach to Intrusion Detection","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Network Security and Intrusion Detection","field":"Computer Science","cited_by":57,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"Department of Science and Technology, Ministry of Science and Technology, India","keywords":"Benchmark (surveying); Computer science; Genetic programming; Intrusion detection system; Selection (genetic algorithm); Decoding methods; Class (philosophy); Linear programming; Artificial intelligence; Genetic algorithm; Machine learning; Data mining; Algorithm","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0008388425,0.0005290785,0.0004484818,0.001104452,0.0004666155,0.0005555836,0.002076735,0.0004436552,0.00000995295],"category_scores_gemma":[0.00008972551,0.0005064986,0.0001387574,0.001454066,0.000265035,0.0004654394,0.001086791,0.0009866974,0.00006972183],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003843525,"about_ca_system_score_gemma":0.0001882361,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002507222,"about_ca_topic_score_gemma":0.00006350152,"domain_scores_codex":[0.9957892,0.00006573948,0.0005575928,0.0018316,0.001010307,0.0007455817],"domain_scores_gemma":[0.9978535,0.0001188554,0.0002348936,0.001258059,0.000250568,0.0002841035],"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.000006431796,0.00003587542,0.000002870867,0.00002502986,0.000004528314,0.00001307646,0.0004514518,0.03905956,0.0002103446,0.001990598,0.00001048048,0.9581897],"study_design_scores_gemma":[0.0002600915,0.0005844172,0.00003801336,0.0002668237,0.00001051735,0.0002721789,2.278015e-7,0.9149386,0.004594951,0.04590167,0.03213436,0.0009981052],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0002103405,0.0002495724,0.9934534,0.0002296941,0.00244659,0.0008092053,7.329103e-7,0.0002530578,0.0023474],"genre_scores_gemma":[0.04739825,0.00004685158,0.9494475,0.002032878,0.0008141737,0.00003907024,0.000001965064,0.00004426121,0.0001751223],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9571916,"threshold_uncertainty_score":0.9997386,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01486095216302931,"score_gpt":0.226617266129212,"score_spread":0.2117563139661827,"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."}}