Optimal K-means Research Articles

Flame temperature and emissivity distribution measurement of solid propellant based on clustering analysis of multispectral radiation images

To measure the combustion parameters of a solid propellant, this Letter researches the fitting method for flame temperature and emissivity based on multispectral images and proposes the particle swarm optimization–K-means (PSO–K-means) clustering optimization algorithm of a flame multispectral image. Considering the difference in flame radiation characteristics in different regions, the flame multispectral image is clustered, and spectra in different regions are analyzed and selected in different fitting bands to inverse temperature and emissivity. On this basis, the method is applied to measure solid propellant combustion parameters with different formulations. The measurement shows that the flame temperature is between 1700 and 2100 K, and the emissivity is concentrated in 0.1–0.5. Compared with temperature measurements obtained from tungsten–rhenium thermocouples, the relative deviation of multispectral imaging thermometry is less than 5%. The distribution characteristics of solid propellant combustion parameters with different formulations were analyzed, which provided important data support for evaluating combustion conditions and optimizing solid propellant formulations.

A hybrid genetic-fuzzy ant colony optimization algorithm for automatic K-means clustering in urban global positioning system

This paper introduces an innovative automatic K-means clustering algorithm, namely HGA-FACO, which seamlessly integrates the noise algorithm, Genetic Algorithm (GA), Ant Colony Optimization (ACO), and Adaptive Fuzzy System (AFS). The rationale behind the HGA-FACO algorithm is to mitigate the shortcomings of traditional K-means, particularly the reliance on pre-determined cluster centers and the need for specifying the number of clusters in advance. By optimizing the search strategy, HGA-FACO efficiently circumvents local optima and effectively explores the global optimal solution, resulting in more accurate and stable clustering outcomes. To validate the superiority of the HGA-FACO over conventional K-Means Clustering (KMeans) and other intelligent clustering approaches such as ACO-KMeans, GA-KMeans (GAK), particle swarm optimization KMeans (PSOK), and ACO-GAK, we conducted comprehensive experiments on taxi Global Positioning System (GPS) datasets sourced from four distinct cities. Employing rigorous evaluation metrics including Silhouette Coefficient (SC), Partition Coefficient (PBM), Davies-Bouldin Index (DBI), and Sum of Squared Errors (SSE), the experimental results convincingly demonstrate that the HGA-FACO significantly outperforms its counterparts across all metrics, highlighting its exceptional performance in clustering effectiveness and compactness. While the HGA-FACO faces challenges related to computational complexity and the necessity for initial parameter tuning, its performance limitations on small-sized or unevenly distributed datasets are acknowledged. Nevertheless, the algorithm's advancements in the field of clustering algorithms are undeniable and hold immense potential for practical applications, notably in city hotspot identification.

K-Means text clustering method based on Decision Grey Wolf Optimization

Aiming at the problem that the traditional algorithm is easy to fall into local optimum in the process of text clustering, which leads to inaccurate text clustering results, a text clustering method based on decision grey wolf optimization K-Means is proposed to cluster the text data set and the standard UCI data set respectively. Afterword segmentation, stop words removal, feature extraction, and text vectorization of text data, the powerful optimization ability of the Decision Gray Wolf Optimization (DGWO) algorithm is used for global optimization, and the clustering center in K-Means algorithm is replaced by the location of wolves. The position of the wolf group is updated by iterative optimization to obtain the optimal clustering center, to perform text clustering. The experimental results show that compared with the traditional method, the precision, recall, and F-Measure of the text data clustering are improved by 49.22%, 51.15%, and 48.98% respectively. The precision, recall, and F-Measure of UCI data clustering are increased by 23.92%, 25.40%, and 24.70% respectively, and the text clustering results are more reliable.

K-Means Optimization Algorithm to Improve Cluster Quality on Sparse Data

