Traditional K-means Algorithm Research Articles

Research on Gas Multi-indicator Warning Method of Coal Mine Working Face Based on MOA-Transformer.

The gas emission from the coal mine working face is influenced by multiple factors, resulting in the real-time value, fluctuation, and trend changes of gas concentration being relatively independent and interrelated. This paper establishes a gas multi-indicator warning method that can comprehensively warn the status of real-time value, fluctuation, and trend changes of gas concentration from the working face. This paper proposes six basic indicators and includes two main research contents: intelligent threshold partition and gas multi-indicator warning. First, this paper proposes an intelligent threshold partition algorithm based on GF-KMeans (genetic fixed-centered K-means), which combines a genetic algorithm (GA) and an FC-KMeans (fixed-centered K-means) algorithm to dynamically partition the threshold range corresponding to the gas warning level. The GA solves the local optimal problem in the traditional K-Means algorithm, enhancing its stability and predictability. The FC-KMeans algorithm achieves a more precise control in the initial clustering center selection. Second, this paper researches a gas multi-indicator warning method based on a multihead optimal attention (MOA)-Transformer. By using the multihead optimization attention mechanism to represent classification features and utilizing Transformer's encoder structure to classify gas warning. The experimental result shows that the accuracy of the MOA-Transformer method is 86.17%, which is 3.45% higher than that of the Transformer method. The precision of the MOA-Transformer method is 88.78%, which is 3.75% higher than that of the Transformer method. The recall of the MOA-Transformer method is 85.23%, which is 4.70% higher than that of the Transformer method. The macro-F1 of the MOA-Transformer method is 86.96%, which is 4.39% higher than that of the Transformer method. The results fully demonstrate the superiority of the MOA-Transformer method in gas warning tasks.

E-commerce recommender system based on improved K-means commodity information management model

Since the start of the 21st century, there has been a rapid development of internet technology, causing electronic computers and smartphones to become increasingly popular. The e-commerce industry also experiences quick development. However, the recommendation technology of e-commerce progresses slowly, hindering it from keeping up with the changing times. To enhance the efficiency and accuracy of e-commerce recommender systems, this research introduces an e-commerce recommender system that utilizes an enhanced K-means clustering algorithm to manage commodity information. This method combines the K-means algorithm with a genetic algorithm by encoding the genetic algorithm, setting the initial population, defining the fitness function, and configuring other parameters. The results of the test indicated that the K-mean clustering algorithm and fuzzy C-mean algorithm had a recommendation accuracy of 87.9 % and 84.8 % respectively under the test dataset. The highest recommendation accuracy was observed from the improved K-mean clustering algorithm, which was 91.1 %. The convergence rate of the improved K-mean clustering algorithm was faster by 44 % compared to the traditional K-mean clustering algorithm and 73 % quicker than the fuzzy C-mean algorithm. The study's findings demonstrate that the refined K-means clustering algorithm greatly enhances the recommendation proficiency and precision of the e-commerce recommendation system, in comparison to other comparable algorithms. This research can potentially advance the e-commerce industry and stimulate its growth.

Functional Data Clustering Method Based on Shape Information and Functional Mahalanobis Distance

Function-type data can provide insights into the internal structure of the data and facilitate the extraction of data features from the perspective of interactive derivative functions. The paper proposes a nonparametric clustering method for function-based data that incorporates first-order and second-order derivative function information into the Marginal distance for clustering function-based data. The method is based on the traditional K-means algorithm and is designed to cluster function-based data that contains rich shape information. The paper evaluated the performance of the algorithm of the text by comparing its purity and adjusted Rand coefficients against six other clustering algorithms on three different datasets. The results show that the algorithm of the text outperforms the other algorithms, demonstrating its outstanding performance, wide applicability, and practical significance in solving real-world problems.

Analysis and Application of Big Data Feature Extraction Based on Improved k-means Algorithm

