DocumentCode
1586048
Title
Using Length-weighted Once Kernel to Detect Anomalous Process
Author
Mu, Shaomin ; Tian, ShengFeng ; Yin, Chuanhuan
Author_Institution
Beijing Jiaotong Univ., Beijing
Volume
1
fYear
2007
Firstpage
692
Lastpage
696
Abstract
In this paper, we present a new string kernel, called length-weighted once kernel, and propose an efficient algorithm to compute this kernel. The algorithm is based on dynamic programming and suffix kernel. Moreover, we intend to distinguish anomalous process from normal processes using a one-class support vector machine classifier with certain kernel function. In the experiments, gap-weighted kernels, length-weighted once kernel, and RBF kernel are tested with an SVM classifier on the UNM datasets. The experimental results reveal that the length- weighted once kernel outperforms the others.
Keywords
dynamic programming; learning (artificial intelligence); support vector machines; anomalous process; dynamic programming; length-weighted once kernel; suffix kernel; Agricultural engineering; Dynamic programming; Feature extraction; Information technology; Intrusion detection; Kernel; Proteins; Sequences; Support vector machine classification; Support vector machines;
fLanguage
English
Publisher
ieee
Conference_Titel
Natural Computation, 2007. ICNC 2007. Third International Conference on
Conference_Location
Haikou
Print_ISBN
978-0-7695-2875-5
Type
conf
DOI
10.1109/ICNC.2007.802
Filename
4344280
Link To Document