The aim of this research is clustering sparse data using various K-Means optimization algorithms. Sparse data used in this research came from Citampi Stories game reviews on Google Play Store. This research method are Density Based Spatial Clustering of Applications with Noise-Kmeans (DB-Kmeans), Particle Swarm Optimization-Kmeans (PSO-Kmeans), and Robust Sparse Kmeans Clustering (RSKC) which are evaluated using the silhouette score. Clustering sparse data presented a challenge as it could complicate the analysis process, leading to suboptimal or non-representative results. To address this challenge, the research employed an approach that involved dividing the data based on the number of terms in three different scenarios to reduce sparsity. The results of this research showed that DB-Kmeans had the potential to enhance clustering quality across most data scenarios. Additionally, this research found that dividing data based on the number of terms could effectively mitigate sparsity, significantly influencing the optimization of topic formation within each cluster. The conclusion of this research is that this approach is effective in enhancing the quality of clustering for sparse data, providing more diverse and easily interpretable information. The results of this research could be valuable for developers seeking to understand user preferences and enhance game quality.

Projected urban flood risk assessment under climate change and urbanization based on an optimized multi-scale geographically weighted regression

Previous research has primarily focused on evaluating flood risks influenced by single factors, often neglecting the combined impacts of climate change and urbanization on historical and future flood risks. This study utilized 12 assessment indicators across three criteria layers. It employed the Technique for Order Preference by Similarity to an Ideal Solution (TOPSIS) and an optimized Multi-scale Geographically Weighted Regression (MGWR) to develop a comprehensive assessment framework for historical and projected urban flood risks under combined scenarios of RCPs and SSPs. The risk of future extreme precipitation events increased under 4 RCPs. Compared with 2010, Beijing's urban land area is expected to increase by an average of 53.64 % in 2060 under 5 SSPs, accompanied by rapid socioeconomic development. MGWR based on K-means optimization improves operational speed by reducing the number of patches. The areas classified as high and highest flood risk levels increased by 38.87 % and 60.17 % from the 2010s to the 2060s, indicating an upward trend in future flood risk. Higher flood risk is observed under the high emissions combination scenario. Structural equation modeling (SEM) revealed that road network density (RND), runoff depth (RD), and distance to road (DRO) were the main influencing factors contributing to flood risks in Beijing.

Delineating the mechanisms controlling groundwater salinization using chemo-isotopic data and meta-heuristic clustering algorithms (case study: Saguenay-Lac-Saint-Jean region in the Canadian Shield, Quebec, Canada).

This study employed meta-heuristic clustering algorithms to determine the source and mechanism of groundwater salinization in Quebec's Saguenay-Lac-Saint-Jean (SLSJ) region, utilizing hydrogeochemical (38 inorganic constituents, including minor, major, and trace elements) and isotopic data (δ18O and δ2H). A total of 382 groundwater and precipitation samples were examined. Among the meta-heuristic algorithms, Artificial Bee Colony K-Means (ABCKM), Differential Evolution K-Means (DEKM), Harmony Search K-Means (HSKM), Particle Swarm Optimization K-Means (PSOKM), and Genetic K-Means (GKM) were used and investigated, and finally, PSOKM displayed superior performance and was chosen for further investigation. Analysis of diverse plots and hydrogeochemical modeling unveiled the impact of the Laflamme Sea invasion on groundwater chemistry. PSOKM1, PSOKM4, and PSOKM5 exhibited notable carbonate and silicate dissolution, with PSOKM4 demonstrating predominant carbonate dissolution. Cation exchange was identified through binary plots and Chloro Alkaline Index (CAI), with reverse cation exchange predominantly observed in most PSOKM4 samples, while positive values suggested direct cation exchange in other clusters. Spatial dynamics analysis using HFE-D indicated that salinization occurs as groundwater flows through crystalline bedrock aquifers, resulting in a transition from HCO3- dominance in PSOKM4 to Cl- dominance in the remaining clusters. Interaction between groundwater and rock along this path facilitated a transformation towards a Na-Cl end-member. The closely aligned stable isotopes with the Global Meteoric Water Line (GMWL) indicated a blend of meteoric water and seawater as the groundwater source.

