Study on oceanic big data clustering based on incremental K-means algorithm

被引:0
作者
Li Y. [1 ]
Yang Z. [1 ]
Han K. [1 ]
机构
[1] Key Laboratory for Advanced Technology to Internet of Things, College of Electronics and Information Engineering, Qinzhou University, Guangxi
关键词
Algorithm; Cluster; Cluster center; Data points; Distance model; Incremental; K-means; MATLAB; Oceanic big; Similarity;
D O I
10.1504/ijica.2020.107119
中图分类号
学科分类号
摘要
With the increase of marine industry in the Beibu Gulf, data clustering has become an important task of intelligent ocean. Partition clustering methods are suitable for marine data. However, traditional K-means algorithm is not suitable for large scale data. Focusing on the characteristics of oceanic big data, we propose a clustering method based on incremental K-means (IKM) algorithm. First, a vector model is adopted to represent data sets, and the calculation model for mean values and centres is used to initialise arbitrary numbers of data points. Second, the input data vectors are iteratively calculated in an incremental vector form. Finally, by applying incremental vector and distance model, the large-scale data are clustered according to convergence condition. Experiments show that the algorithm can increase the clustering efficiency, reduce time and space complexity, and lower the missing data rate. © 2020 Inderscience Enterprises Ltd.
引用
收藏
页码:89 / 95
页数:6
相关论文
共 9 条
[1]  
Bai S., Chen L., Adaptive K-valued particle swarm optimization algorithm, Computer Engineering and Applications, 53, 16, pp. 116-120, (2017)
[2]  
Chen Y.-Y., Zhou P., Improved K-means clustering algorithm for dynamic allocation cluster center, Computer Technology and Development, 27, 2, (2017)
[3]  
Huang W., Design of mining algorithm based on improved neural network, Modern Electronics Technique, 41, 14, pp. 143-146, (2018)
[4]  
Jain A.K., Dubes R.C., Algorithms for Clustering Data, pp. 1-334, (1988)
[5]  
Maequeen J., Some methods for classification and analysis of multivariate observations, Proc. 5th Berkeley Symp. Math. Statist., 1, pp. 281-297, (1967)
[6]  
Pan X., Chen X., Et al., Firefly partitioning clustering algorithm based on adaptive step size, Application Research of Computers, 34, 12, pp. 12-17, (2017)
[7]  
Shao L., Zhou X., Zhao C., Improved K-means clustering algorithm based on multi-dimensional grid space, Journal of Computer Applications, 38, 10, pp. 2850-2855, (2018)
[8]  
Tand D.-K.I., Wang H.-M., Hu M., Optimizing initial cluster center of improved K-means algorithm, Journal of Chinese Computer Systems, 39, 8, pp. 1819-1823, (2018)
[9]  
Tao Y., Yang F., Research and optimization of K-means clustering algorithm, Computer Technology and Development, 28, 6, pp. 90-92, (2018)