Comprehensive K-Means Clustering

The k-means algorithm is a popular data clustering technique due to its speed and simplicity. However, it is susceptible to issues such as sensitivity to the chosen seeds, and inaccurate clusters due to poor initial seeds, particularly in complex datasets or datasets with non-spherical clusters. In this paper, a Comprehensive K-Means Clustering algorithm is presented, in which multiple trials of k-means are performed on a given dataset. The clustering results from each trial are transformed into a five-dimensional data point, containing the scope values of the x and y coordinates of the clusters along with the number of points within that cluster. A graph is then generated displaying the configuration of these points using Principal Component Analysis (PCA), from which we can observe and determine the common clustering patterns in the dataset. The robustness and strength of these patterns are then examined by observing the variance of the results of each trial, wherein a different subset of the data keeping a certain percentage of original data points is clustered. By aggregating information from multiple trials, we can distinguish clusters that consistently emerge across different runs from those that are more sensitive or unlikely, hence deriving more reliable conclusions about the underlying structure of complex datasets. Our experiments show that our algorithm is able to find the most common associations between different dimensions of data over multiple trials, often more accurately than other algorithms, as well as measure stability of these clusters, an ability that other k-means algorithms lack.

Research of caged dynamics of clusters center atoms in Pd_(82)Si_(18) amorphous alloy

To date,there is still a lack of a comprehensive explanation for caged dynamics which is regarded as one of the intricate dynamic behaviors in amorphous alloys.This study focuses on Pd_(82)Si_(18)as the research object to further elucidate the underlying mechanism of caged dynamics from multiple perspectives,including the cage's lifetime,atomic local environment,and atomic potential energy.The results reveal that Si atoms exhibit a pronounced cage effect due to the hindrance of Pd atoms,resulting in an anomalous peak in the non-Gaussian parameters.An in-depth investigation was conducted on the caged dynamics differences between fast and slow Si atoms.In comparison to fast Si atoms,slow Si atoms were surrounded by more Pd atoms and occupied lower potential energy states,resulting in smaller diffusion displacements for the slow Si atoms.Concurrently,slow Si atoms tend to be in the centers of smaller clusters with coordination numbers of 9 and 10.During the isothermal relaxation process,clusters with coordination numbers 9 and 10 have longer lifetimes,suggesting that the escape of slow Si atoms from their cages is more challenging.The findings mentioned above hold significant implications for understanding the caged dynamics.

Simulating the Dynamics of Bimetallic Clusters Deposited onto a Surface Using Molecular Dynamics

This paper examines the interface development between a single crystalline Ag matrix and core-shell AgnCom nanoclusters that have been deposited with energies varying between 0.25 eV and 1.5 eV per atom using computer modeling techniques. Clusters undergo deformation as a result of the slowing down;they may also become epitaxial with the substrate and maintain their core-shell structure. A detailed analysis of the effects of the cluster-surface interaction is conducted over a realistic size and energy range, and a model is created to show how clusters accumulate. It is discovered that both the silver shells and the cobalt cluster cores exhibit limited epitaxy with the substrate, and that the contact produced is only a few atomic layers thick. The effect is higher for Ag shells than for Co cores, and it is not very energy dependent.

Investigation of the J-TEXT plasma events by k-means clustering algorithm

Various types of plasma events emerge in specific parameter ranges and exhibit similar characteristics in diagnostic signals,which can be applied to identify these events.A semisupervised machine learning algorithm,the k-means clustering algorithm,is utilized to investigate and identify plasma events in the J-TEXT plasma.This method can cluster diverse plasma events with homogeneous features,and then these events can be identified if given few manually labeled examples based on physical understanding.A survey of clustered events reveals that the k-means algorithm can make plasma events(rotating tearing mode,sawtooth oscillations,and locked mode)gathering in Euclidean space composed of multi-dimensional diagnostic data,like soft x-ray emission intensity,edge toroidal rotation velocity,the Mirnov signal amplitude and so on.Based on the cluster analysis results,an approximate analytical model is proposed to rapidly identify plasma events in the J-TEXT plasma.The cluster analysis method is conducive to data markers of massive diagnostic data.

Quantitative Method of Classification and Discrimination of a Porous Carbonate Reservoir Integrating K-means Clustering and Bayesian Theory

