IKM-NCS: A Novel Clustering Scheme Based on Improved K-Means Algorithm

Author:

Wang Weipeng1,Tu Shanshan2,Huang Xinyi3

Affiliation:

1. eijing Electro-Mechanical Engineering Institute, 100074, Beijing, China

2. eijing Key Laboratory of Trusted Computing, Faculty of Information Technology, Beijing University of Technology, 100124, Beijing, China

3. Faculty of Information Technology, Beijing University of Technology, 100124, Beijing, China

Abstract

Aiming at the problems of distorted center selection and slow iteration convergence in traditional clustering analysis algorithm, a novel clustering scheme based on improved k-means algorithm is proposed. In this paper, based on the analysis of all user behavior sets contained in the initial sample, a weight calculation method for abnormal behaviors and an eigenvalue extraction method for abnormal behavior set are proposed and a set of abnormal behaviors is constructed for each user according to the behavior data generated by abnormal users. Then, on the basis of the traditional k-means clustering algorithm, an improved algorithm is proposed. By calculating the compactness of all data points and selecting the initial cluster center among the data points with high and low compactness, the clustering performance is enhanced. Finally, the eigenvalues of the abnormal behavior set are used as the input of the algorithm to output the clustering results of the abnormal behavior. Experimental results show that the clustering performance of this algorithm is better than the traditional clustering algorithm, and can effectively improve the clustering performance of abnormal behavior

Publisher

North Atlantic University Union (NAUN)

Subject

Applied Mathematics,Computational Mathematics,Mathematical Physics,Modeling and Simulation

Reference13 articles.

1. C. M. Emre, H. A. Kingravi, and P. A. Vela, “A Comparative Study of Efficient Initialization Methods for the K-Means Clustering Algorithm”, Expert Systems with Applications, vol.40, no.1, pp.200-210, 2012.

2. T. Grigorios, A. Likas, “The MinMax k-Means clustering algorithm”, Pattern Recognition, vol.47, no.7, pp.2505-2516, 2014.

3. J. Zhuo, Z. Chen, “Anomaly detection algorithm based on improved k-means clustering”, Computer science, vol.43, no.8, pp.258-261, 2016.

4. X. Song, Z. Gao, and L. Liu, “Research on network anomaly detection method based on data mining”, Electronic technology, vol.45, no.11, pp.30-32, 2016.

5. H. Liu, X. Hou, and Z Yang, “Research and design of intrusion detection system based on clustering and association”, Computer technology and development, vol.23, no.7, pp.133-137, 2015.

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3