A Survey on Comprehensive Exploration of Modern Perception System

This review paper offers an in-depth analysis of recent advancements in image-based intelligent transportation systems. It provides insights into various approaches employed for detecting false images, license plate recognition, distributing emergency messages, as well as detecting and classifying vehicle accidents and road accidents. The research critically evaluates the pros and cons of deep learning techniques, including position-based routing, enhanced YOLOv8, optimal K-means with a convolutional neural network, and gated hierarchical multi-task learning. The investigation of an Internet of Things-based vehicle accident detection and classification system highlights the benefits of sensor fusion for precise accident detection; nonetheless, the evaluation raises questions regarding the scalability and reliability of smartphone sensors. The utility of a deep learning system for road accident identification utilizing artificially created multi-perspective movies is emphasized, along with warnings about possible limits in capturing real-world circumstances

CNN-LSTM Base Station Traffic Prediction Based On Dual Attention Mechanism and Timing Application

Abstract Energy consumption in 5G base stations remains consistently high, even during periods of low traffic loads, thereby resulting in unnecessary inefficiencies. To address this problem, this paper presents a novel approach by proposing a convolutional neural network (CNN)-long short-term memory (LSTM) traffic prediction model with a dual attention mechanism, coupled with the particle swarm optimization k-means algorithm for intelligent switch timing. The proposed CNN-LSTM model leverages a dual channel attention mechanism to bolster key feature information for long-term traffic data predictions. Specifically, a temporal attention mechanism is added to the LSTM to enhance the importance of temporal information. Moreover, the particle swarm optimization K-Means algorithm is proposed in order to cluster the traffic prediction results, output the corresponding time points of the lower traffic value and to obtain the optimal switch-off periods of the base station. Extensive experiments across multiple base stations over an extended period of time have validated our approach. The results show that this method offers accurate traffic prediction with minimal average errors in traffic prediction and the on/off timings of the base stations are in line with the “tide effect” of traffic, thereby achieving the goal of energy savings.

Distributed photovoltaic siting optimisation considering load centre similarity

The load fluctuation law remains challenging for traditional distribution line users. Furthermore, as the number of distributed photovoltaic installations connected to the distribution network rises, the issue of voltage overload on the distribution lines becomes more prevalent. This, in turn, adds complexity to power system operation. To configure the PV access location, whilst ensuring the line voltage is qualified, this paper applies the DBSCAN density clustering and K-means optimization algorithm to classify the distribution network line load. Different characteristics of the load collection are then constructed, and the concept of the load centre distance is proposed. PV access points are selected based on the load center characteristic curve and PV curve similarity. Model simulation is used to verify the conclusions, which demonstrate the rationality and effectiveness of the proposed method. The model simulation is conducted to confirm the soundness and credibility of the conclusions drawn.

Reform and Innovation of Ideological and Political Education Teaching Mode in Colleges and Universities in the Context of Information Technology Empowerment

Abstract In the rapidly evolving landscape of higher education, integrating digital advancements presents challenges and opportunities for ideological and political education. This research delves into the intersection of information technology and educational methodology, proposing a novel approach to teaching civics and politics. We accurately identify student behavioral patterns by applying a sophisticated clustering analysis through density optimization K-means, NN-Stacking, and Stacking fusion techniques, thereby tailoring educational content more effectively. Implementing this data-driven teaching model significantly boosts student outcomes in civics education, evidenced by an average score increase of 13.306 points. Furthermore, statistical Analysis (P = 0.0433 < 0.05) validates the enhanced impact of this method compared to traditional pedagogies. This study underscores the transformative power of information technology in enriching ideological and political education, paving the way for innovative teaching strategies.

Enhanced abnormal data detection hybrid strategy based on heuristic and stochastic approaches for efficient patients rehabilitation