This paper addresses the challenges modelled by collecting and storing large volumes of big data, focusing on mitigating data errors. The primary goal is to propose and evaluate an enhanced K-means algorithm for big data applications. This research also aims to design an extensive energy data system to demonstrate the improved algorithm's practical utility in monitoring power equipment. The research begins with an in-depth analysis of the traditional K-means algorithm, culminating in the proposal of an improved version. Subsequently, the study outlines developing a comprehensive, extensive energy data system, encompassing architectural aspects such as data storage, mechanical layers, and data access structures. The research also involves the development of a power big data analysis platform, incorporating the improved algorithm for clustering and analyzing power equipment monitoring data. Experimental results reveal that the proposed improved K-means algorithm outperforms the traditional version, with significantly improved accuracy and reduced classification errors, achieving an error rate of less than one. The improved K-means algorithm showcased remarkable enhancements, achieving a meagre misclassification rate of just 0.08% while substantially boosting accuracy levels, consistently exceeding 95% across all datasets. Moreover, the power big data system developed in this study to meet practical requirements while enhancing storage and processing efficiency effectively.

Research on the classification and application of precision marketing based on big data e-commerce platforms

Abstract This paper proposes and improves the traditional K-means algorithm, utilizes the HC-Kmeans algorithm to deeply analyze the marketing status quo of the M e-commerce platform, and constructs the overall framework of precision marketing based on big data technology. The RFM model is used to measure customer value and segment customer behavior. Formulate marketing strategies that correspond to the consumption habits and preferences of different categories of users. The data from 40 consecutive days of observation is used to verify the precision marketing effect of the A/B testing method, and the final results show a good improvement in the click rate, order rate, payment rate, and order amount. During the Double Twelve Shopping Festival, compared with the traditional mode, the payment amount of M Company’s product recommendation increased by 64,604 yuan, and the order increased by 301 units, so the implementation of the precision marketing strategy was effective.

Study on Single-Tree Segmentation of Chinese Fir Plantations Using Coupled Local Maximum and Height-Weighted Improved K-Means Algorithm

Chinese fir (Cunninghamia lanceolata) is a major timber species in China, and obtaining and monitoring the parameters of Chinese fir plantations is of great practical significance. With the help of the K-means algorithm and UAV-LiDAR data, the efficiency of forestry surveys can be greatly improved. Considering that the traditional K-means algorithm is susceptible to the influence of initial cluster centers and outliers during the process of individual tree segmentation, it may result in incorrect segmentation. Therefore, this study proposes an improved K-means algorithm that uses the methods of local maxima and height weighting to optimize and improve the algorithm. The research results are as follows: (1) Compared to the traditional K-means algorithm, the producer accuracy and user accuracy of this research algorithm have imsproved by 10.72% and 11.46%, respectively, with significant differences (p < 0.05). (2) The research algorithm proposed in this study can adapt to Chinese fir plantations of different age groups, with average producer accuracy and user accuracy reaching 78.48% and 83.72%, respectively. In summary, this algorithm can be effectively applied to the forest parameter estimation of Chinese fir plantations and is of great significance for sustainable forest management.

Study of the Load Forecasting based on AKDC and LSTM algorithms

As one of the traditional research subjects of power system, load forecasting has always been a hot research direction of related experts and scholars. This paper uses an extended algorithm combining the advantages of adaptive K-means algorithm and distributed clustering algorithm, improves the traditional K-means algorithm, and uses LSTM algorithm to build a load prediction model. LSTMS can learn the advantages of long distance time series dependence to recognize load patterns from the horizontal (time dimension). The simulation results show that the LSTM algorithm based on Adam optimizer improves the accuracy of load prediction, and the proposed algorithm is verified.

A new Chinese text clustering algorithm based on WRD and improved K-means

Text clustering has been widely used in data mining, document management, search engines, and other fields. The K-means algorithm is a representative algorithm of text clustering. However, traditional K-means algorithm often uses Euclidean distance or cosine distance to measure the similarity between texts, which is not effective in face of high-dimensional data and cannot retain enough semantic information. In response to the above problems, we combine word rotator’s distance with the K-means algorithm, and propose the WRDK-means algorithm, which use word rotator’s distance to calculate the similarity between texts and preserve more text features. Furthermore, we define a new cluster center initialization method that improves cluster instability during random initial cluster center selection. And, to solve the problem of inconsistent length between texts, we propose a new iterative approximation method of cluster centers. We selected three suitable datasets and five evaluation indicators to verify the feasibility of the proposed algorithm. Among them, the RI value of our algorithm exceeds 90%. And for Marco_F1, our scheme was about 37.77%, 23.2%, 13.06% and 20.12% better than other four methods, respectively.