Reservoir classification is a key link in reservoir evaluation.However,traditional manual means are inefficient,subjective,and classification standards are not uniform.Therefore,taking the Mishrif Formation of the Western Iraq as an example,a new reservoir classification and discrimination method is established by using the K-means clustering method and the Bayesian discrimination method.These methods are applied to non-cored wells to calculate the discrimination accuracy of the reservoir type,and thus the main reasons for low accuracy of reservoir discrimination are clarified.The results show that the discrimination accuracy of reservoir type based on K-means clustering and Bayesian stepwise discrimination is strongly related to the accuracy of the core data.The discrimination accuracy rate of TypeⅠ,TypeⅡ,and TypeⅤreservoirs is found to be significantly higher than that of TypeⅢand TypeⅣreservoirs using the method of combining K-means clustering and Bayesian theory based on logging data.Although the recognition accuracy of the new methodology for the TypeⅣreservoir is low,with average accuracy the new method has reached more than 82%in the entire study area,which lays a good foundation for rapid and accurate discrimination of reservoir types and the fine evaluation of a reservoir.

Plant Leaf Diseases Classification Using Improved K-Means Clustering and SVM Algorithm for Segmentation

Several pests feed on leaves,stems,bases,and the entire plant,causing plant illnesses.As a result,it is vital to identify and eliminate the disease before causing any damage to plants.Manually detecting plant disease and treating it is pretty challenging in this period.Image processing is employed to detect plant disease since it requires much effort and an extended processing period.The main goal of this study is to discover the disease that affects the plants by creating an image processing system that can recognize and classify four different forms of plant diseases,including Phytophthora infestans,Fusarium graminearum,Puccinia graminis,tomato yellow leaf curl.Therefore,this work uses the Support vector machine(SVM)classifier to detect and classify the plant disease using various steps like image acquisition,Pre-processing,Segmentation,feature extraction,and classification.The gray level co-occurrence matrix(GLCM)and the local binary pattern features(LBP)are used to identify the disease-affected portion of the plant leaf.According to experimental data,the proposed technology can correctly detect and diagnose plant sickness with a 97.2 percent accuracy.

Clustering Countries on COVID-19 Data among Different Waves Using K-Means Clustering

The COVID-19 pandemic has caused an unprecedented spike in confirmed cases in 230 countries globally. In this work, a set of data from the COVID-19 coronavirus outbreak has been subjected to two well-known unsupervised learning techniques: K-means clustering and correlation. The COVID-19 virus has infected several nations, and K-means automatically looks for undiscovered clusters of those infections. To examine the spread of COVID-19 before a vaccine becomes widely available, this work has used unsupervised approaches to identify the crucial county-level confirmed cases, death cases, recover cases, total_cases_per_million, and total_deaths_per_million aspects of county-level variables. We combined countries into significant clusters using this feature subspace to assist more in-depth disease analysis efforts. As a result, we used a clustering technique to examine various trends in COVID-19 incidence and mortality across nations. This technique took the key components of a trajectory and incorporates them into a K-means clustering process. We separated the trend lines into measures that characterize various features of a trend. The measurements were first reduced in dimension, then clustered using a K-means algorithm. This method was used to individually calculate the incidence and death rates and then compare them.

Improved k-means clustering algorithm

In allusion to the disadvantage of having to obtain the number of clusters of data sets in advance and the sensitivity to selecting initial clustering centers in the k-means algorithm, an improved k-means clustering algorithm is proposed. First, the concept of a silhouette coefficient is introduced, and the optimal clustering number Kopt of a data set with unknown class information is confirmed by calculating the silhouette coefficient of objects in clusters under different K values. Then the distribution of the data set is obtained through hierarchical clustering and the initial clustering-centers are confirmed. Finally, the clustering is completed by the traditional k-means clustering. By the theoretical analysis, it is proved that the improved k-means clustering algorithm has proper computational complexity. The experimental results of IRIS testing data set show that the algorithm can distinguish different clusters reasonably and recognize the outliers efficiently, and the entropy generated by the algorithm is lower.

UAV-assisted data collection for wireless sensor networks with dynamic working modes

Wireless Sensor Network(WSN)is a cornerstone of Internet of Things(IoT)and has rich application scenarios.In this work,we consider a heterogeneous WSN whose sensor nodes have a diversity in their Residual Energy(RE).In this work,to protect the sensor nodes with low RE,we investigate dynamic working modes for sensor nodes which are determined by their RE and an introduced energy threshold.Besides,we employ an Unmanned Aerial Vehicle(UAV)to collect the stored data from the heterogeneous WSN.We aim to jointly optimize the cluster head selection,energy threshold and sensor nodes’working mode to minimize the weighted sum of energy con-sumption from the WSN and UAV,subject to the data collection rate constraint.To this end,we propose an efficient search method to search for an optimal energy threshold,and develop a penalty-based successive convex approximation algorithm to select the cluster heads.Then we present a low-complexity iterative approach to solve the joint optimization problem and discuss the implementation procedure.Numerical results justify that our proposed approach is able to reduce the energy consumption of the sensor nodes with low RE significantly and also saves energy for the whole WSN.

电网需求侧资源动态分布式k-means聚类算法