Over the last few years, substantial research has been conducted towards developing efficient abnormal detection techniques while considering efficiency, accuracy, high-dimensional data, distributed environments, and others. Researchers increasingly deal with “abnormalities” in clinical patient data to derive relevant clinical knowledge for making informed decisions. However, data collection for clinically relevant research is often guided by patient conditions and administrative or clinical requirements rather than a regular schedule. Therefore, clinical data is frequently obtained in an unreliable form, characterized by data outliers and inconsistencies, incomplete information, and an unstructured format that varies based on patient types and data structures. In this research study, an enhanced hybrid AD strategy is developed based on heuristic and stochastic methods to cope with abnormalities in the clinical data of patients. The proposed hybrid strategy employs optimal k-means clustering as a heuristic method to cluster the clinical data based on the patient’s routine exercise characteristics to cope with abnormalities efficiently. Next, an interquartile range-based stochastic approach is employed as a statistical method to detect and eliminate abnormal data points by providing only reliable and effectual data to medical practitioners. The main objective of this research article is to facilitate healthcare and research practitioners by dealing with a high dimensional massive amount of inconsistent and incomplete clinical data of patients to detect and discard anomalous data points for providing only efficacious information. Furthermore, the AutoML paradigm is employed to develop an optimal regression model for analyzing the impact of the proposed hybrid strategy for abnormal pattern detection. In addition, different statistical error estimation measures are used to evaluate the empirical effectiveness of the proposed hybrid strategy using AutoML. The experiment results show a noteworthy improvement in terms of the R2 score for predicting healthcare indicators compared to the existing state-of-the-art regression models. Our optimal regression model performed efficiently regarding the R2 score and MAPE; it achieved an R2 score of 0.9855 and 0.9850 for predicting the Borg RPE and TUG, respectively. Similarly, our model achieved a low prediction error in terms of MAPE for predicting both health functional indicators; it achieved a MAPE of 6.57% and 5.19% for Borg RPE and TUG prediction. Our contribution signifies that the performance of the AutoML improves and outperforms traditional regression models while applying our proposed hybrid abnormal detection model to the patient’s rehabilitation data for accurately dealing with anomalous data.

Augmented deep neural network architecture for assessing damage severity in 3D concrete buildings under temperature fluctuations based on K-means optimization

This research paper introduces a novel approach for forecasting the severity of damage in column elements within a complex 3D concrete structure. The paper presents two innovative methods that have not been previously proposed. Firstly, a new equation is suggested to enhance the sensitivity of the dataset used for training and learning in machine learning techniques. This equation incorporates two crucial dynamic characteristics, namely frequencies and mode shapes. The second method involves a new technique for optimizing the architecture of a deep neural network (DNN) using K-means optimizer (KO), referred to KODNN. By employing KO, the optimal values for the DNN architecture and learning rate are determined. To assess the effectiveness of the proposed method, KODNN is employed to develop a model for predicting the compressive strength of concrete using benchmark datasets. A comparison is made between the obtained results from this example and those obtained using the original DNN model to demonstrate the performance improvement achieved. Finally, KODNN is utilized to predict the severity of damage in elements of a 3D concrete building under various temperature conditions, considering two specific damage cases. The results indicate that the proposed method achieves a high level of accuracy and reliability.

Energy-Efficient Improved Optimal K-Means: Dynamic Cluster Head Selection based on Delaying the First Node Death in MWSN-IoT