K-Means Binary Search Centroid with Dynamic Cluster for Java Island Health Clustering

This study is focused on determining the health status of each district/city in Java using the K-means Binary Search Centroid and Dynamic Kmeans algorithms. The research data uses data on the health profile of Java Island in 2020. Comparative algorithms were tested using the Davies Bound Index and Calinski-Harabasz Index methods on the traditional k-means algorithm and dynamic binary search centroid k-means. Based on the test, 5 clusters were found in the distribution area, including 11 regions with very high health quality cluster 1, 24 regions with high health quality, 28 regions with moderate health quality, and 28 clusters 4 with low health quality, 45 regions, and cluster 5 with poor health quality is 11 regions, with the best validation value of DBI 1.8175 and CHI 67.7868. Overall optimization of the dynamic k-means algorithm based on binary search centroid results in a better average cluster quality and a smaller number of iterations than the traditional k-means algorithm. The test results can be used as one of the best methods in evaluating the level of health in the Java Island area and a reference for decision-making in determining policies for related agencies.

K-Means Binary Search Centroid With Dynamic Cluster for Java Island Health Clustering

This study is focused on determining the health status of each district/city in Java using the K-means Binary Search Centroid and Dynamic Kmeans algorithms. The research data uses data on the health profile of Java Island in 2020. Comparative algorithms were tested using the Davies Bound Index and Calinski-Harabasz Index methods on the traditional k-means algorithm and dynamic binary search centroid k-means. Based on the test, 5 clusters were found in the distribution area, including 11 regions with very high health quality cluster 1, 24 regions with high health quality, 28 regions with moderate health quality, and 28 clusters 4 with low health quality, 45 regions, and cluster 5 with deficient health quality is 11 regions, with the best validation value of DBI 1.8175 and CHI 67.7868. Overall optimization of the dynamic k-means algorithm based on binary search centroid results in a better average cluster quality and a smaller number of iterations than the traditional k-means algorithm. The test results can be used as one of the best methods in evaluating the level of health in the Java Island area and a reference for decision-making in determining policies for related agencies

Research on Customer Relationship Segmentation of Apparel Retail Industry through Data Mining

Objectives: This paper aims to segment customers in the apparel retail industry using data mining techniques. Methods: First, a customer segmentation model was constructed, and then the K-means algorithm was used to classify customers based on indicators from the model. The classification effectiveness was enhanced by introducing indicator feature weights. A case study was also conducted. Findings: When the value of K was 4, the K-means algorithm achieved the best classification performance. The improved K-means algorithm outperformed the traditional K-means algorithm in terms of classification effectiveness. The improved K-means algorithm categorized customers into premium customers, important customers, regular customers, and churned customers. Different marketing suggestions were proposed to manufacturers. Novelty: The novelty of this article lies in the introduction of feature weights for indicators, which allows for a distinction between their importance and improves classification effectiveness. Doi: 10.28991/HIJ-2023-04-02-05 Full Text: PDF

Intelligent recommendation method of an exercise program based on physical health data of college students

ABSTRACT The development of society is greatly influenced by the physical strength of its individuals. As heirs of social construction, college students play a crucial role in national progress, and their physical health is an essential component of their well-being. However, the increasing competition for talent in today’s rapidly advancing world has led to significant pressure on college students in various aspects of their lives. Despite the importance of physical exercise, students often lack the time and knowledge to engage in appropriate exercise programs that suit their individual needs. To address this issue, this paper proposes an improved K-means algorithm for the classification of college students’ physical health data. The traditional K-means algorithm is known to be sensitive to noisy data, and thus, we introduce a variance-like weighting mechanism to improve its clustering accuracy. Our experimental results demonstrate that this algorithm can quickly and accurately cluster physical health data to provide a classification of each student’s physical fitness. By using the physical classification of each student, we can recommend more suitable exercise programs to prioritize physical health management. This study highlights the significance of physical health in college students and encourages education departments to improve the efficiency of physical health management.

Canopy-MMD Text Clustering Algorithm Based on Simulated Annealing and Canopy Optimization

