|
|
An algorithm of intrusion detection based on kernel mapping |
Information Engineering College, Yangzhou University, Yangzhou, Jiangsu 225009, China)
|
|
|
Abstract An algorithm of finding distance-based outlier (Cell-Based) was studied. Its disadvantages were pointed out. An algorithm of intrusion detection based on kernel mapping was proposed, which could detect intrusion by finding outliers. The data point was mapped from the original space to a high-dimensional feature kernel space by kernel function, and the distance between the data points was redefined. After initial clustering processing, the number of clusters and the original cluster centers were obtained. Through iterative processing for modified objective function, reclustering of data points was realized. Those points which were out of the cluster centers' radius were the outliers. Experiments showed that the data points are more separable in this algorithm. The algorithm can overcome the faults of traditional Cell-Based algorithm, which need to be recomputed from the scratch for every change of the parameters. It also has higher detection rate at higher convergence speed.
|
|
|
|
|
|
|
|