The Internet of Things (IoT), which attaches dynamic devices that can access the Internet to create a smart environment, is a tempting research area. IoT-based mobile wireless sensor networks (WSN-IoT) are one of the major databases from which the IoT collects data for analysis and interpretation. However, one of the critical constraints is network lifetime. Routing-based clustered protocols and cluster head (CH) selection are crucial in load balancing and sensor longevity. Yet, with clustering, sensor node mobility requires more overhead because the nodes close to the center may get far and thus become unsuitable to be a CH, whereas those far from the center may get close and become good CH candidates, influencing energy consumption. This paper suggests an energy-efficient clustering protocol with a dynamic cluster head selection considering the distance to the cluster center, remaining energy, and each node's mobility degree implementing a rotation mechanism that allows cluster members to be equally elected while prioritizing those with the minimum weight. The advised algorithm aims to delay the first node death (FND) and thus prolong the stability period and minimize energy consumption by avoiding re-clustering. The performance of the proposed protocol exceeds that achieved in our previous work, Improved OKmeans, by 11%, in first dead node lifetime maximization, 43% in throughput, and 44% in energy efficiency.

Comprehensive Identification of Driving Style Based on Vehicle's Driving Cycle Recognition

The driving style of human automobile drivers plays a vital role in vehicle energy management and driving safety. Human drivers often exhibit different driving styles during different driving cycles. Moreover, short-term driving behaviors cannot accurately reflect their comprehensive driving styles. Thus, a comprehensive driving style identification model, based on driving cycle recognition, is proposed in this study. The model was developed to comprehensively assess and more accurately identify long-term driving styles. First, the characteristic parameters of the driving cycle and style are selected and calculated, and the dimensions of the data collected from real vehicles are minimized through principal component analysis (PCA). Second, a two-stage clustering algorithm based on the particle swarm optimization K-means optimized by the genetic algorithm (GA-PSO-K-means) is used to obtain the type labels of driving cycles and styles to ensure the stability of the clustering algorithm. Third, an artificial neural network (ANN) is utilized to build the instantaneous recognition model of the driving cycle and style. Based on this, a comprehensive driving style identification model is built using the analytic hierarchy process(AHP). Finally, the bench and real vehicle tests are used to verify that the proposed model is accurate and effective.

Research on Rapid Identification Technology of Sand and Dust Characteristic Monitoring Data Based on Optimized K-Means Clustering

The criteria-based sand and dust weather determination method has the problem ofbeing a cumbersome and time-consuming process when processing a large amount of raw data, and cannot avoid the problems of repeatability and reproducibility. On the basis of statistical analysis of the air automatic monitoring data in the cities affected by sand and dust, this paper proposes a k-means optimization algorithm (MDPD-k-means) based on maximum density and percentage distance, which can quickly filter the characteristic data of sand and dust in a short time, and identify the days affected by sand and dust. This method effectively improves the data processing efficiency, solves the problems of poor reproducibility and large artificial error of traditional methods, and can support the business application of sand and dust data elimination. This paper uses the method to identify the sand and dust data of 10 cities in Shaanxi Province from 2016 to 2022, determines a total of 1107 sand and dust days, and points out that the number of days affected by sand and dust is increasing year by year. After excluding the effect of sand and dust, the urban PM10 concentration decreases by 18.42~1.41% respectively, which provides important data information for accurately evaluating the effectiveness of air pollution prevention and control.

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>

Optimal location of logistics distribution centres with swarm intelligent clustering algorithms.

A clustering algorithm is a solution for grouping a set of objects and for distribution centre location problems. But the common K-means clustering algorithm may give local optimal solutions. Swarm intelligent algorithms simulate the social behaviours of animals and avoid local optimal solutions. We employ three swarm intelligent algorithms to avoid these solutions. We propose a new algorithm for the clustering problem, the fruit-fly optimization K-means algorithm (FOA K-means). We designed a distribution centre location problem and three clustering indicators to evaluate the performance of algorithms. We compare the algorithms of K-means with the ant colony optimization algorithm (ACO K-means), particle swarm optimization algorithm (PSO K-means), and fruit-fly optimization algorithm. We find K-Means modified by the fruit-fly optimization algorithm (FOA K-means) has the best performance on convergence speed and three clustering indicators, compactness, separation, and integration. Thus, we can apply FOA K-means to improve the distribution centre location solution and the efficiency for distribution in the future.

Classification of Dysphonic Voices in Parkinson's Disease with Semi-Supervised Competitive Learning Algorithm.