<p>Aiming at the problems that traditional K-means text clustering cannot automatically determine the number of clusters and is sensitive to initial cluster centers, this paper proposes a Canopy-MMD text clustering algorithm based on simulated annealing and silhouette coefficient optimization. The algorithm uses the simulated annealing algorithm combined with the silhouette coefficient to optimize the Canopy algorithm to find the optimal number of clusters, and uses the optimal number of clusters to determine the scale coefficient in the MMD algorithm, and finally achieves a better text clustering effect. The Sohu News dataset of Sogou Lab is experimentally analyzed and compared with the clustering results obtained by traditional K-means and algorithms in the literature. The experimental results show that the clustering performance of the algorithm is better than the traditional K-means algorithm and the algorithm in the literature, and the accuracy, precision, recall and F value are improved by 8.02%, 8.91%, 8.02%, 9.51% compared with the traditional K-means algorithm, which can be widely used in fields such as text mining, knowledge graph and natural language processing.</p> <p> </p>

Kmeans-CM Algorithm With Spectral Angle Mapper for Hyperspectral Image Classification

Hyperspectral images possess the characteristics of high dimensionality, which causes “dimensional disaster” and low classification accuracy, in response to the problems, based on traditional k-means algorithm and considering the importance of different bands for classification, and also combining both intra-class and inter-class information, a Kmeans-CM (K-means with correlation coefficient and maximize inter-class distance) algorithm with spectral angle mapper for hyperspectral image classification is proposed. First, weights of bands are defined by introducing coefficient of variation and spectral angle mapping, which measures the importance of bands for classification. Second, in order to intensify correlation between pixels in the same category, correlation coefficient is introduced to reset intra-class distance. Then, inter-class information is introduced for clustering by maximizing the distance between class centers and global center to reduce effect of local optimum of clustering effect. Finally, the K-means clustering objective function is redefined according to the band weights and intra-class, inter-class information, and also solving optimally. The overall classification accuracy of the method reached 84.47%, 90.08% and 80.45% on classical hyperspectral data sets Pavia University, Salinas and Botswana respectively, and the results show that the proposed algorithm owns good classification performance.

DP-Kmeans and Beyond: Optimal Clustering with a new Clustering Validity Index

<p>The K-means clustering algorithm is widely used in many areas for its high efficiency. However, the performance of the traditional K-means algorithm is very sensitive to the selection of initial clustering centers. Furthermore, except the convex distributed datasets, the traditional K-means algorithm still cannot optimally process many non-convex distributed datasets and datasets with outliers. To this end, this paper proposes the DP-Kmeans, an improved K-means algorithm based on the Density Parameter and center replacement, which can be more accurate than the traditional K-means by dropping the random selection of the initial clustering centers and continuous updating of the new centers. Due to the unsupervised learning feature, the number of clusters and the quality of data partitions generated by the clustering algorithm cannot be guaranteed. In order to evaluate the results of the DP-Kmeans algorithm, this paper proposes the SII, a new clustering validity index based on the Sum of the Inner-cluster compactness and the Inter-cluster separateness. Based on the DP-Kmeans algorithm and the SII index, a new method is proposed to determine the optimal clustering numbers for different datasets. Experimental results on ten datasets with different distributions demonstrate that the proposed clustering method is more effective the existing ones. </p> <p> </p>

Optimal k-means clustering using artificial bee colony algorithm with variable food sources length

<span>Clustering is a robust machine learning task that involves dividing data points into a set of groups with similar traits. One of the widely used methods in this regard is the k-means clustering algorithm due to its simplicity and effectiveness. However, this algorithm suffers from the problem of predicting the number and coordinates of the initial clustering centers. In this paper, a method based on the first artificial bee colony algorithm with variable-length individuals is proposed to overcome the limitations of the k-means algorithm. Therefore, the proposed technique will automatically predict the clusters number (the value of k) and determine the most suitable coordinates for the initial centers of clustering instead of manually presetting them. The results were encouraging compared with the traditional k-means algorithm on three real-life clustering datasets. The proposed algorithm outperforms the traditional k-means algorithm for all tested real-life datasets.</span>

Design and Implementation of an Improved K-Means Clustering Algorithm