为有效聚合电网需求侧资源,合理、高效利用电网资源,提出基于分布式k-means的电网需求侧资源动态聚类算法。通过基于置信半径的分布式k-means算法聚类采集到的电网需求侧资源数据,在模糊C均值进化神经网络中,以聚类得到的电网需求侧资源数据为输入向量,输出电网需求侧资源场景,依据场景存在概率,以电网侧资源日均峰谷差最小、DG消纳程度最高与日均负荷波动率最小为目标函数,以电网需求侧资源曲线波动率与负荷互补为约束条件,构建电网需求侧资源多场景聚类模型,经动态改变惯性因子(DCW)粒子群算法求解模型后,实现电网需求侧资源多场景聚类。试验结果表明:该方法可实现电网需求侧资源动态聚类,应用该方法聚类不同场景电网需求侧资源时的日负荷率较低,聚类效果较好,可满足实际电力需求侧资源动态聚类工作的需要。

An efficient enhanced k-means clustering algorithm

In k-means clustering, we are given a set of n data points in d-dimensional space R^d and an integer k and the problem is to determine a set of k points in R^d, called centers, so as to minimize the mean squared distance from each data point to its nearest center. In this paper, we present a simple and efficient clustering algorithm based on the k-means algorithm, which we call enhanced k-means algorithm. This algorithm is easy to implement, requiring a simple data structure to keep some information in each iteration to be used in the next iteration. Our experimental results demonstrated that our scheme can improve the computational speed of the k-means algorithm by the magnitude in the total number of distance calculations and the overall time of computation.

Hierarchical hesitant fuzzy K-means clustering algorithm

Due to the limitation and hesitation in one＇s knowledge, the membership degree of an element to a given set usually has a few different values, in which the conventional fuzzy sets are invalid. Hesitant fuzzy sets are a powerful tool to treat this case. The present paper focuses on investigating the clustering technique for hesitant fuzzy sets based on the K-means clustering algorithm which takes the results of hierarchical clustering as the initial clusters. Finally, two examples demonstrate the validity of our algorithm.

K-MEANS CLUSTERING FOR CLASSIFICATION OF THE NORTHWESTERN PACIFIC TROPICAL CYCLONE TRACKS

Based on the Joint Typhoon Warning Center(JTWC) best-track dataset between 1965 and 2009 and the characteristic parameters including tropical cyclone(TC) position,intensity,path length and direction,a method for objective classification of the Northwestern Pacific tropical cyclone tracks is established by using k-means Clustering.The TC lifespan,energy,active season and landfall probability of seven clusters of tropical cyclone tracks are comparatively analyzed.The characteristics of these parameters are quite different among different tropical cyclone track clusters.From the trend of the past two decades,the frequency of the western recurving cluster(accounting for 21.3% of the total) increased,and the lifespan elongated slightly,which differs from the other clusters.The annual variation of the Power Dissipation Index(PDI) of most clusters mainly depended on the TC intensity and frequency.However,the annual variation of the PDI in the northwestern moving then recurving cluster and the pelagic west-northwest moving cluster mainly depended on the frequency.

Classification of Northeast China Cold Vortex Activity Paths in Early Summer Based on K-means Clustering and Their Climate Impact

The classification of the Northeast China Cold Vortex(NCCV)activity paths is an important way to analyze its characteristics in detail.Based on the daily precipitation data of the northeastern China(NEC)region,and the atmospheric circulation field and temperature field data of ERA-Interim for every six hours,the NCCV processes during the early summer(June)seasons from 1979 to 2018 were objectively identified.Then,the NCCV processes were classified using a machine learning method(k-means)according to the characteristic parameters of the activity path information.The rationality of the classification results was verified from two aspects,as follows:(1)the atmospheric circulation configuration of the NCCV on various paths;and(2)its influences on the climate conditions in the NEC.The obtained results showed that the activity paths of the NCCV could be divided into four types according to such characteristics as the generation origin,movement direction,and movement velocity of the NCCV.These included the generation-eastward movement type in the east of the Mongolia Plateau(eastward movement type or type A);generation-southeast longdistance movement type in the upstream of the Lena River(southeast long-distance movement type or type B);generationeastward less-movement type near Lake Baikal(eastward less-movement type or type C);and the generation-southward less-movement type in eastern Siberia(southward less-movement type or type D).There were obvious differences observed in the atmospheric circulation configuration and the climate impact of the NCCV on the four above-mentioned types of paths,which indicated that the classification results were reasonable.

Blind source separation by weighted K-means clustering