This article proposes a novel semi-supervised competitive learning (SSCL) algorithm for vocal pattern classifications in Parkinson’s disease (PD). The acoustic parameters of voice records were grouped into the families of jitter, shimmer, harmonic-to-noise, frequency, and nonlinear measures, respectively. The linear correlations were computed within each acoustic parameter family. According to the correlation matrix results, the jitter, shimmer, and harmonic-to-noise parameters presented as highly correlated in terms of Pearson’s correlation coefficients. Then, the principal component analysis (PCA) technique was implemented to eliminate the redundant dimensions of the acoustic parameters for each family. The Mann–Whitney–Wilcoxon hypothesis test was used to evaluate the significant difference of the PCA-projected features between the healthy subjects and PD patients. Eight dominant PCA-projected features were selected based on the eigenvalue threshold criterion and the statistical significance level (p < 0.05) of the hypothesis test. The SSCL algorithm proposed in this paper included the procedures of the competitive prototype seed selection, K-means optimization, and the nearest neighbor classifications. The pattern classification experimental results showed that the proposed SSCL method can provide the excellent diagnostic performances in terms of accuracy (0.838), recall (0.825), specificity (0.85), precision (0.846), F-score (0.835), Matthews correlation coefficient (0.675), area under the receiver operating characteristic curve (0.939), and Kappa coefficient (0.675), which were consistently better than those results of conventional KNN or SVM classifiers.

IRaPCA and SOMoC: Development and Validation of Web Applications for New Approaches for the Clustering of Small Molecules.

The clustering of small molecules implies the organization of a group of chemical structures into smaller subgroups with similar features. Clustering has important applications to sample chemical datasets or libraries in a representative manner (e.g., to choose, from a virtual screening hit list, a chemically diverse subset of compounds to be submitted to experimental confirmation, or to split datasets into representative training and validation sets when implementing machine learning models). Most strategies for clustering molecules are based on molecular fingerprints and hierarchical clustering algorithms. Here, two open-source in-house methodologies for clustering of small molecules are presented: iterative Random subspace Principal Component Analysis clustering (iRaPCA), an iterative approach based on feature bagging, dimensionality reduction, and K-means optimization; and Silhouette Optimized Molecular Clustering (SOMoC), which combines molecular fingerprints with the Uniform Manifold Approximation and Projection (UMAP) and Gaussian Mixture Model algorithm (GMM). In a benchmarking exercise, the performance of both clustering methods has been examined across 29 datasets containing between 100 and 5000 small molecules, comparing these results with those given by two other well-known clustering methods, Ward and Butina. iRaPCA and SOMoC consistently showed the best performance across these 29 datasets, both in terms of within-cluster and between-cluster distances. Both iRaPCA and SOMoC have been implemented as free Web Apps and standalone applications, to allow their use to a wide audience within the scientific community.

A K-Means Clustering Algorithm for Early Warning of Financial Risks in Agricultural Industry

As the primary industry, agricultural industry is the basis of guaranteeing people’s basic life and national economic development. Agricultural industrial finance/financial is a weak link in the financial system, which seriously hinders the emergence of agricultural scale effect and the improvement in agricultural production efficiency. In order to find the financial risk of agricultural industry in time, this article proposes an agricultural industry financial risk early warning system based on improved K-means clustering algorithm. Because the traditional K-means algorithm is easy to fall into local optimization in the clustering process, the clustering effect is not reliable. In this article, the idea of immune cloning and particle swarm optimization location update is added to the grey wolf optimization algorithm. Grey wolf optimization algorithm and K-means algorithm are combined to solve the problem that K-means algorithm is easy to fall into local optimization. In the experimental part, through comparative verification, it can be found that the prediction performance of this system is superior to other models. Its practical application value is higher. Therefore, choosing this system for early warning of agricultural industry finance can effectively improve the accuracy of early warning and provide guarantee for the economic development of agricultural industry.