Application research of improved K-means algorithm in intrusion detection

DOI

10.2991/iccse-15.2015.17How to use a DOI?

Keywords

Intrusion detection, Data mining, Clustering analysis, K-means clustering, Minimum spanning tree

Abstract

An improved K-means clustering algorithm is put forward on basis of the split-merge method for the purpose of remedying defects both in determination of value in K and in selection of initial cluster centre of traditional K-means clustering. At first , the concept of independence degree of date was incorporated into the experimental date subset construction theory , using independence degree to evaluate the importance of nature.Next ,the database is merged into several classes in respect of density of date points ,the combination of the minimum spanning tree algorithm and traditional K-means clustering algorithm is conducive to the achievement of splitting .Eventually ,the KDD Cup99 database is applied to conduct simulation experiment on the application of the improved algorithm in intrusion detection .The results indicate that the improved algorithm prevails over traditional K-means algorithm in detection rate and false alarm rate.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Xiaoguo Liu
AU  - Jing Tian
PY  - 2015/07
DA  - 2015/07
TI  - Application research of improved K-means algorithm in intrusion detection
BT  - Proceedings of the 2015 International Conference on Computational Science and Engineering
PB  - Atlantis Press
SP  - 96
EP  - 100
SN  - 2352-538X
UR  - https://doi.org/10.2991/iccse-15.2015.17
DO  - 10.2991/iccse-15.2015.17
ID  - Liu2015/07
ER  -