Blind separation of sparse sources （BSSS） is discussed. The BSSS method based on the conventional K-means clustering is very fast and is also easy to implement. However, the accuracy of this method is generally not satisfactory. The contribution of the vector x（t） with different modules is theoretically proved to be unequal, and a weighted K-means clustering method is proposed on this grounds. The proposed algorithm is not only as fast as the conventional K-means clustering method, but can also achieve considerably accurate results, which is demonstrated by numerical experiments.

Optimization of constitutive parameters of foundation soils k-means clustering analysis

The goal of this study was to optimize the constitutive parameters of foundation soils using a k-means algorithm with clustering analysis. A database was collected from unconfined compression tests, Proctor tests and grain distribution tests of soils taken from three different types of foundation pits： raft foundations, partial raft foundations and strip foundations. k-means algorithm with clustering analysis was applied to determine the most appropriate foundation type given the un- confined compression strengths and other parameters of the different soils.

Geochemical and Geostatistical Studies for Estimating Gold Grade in Tarq Prospect Area by K-Means Clustering Method

Tarq geochemical 1:100,000 Sheet is located in Isfahan province which is investigated by Iran’s Geological and Explorations Organization using stream sediment analyzes. This area has stratigraphy of Precambrian to Quaternary rocks and is located in the Central Iran zone. According to the presence of signs of gold mineralization in this area, it is necessary to identify important mineral areas in this area. Therefore, finding information is necessary about the relationship and monitoring the elements of gold, arsenic, and antimony relative to each other in this area to determine the extent of geochemical halos and to estimate the grade. Therefore, a well-known and useful K-means method is used for monitoring the elements in the present study, this is a clustering method based on minimizing the total Euclidean distances of each sample from the center of the classes which are assigned to them. In this research, the clustering quality function and the utility rate of the sample have been used in the desired cluster (S(i)) to determine the optimum number of clusters. Finally, with regard to the cluster centers and the results, the equations were used to predict the amount of the gold element based on four parameters of arsenic and antimony grade, length and width of sampling points.

Application of Self-Organizing Feature Map Neural Network Based on K-means Clustering in Network Intrusion Detection

Due to the widespread use of the Internet,customer information is vulnerable to computer systems attack,which brings urgent need for the intrusion detection technology.Recently,network intrusion detection has been one of the most important technologies in network security detection.The accuracy of network intrusion detection has reached higher accuracy so far.However,these methods have very low efficiency in network intrusion detection,even the most popular SOM neural network method.In this paper,an efficient and fast network intrusion detection method was proposed.Firstly,the fundamental of the two different methods are introduced respectively.Then,the selforganizing feature map neural network based on K-means clustering(KSOM)algorithms was presented to improve the efficiency of network intrusion detection.Finally,the NSLKDD is used as network intrusion data set to demonstrate that the KSOM method can significantly reduce the number of clustering iteration than SOM method without substantially affecting the clustering results and the accuracy is much higher than Kmeans method.The Experimental results show that our method can relatively improve the accuracy of network intrusion and significantly reduce the number of clustering iteration.

Grey incidence clustering method based on multidimensional dynamic time warping distance

The traditional grey incidence degree is mainly based on the distance analysis methods, which is measured by the displacement difference between corresponding points between sequences. When some data of sequences are missing (inconsistency in the length of the sequences), the only way is to delete the longer sequences or to fill the shorter sequences. Therefore, some uncertainty is introduced. To solve this problem, by introducing three-dimensional grey incidence degree (3D-GID), a novel GID based on the multidimensional dynamic time warping distance (MDDTW distance-GID) is proposed. On the basis of it, the corresponding grey incidence clustering (MDDTW distance-GIC) method is constructed. It not only has the simpler computation process, but also can be applied to the incidence comparison between uncertain multidimensional sequences directly. The experiment shows that MDDTW distance-GIC is more accurate when dealing with the uncertain sequences. Compared with the traditional GIC method, the precision of the MDDTW distance-GIC method has increased nearly 30%.

Partition of GB-InSAR deformation map based on dynamic time warping and k-means

Ground-based interferometric synthetic aperture radar(GB-InSAR)can take deformation measurement with a high accuracy.Partition of the GB-InSAR deformation map benefits analyzing the deformation state of the monitoring scene better.Existing partition methods rely on labelled datasets or single deformation feature,and they cannot be effectively utilized in GBInSAR applications.This paper proposes an improved partition method of the GB-InSAR deformation map based on dynamic time warping(DTW)and k-means.The DTW similarities between a reference point and all the measurement points are calculated based on their time-series deformations.Then the DTW similarity and cumulative deformation are taken as two partition features.With the k-means algorithm and the score based on multi evaluation indexes,a deformation map can be partitioned into an appropriate number of classes.Experimental datasets of West Copper Mine are processed to validate the effectiveness of the proposed method,whose measurement points are divided into seven classes with a score of 0.3151.