Clustering technology and boundary point detection technology and its application in intrusion detection system are introduced in this paper from three aspects, which are the application of clustering analysis, boundary detection and clustering analysis in Intrusion Detection System. The data processing and the requirement of clustering algorithm for intrusion detection system are introduced in detail. Analyzed the result of the experiment environment and experiment, further validation of this project is based on the improved NPRIM algorithm applied to intrusion detection is effective and feasible.
Boundary point detection technologyThe cluster boundary point is a point that has two or more clustering characteristics between the cluster and the cluster. The study of clustering boundary points is an important branch of clustering analysis, which plays an important role in disease prevention, biology, image retrieval, virtual reality, and improving clustering accuracy. Since Chenyi Xia first proposed the boundary point detection algorithm (BORDER) in 2006, researchers have proposed some boundary detection algorithms. In order to describe these algorithms, the algorithm is divided into four categories: density based boundary detection algorithm, grid based boundary detection algorithm and angle based boundary detection algorithm.
Boundary point detection algorithm based on densityBased on the density of the boundary point detection algorithm is the use of clustering near the boundary of the uneven distribution of data objects to extract the characteristics of the clustering boundary point. On the noisy data set, the algorithm can separate the boundary point from the noise region, especially the uniform data set. BRIM is a typical boundary detection algorithm in this algorithm.In order to solve the existing problems of BORDER algorithm, BRIM is a density based boundary point detection algorithm, which can effectively detect the boundary of clustering in noisy data sets. The algorithm first according to the data object plus or minus the number of data points difference within half a neighborhood to calculating the boundary of points, and then the boundary is greater than the boundary degrees threshold marked point boundary point.