Self‐Adaptive K‐Means Based on a Covering Algorithm

Abstract

The K-means algorithm is one of the ten classic algorithms in the area of data mining and has been studied by researchers in numerous fields for a long time. However, the value of the clustering number k in the K-means algorithm is not always easy to be determined, and the selection of the initial centers is vulnerable to outliers. This paper proposes an improved K-means clustering algorithm called the covering K-means algorithm (C-K-means). The C-K-means algorithm can not only acquire efficient and accurate clustering results but also self-adaptively provide a reasonable numbers of clusters based on the data features. It includes two phases: the initialization of the covering algorithm (CA) and the Lloyd iteration of the K-means. The first phase executes the CA. CA self-organizes and recognizes the number of clusters k based on the similarities in the data, and it requires neither the number of clusters to be prespecified nor the initial centers to be manually selected. Therefore, it has a “blind” feature, that is, k is not preselected. The second phase performs the Lloyd iteration based on the results of the first phase. The C-K-means algorithm combines the advantages of CA and K-means. Experiments are carried out on the Spark platform, and the results verify the good scalability of the C-K-means algorithm. This algorithm can effectively solve the problem of large-scale data clustering. Extensive experiments on real data sets show that the accuracy and efficiency of the C-K-means algorithm outperforms the existing algorithms under both sequential and parallel conditions.

Evaluation and Analysis Model of Economic Development Level for Latin American Countries

“…Now we will analyze the spatial distribution characteristics of high-quality development levels in Latin American countries, that is, the relationship between the relative position of each country and the level of development. In this paper, the horizontal position coordinates, vertical position coordinates, and comprehensive index of each country are used as the three characteristics of the cluster analysis datasets for K-Means cluster analysis [17][18][19][20][21][22][23]. At the same time, the K value needs to be selected.…”

Semantic Recognition and Location of Cracks by Fusing Cracks Segmentation and Deep Learning

“…Although the K-means clustering algorithm [17] has fast and efficient segmentation characteristics, it has high requirement for high clustering center selection and is very easy to converge to the local optimal solution, thereby missing the global optimal solution. In view of this, we used dynamic particle swarm optimization (DPSO) to improve the e specific steps of improved K-means are as follows:…”

A Penalized h-Likelihood Variable Selection Algorithm for Generalized Linear Regression Models with Random Effects

“…A trade-off between efficiency and complexity by the information measure is fully investigated and discussed in Caves and Schack [26]. Zhang et al [27] propose an improved K-means clustering algorithm, which is called the covering K-means algorithm (C-K-means).…”