Aiming at the problems of the traditional K-means clustering algorithm, such as the local optimal solution and the slow clustering speed caused by the uncertainty of k value and the randomness of the initial cluster center selection, this paper proposes an improved KMeans clustering method. The algorithm first uses the idea of the elbow rule based on the sum of squares of errors to obtain the appropriate number of clusters k, then uses the variance as a measure of the degree of dispersion of the samples, and selects k data points with the smallest variance and the distance greater than the average distance of the samples as the initial clustering center of the data set. Finally, combined with the “triangular inequality principle,” the unnecessary distance calculation of the KMeans algorithm in the iterative process is reduced, and the algorithm operation efficiency is improved. The results show that the improved KMeans clustering algorithm is tested on the UCI data set. Compared with the traditional k-means algorithm and Canopy-KMeans algorithm, the accuracy and speedup ratio of the improved KMeans clustering algorithm are significantly improved, and the clustering quality is improved.

An Analysis of the Optimal Features for Sentinel-1 Oil Spill Datasets Based on an Improved J–M/K-Means Algorithm

With the rapid development of world shipping, oil spill accidents such as tanker collisions, illegal sewage discharges, and oil pipeline ruptures occur frequently. As the SAR system expands from single polarization to multipolarization, the Polarmetric Synthetic Aperture Radar (Pol-SAR) system has been widely used in marine oil spill detection. However, in the studies of the oil spill extraction in SAR images, there are some problems that limit large-scale oil spill detection work. As a transition from single-polarized to full-polarized, the dual-polarized system carries some polarization information and can be obtained in large quantities for free, which has become a major breakthrough in solving the problem of large-scale oil spill detection. In order to optimize the multisource features that can be extracted from dual-polarized SAR images, greatly improve the utilization rate of dual-polarized SAR oil spill images under the premise of reducing workload, and ensure the accuracy of marine oil spill extraction, this paper adopts the metric of inter-class separability, the Jeffries–Matusita distance, which improves on the traditional K-means algorithm by focusing on the noise sensitivity defect of the K-means algorithm; the artificial influence of J–M distance in measuring the separability between classes improves the algorithm in three aspects: sample selection, distance calculation, and data evaluation. Finally, using the inter-sample J–M distance of multisource features, the overall accuracy of image segmentation, the F1-score, and the results of correlation analysis between features, three advantageous features and three subdominant features are selected that can be used for marine oil spill detection.

R-Reference points based k-means algorithm

k-Means algorithm is a simple and effective, but time consuming technique in clustering a great amount of data. In a traditional k-means algorithm the most significant part of the time cost of assigning a datum to a cluster with the shortest distance is spent to compute the distances between the datum and all cluster centers. There are many cluster centers relatively far away from the datum, though. The datum must not be an element of the distant clusters; therefore, it does not need to repeatedly calculate the distances between the datum and the distant cluster centers. In this research, an r-reference points based k-means (r-RPKM) algorithm is proposed to exclude the distant centers so that only the distances from the datum to the nearer cluster centers are computed in each iteration. The traditional k-means algorithm is susceptible to initial cluster centers, so a maximal distance based initial cluster center (MDICC) decider is hence presented to provide a set of initial cluster centers, therefore accelerating the r-RPKM algorithm. The experimental results demonstrated that the r-RPKM algorithm executes much faster than the traditional k-means algorithm and provides the same clustering result as the traditional k-means algorithm.

Malware recognition approach based on self‐similarity and an improved clustering algorithm

The recognition of malware in network traffic is an important research problem. However, existing solutions addressing this problem rely heavily on the source code and misrecognise vulnerabilities (i.e. incur a high false positive rate (FPR)) in some cases. In this paper, we initially use the K-means clustering algorithm to extract malware patterns under user to root attacks in network traffic. Since the traditional K-means algorithm needs to determine the number of clusters in advance and it is easily affected by the initial cluster centres, we propose an improved K-means clustering algorithm (NIKClustering algorithm) for cluster analysis. Furthermore, we propose the use of self-similarity and our improved clustering algorithm to recognise buffer overflow vulnerabilities for malware in network traffic. This motivates us to design and implement a recognition approach for buffer overflow vulnerabilities based on self-similarity and our improved clustering algorithm, called Reliable Self-Similarity with Improved K-means Clustering (RSS-IKClustering). Extensive experiments conducted on two different datasets demonstrate that the RSS-IKClustering can achieve much fewer false positives than other notable approaches while increasing accuracy. We further apply our RSS-IKClustering approach on a public dataset (Center for Applied Internet Data Analysis), which also exhibited a high accuracy and low FPR of 96% and 1.5%, respectively.