Foundations of \(r\)-contiguous matching in negative selection for anomaly detection

DOI10.1007/S11047-008-9097-5zbMath1192.68610OpenAlexW2012122687MaRDI QIDQ734206

Thomas Stibor

Publication date: 19 October 2009

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-008-9097-5

zbMATH Keywords

\(k\)-CNF satisfiabilityAnomaly detectionArtificial immune systemsNegative selection

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (1)

Negative selection algorithms on strings with efficient training and linear-time classification

Cites Work

• An improved deterministic local search algorithm for 3-SAT
• How good are branching rules in DPLL?
• Estimating the Support of a High-Dimensional Distribution
• A Computing Procedure for Quantification Theory
• A machine program for theorem-proving
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Foundations of \(r\)-contiguous matching in negative selection for anomaly detection