| Automatic feature selection for anomaly detection |
| Full text |
Pdf
(306 KB)
|
Source
|
Conference on Computer and Communications Security
archive
Proceedings of the 1st ACM workshop on Workshop on AISec
table of contents
Alexandria, Virginia, USA
SESSION: Malware and network security
table of contents
Pages 71-76
Year of Publication: 2008
ISBN:978-1-60558-291-7
|
|
Authors
|
|
Marius Kloft
|
TU Berlin, Berlin, Germany
|
|
Ulf Brefeld
|
TU Berlin, Berlin, Germany
|
|
Patrick Düessel
|
Fraunhofer Institute FIRST, Berlin, Germany
|
|
Christian Gehl
|
Fraunhofer Institute FIRST, Berlin, Germany
|
|
Pavel Laskov
|
Fraunhofer Institute FIRST, Berlin, Germany
|
|
| Sponsors |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 8, Downloads (12 Months): 136, Citation Count: 0
|
|
|
ABSTRACT
A frequent problem in anomaly detection is to decide among different feature sets to be used. For example, various features are known in network intrusion detection based on packet headers, content byte streams or application level protocol parsing. A method for automatic feature selection in anomaly detection is proposed which determines optimal mixture coefficients for various sets of features. The method generalizes the support vector data description (SVDD) and can be expressed as a semi-infinite linear program that can be solved with standard techniques. The case of a single feature set can be handled as a particular case of the proposed method. The experimental evaluation of the new method on unsanitized HTTP data demonstrates that detectors using automatically selected features attain competitive performance, while sparing practitioners from a priori decisions on feature sets to be used.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
 |
1
|
Francis R. Bach , Gert R. G. Lanckriet , Michael I. Jordan, Multiple kernel learning, conic duality, and the SMO algorithm, Proceedings of the twenty-first international conference on Machine learning, p.6, July 04-08, 2004, Banff, Alberta, Canada
[doi> 10.1145/1015330.1015424]
|
| |
2
|
|
| |
3
|
|
| |
4
|
|
 |
5
|
|
 |
6
|
|
| |
7
|
|
| |
8
|
H.-N. Nguyen and S.-Y. Ohn. Drfe: Dynamic recursive feature elimination for gene identification based on random forest. In Proceedings of the International Conference on Neural Information Processing, 2006.
|
 |
9
|
|
| |
10
|
K. Rieck and P. Laskov. Detecting unknown network attacks using language models. In Detection of Intrusions and Malware, and Vulnerability Assessment, Proc. of 3rd DIMVA Conference, LNCS, pages 74--90, July 2006.
|
| |
11
|
K. Rieck and P. Laskov. Language models for detection of unknown attacks in network traffic. In Journal in Computer Virology, 2(4):243--256, 2007.
|
| |
12
|
|
| |
13
|
|
| |
14
|
K. Wang, J. Parekh, and S. Stolfo. Anagram: A content anomaly detector resistant to mimicry attack. In Recent Adances in Intrusion Detection (RAID), pages 226--248, 2006.
|
| |
15
|
K. Wang and S. Stolfo. Anomalous payload-based network intrusion detection. In Recent Adances in Intrusion Detection (RAID), pages 203--222, 2004.
|
| |
16
|
|
 |
17
|
|
|