Improved Clustering Algorithm Research Articles

An evaluation method for integrating EVs in distribution networks with clustering algorithms

Introduction: With the installation of advanced metering infrastructures, the operation data of EVs in the distribution networks can be obtained with time intervals of seconds and minutes. Based on these operation data, the impacts of integrating EVs into the distribution networks can be calculated and discussed.Methods: In this paper, an improved clustering algorithm with a new distance index for the daily curves of different types of EVs was proposed. The different types of EVs can be classified into several typical groups and the required number of operation scenarios can be reduced. After reducing the large-scale database to typical clusters, research can be conducted on the characteristics of EVs specific to certain scenarios.Results and discussion: In this way, the capability of integrating different types of EVs into the distribution network, such as fast EV charging stations, slow EV charging stations, and EV bus charging stations, is assessed from the perspective of load capacity size. The proposed clustering algorithm was verified with practical operation data.

A Fast Adaptive Millimeter-Wave Radar Clustering Algorithm

This paper focuses on the intelligent recognition problem of radar detection targets. Aiming at the low accuracy and slow speed of millimeter-wave radar clustering point cloud information, a feature algorithm of millimeter-wave radar suitable for detecting targets is proposed. In the detection of targets by millimeter-wave radar, distance is the biggest factor affecting the number and degree of sparsity. A method that combines the feature information of the point cloud with the KD tree proximity search algorithm and the DBSCAN clustering algorithm is proposed, which can adapt to the problems of uneven target point cloud, small amount of data and slow clustering speed. The improved algorithm can use the KD tree to quickly find adjacent points and calculate the distance between adjacent points. The corresponding number of thresholds is set according to the distance where the target is located, and the radius of the target area reflected by the millimeter-wave radar plus the distance of the last threshold point is used as the neighborhood radius of the improved algorithm. Therefore, fast and adaptive parameter adjustment of the millimeter-wave radar can be realized. Simulation tests show that the improved clustering algorithm has better parameters. The accuracy of the improved algorithm is increased by 4.2%, and it also greatly improves the clustering speed.

Data Collection in Laser-Powered UAV-Assisted IoT Networks: Phased Scheme Design Based on Improved Clustering Algorithm

Data Collection in Laser-Powered UAV-Assisted IoT Networks: Phased Scheme Design Based on Improved Clustering Algorithm

A clustering effectiveness measurement model based on merging similar clusters.

This article presents a clustering effectiveness measurement model based on merging similar clusters to address the problems experienced by the affinity propagation (AP) algorithm in the clustering process, such as excessive local clustering, low accuracy, and invalid clustering evaluation results that occur due to the lack of variety in some internal evaluation indices when the proportion of clusters is very high. First, depending upon the "rough clustering" process of the AP clustering algorithm, similar clusters are merged according to the relationship between the similarity between any two clusters and the average inter-cluster similarity in the entire sample set to decrease the maximum number of clusters Kmax. Then, a new scheme is proposed to calculate intra-cluster compactness, inter-cluster relative density, and inter-cluster overlap coefficient. On the basis of this new method, several internal evaluation indices based on intra-cluster cohesion and inter-cluster dispersion are designed. Results of experiments show that the proposed model can perform clustering and classification correctly and provide accurate ranges for clustering using public UCI and NSL-KDD datasets, and it is significantly superior to the three improved clustering algorithms compared with it in terms of intrusion detection indices such as detection rate and false positive rate (FPR).

A Hybrid Approach for Energy Consumption and Improvement in Sensor Network Lifespan in Wireless Sensor Networks.

In this paper, we propose an improved clustering algorithm for wireless sensor networks (WSNs) that aims to increase network lifetime and efficiency. We introduce an enhanced fuzzy spider monkey optimization technique and a hidden Markov model-based clustering algorithm for selecting cluster heads. Our approach considers factors such as network cluster head energy, cluster head density, and cluster head position. We also enhance the energy-efficient routing strategy for connecting cluster heads to the base station. Additionally, we introduce a polling control method to improve network performance while maintaining energy efficiency during steady transmission periods. Simulation results demonstrate a 1.2% improvement in network performance using our proposed model.

An Exploration of Customer Segmentation Methods Based on Clustering Algorithm in the Context of Big Data

Accompanied by the continuous development of big data technology, various industries are well aware of the advantages of big data, which are widely used in customer service work, especially in the support of customer segmentation work, and have achieved good results. In this paper, for the problems of large fluctuation of clustering results and low clustering purity in the traditional data mining process, the big data precision mining technology with improved clustering algorithm is proposed. And it is applied in the field of customer segmentation, and the experimental results show that the improved clustering algorithm is applied in customer segmentation, the result curve fluctuation amplitude is small, and the clustering purity is significantly higher than the traditional algorithm.

Classification and prognostic factors of patients with cervical spondylotic myelopathy after surgical treatment: a cluster analysis

Identifying potential prognostic factors of CSM patients could improve doctors’ clinical decision-making ability. The study retrospectively collected the baseline data of population characteristics, clinical symptoms, physical examination, neurological function and quality of life scores of patients with CSM based on the clinical big data research platform. The modified Japanese Orthopedic Association (mJOA) score and SF-36 score from the short-term follow-up data were entered into the cluster analysis to characterize postoperative residual symptoms and quality of life. Four clusters were yielded representing different patterns of residual symptoms and quality of patients’ life. Patients in cluster 2 (mJOA RR 55.8%) and cluster 4 (mJOA RR 55.8%) were substantially improved and had better quality of life. The influencing factors for the better prognosis of patients in cluster 2 were young age (50.1 ± 11.8), low incidence of disabling claudication (5.0%) and pathological signs (63.0%), and good preoperative SF36-physiological function score (73.1 ± 24.0) and mJOA socre (13.7 ± 2.8); and in cluster 4 the main influencing factor was low incidence of neck and shoulder pain (11.7%). We preliminarily verified the reliability of the clustering results with the long-term follow-up data and identified the preoperative features that were helpful to predict the prognosis of the patients. This study provided reference and research basis for further study with a larger sample data, extracting more patient features, selecting more follow-up nodes, and improving clustering algorithm.

Abnormal Electricity Consumption Detection Method for Smart Grid Using Fusion Matrix Completion and Improved Clustering Algorithm

Abnormal Electricity Consumption Detection Method for Smart Grid Using Fusion Matrix Completion and Improved Clustering Algorithm

Application of Ant Colony Optimization Improved Clustering Algorithm in Malicious Software Identification

Application of Ant Colony Optimization Improved Clustering Algorithm in Malicious Software Identification

Extraction of brain function pattern with visual-capture-task fMRI using dynamic time-window method in ADHD children

Attention deficit/Hyperactivity disorder (ADHD) has a great impact on children's development. This paper uses a novel adaptive brain state extraction algorithm to construct a dynamic time-window brain network, which captures the brain function pattern characteristics of ADHD children with higher temporal resolution. The test data were acquired by functional magnetic resonance imaging (fMRI) obtained from 23 children with ADHD during the visual-capture-task [age: (8.27 ± 2.77)]. A spatial standard deviation method is used after the initial data processing, to extract the brain activity pattern state; An improved clustering algorithm is constructed to verify the changes made to the dynamic time-window brain network model. There can be seen clear differences between each state within 0.05 s after the test. The results show that our improved new framework can effectively obtain the characteristics of dynamic brain functional connection strength changes during the task. In addition, the new algorithm is able to capture the dynamic changes of the brain network, with an 80 % improvement compared to traditional methods for the average modularity value Q. This work demonstrates a novel approach to find out the pattern changes between dynamic brain function connections, which can be of great significance for the adjuvant treatment of children with ADHD.

Visual Navigation and Obstacle Avoidance Control for Agricultural Robots via LiDAR and Camera

Obstacle avoidance control and navigation in unstructured agricultural environments are key to the safe operation of autonomous robots, especially for agricultural machinery, where cost and stability should be taken into account. In this paper, we designed a navigation and obstacle avoidance system for agricultural robots based on LiDAR and a vision camera. The improved clustering algorithm is used to quickly and accurately analyze the obstacle information collected by LiDAR in real time. Also, the convex hull algorithm is combined with the rotating calipers algorithm to obtain the maximum diameter of the convex polygon of the clustered data. Obstacle avoidance paths and course control methods are developed based on the danger zones of obstacles. Moreover, by performing color space analysis and feature analysis on the complex orchard environment images, the optimal H-component of HSV color space is selected to obtain the ideal vision-guided trajectory images based on mean filtering and corrosion treatment. Finally, the proposed algorithm is integrated into the Three-Wheeled Mobile Differential Robot (TWMDR) platform to carry out obstacle avoidance experiments, and the results show the effectiveness and robustness of the proposed algorithm. The research conclusion can achieve satisfactory results in precise obstacle avoidance and intelligent navigation control of agricultural robots.

RETRACTED ARTICLE: The Application of Artificial Immune Network in E-Commerce Credit Risk Assessment

In order to improve the accuracy of e-commerce credit risk assessment, this paper suggests utilizing an artificial immune network to upgrade the text mining algorithm. Through this process, a new e-commerce risk assessment model reliant on the improved algorithm can be constructed with the intention of decreasing the likelihood of risk in digital transactions. The results show that the accuracy and loss rate of the improved clustering algorithm are 97.3% and 4.3%, respectively, both of which are better than the comparison algorithm. Then, the empirical analysis of the e-commerce credit risk assessment model proposed in the study shows that the average fitness and accuracy of the model after stability are 0.0022 and 95.63%, respectively, demonstrating superior performance compared to the comparison model. The above results show that the improved algorithm and the risk assessment model have good performance. Therefore, using this model to evaluate the credit risk of e-commerce can not only improve the accuracy of credit evaluation and promote the sustainable development of e-commerce. Furthermore, it can catalyze the adoption of innovative credit evaluation methods and promote the application of artificial intelligence technology in e-commerce.

Retracted: Application of the Improved Clustering Algorithm in Operating Room Nursing Recommendation under the Background of Medical Big Data.

[This retracts the article DOI: 10.1155/2022/4299280.].

Design of an Intelligent Processing System for Business Data Analysis Based on Improved Clustering Algorithm

In order to further optimize the processing of business data and increase the effectiveness and accuracy of business data analysis, this research investigated the design of an intelligent processing system for business data analysis based on improved clustering algorithms. Some issues with business data analysis can be efficiently resolved by enhancing clustering algorithms, resulting in the provision of more intelligent, thorough, and precise business data analysis services for businesses and organizations. The improved clustering algorithm is compared with the traditional clustering algorithm to analyze the experimental data, the results showed that the maximum clustering effect of the improved clustering algorithm was above 80%, the highest robustness was 91.65%, and the highest point in algorithm performance was 90.97%. From these three aspects, it can be seen that improved clustering algorithms have more advantages than traditional clustering algorithms. Therefore, improving clustering algorithms can make business data processing more efficient, accurate, and reliable, providing enterprises and organizations with higher quality business data analysis services.

Improved clustering algorithm for personal privacy and security protection of elderly consumers

With the advancement of technology, there is an increasing emphasis on the personal privacy and security of elderly consumers. This article focuses on the personal privacy and security protection of elderly consumers. Based on the K-means (KM) clustering algorithm, the optimal value was obtained using the monarch butterfly optimization (MBO) algorithm. The migration operator and adjustment operator of the MBO algorithm were enhanced using differential variation algorithm and adaptive methods to obtain a modified monarch butterfly optimization (MMBO) algorithm. Then, to ensure secure protection during clustering, differential privacy (DP) was employed to add noise perturbation to data to obtained a method called DPMMBO-KM algorithm. In experiments on the UCI dataset, it was found that the MMBO-KM algorithm had better clustering performance. Taking the Iris dataset as an example, the MMBO-KM algorithm achieved the highest accuracy of 93.21%. In the application to recommendation systems, the DPMMBO-KM algorithm achieved higher F1 values under different privacy budgets; the average was 0.06. The results demonstrate that the improved clustering algorithm designed in this article can improve clustering results while ensuring personal privacy and data security, and also perform well in recommendation systems.

Segmentation algorithm of coal slurry foam with double-point directional extension based on the improved FCM clustering algorithm

In flotation production, the visual surface information of the flotation foam reflects the flotation effects, which are closely related to the flotation conditions and directly reflect the degree of mineralization of the foam layer. In this study, it was proposed a novel and efficient segmentation algorithm to extract the edge information of slime bubbles, as the boundaries are typically blurred and difficult to segment, due to the slime bubbles sticking to each other in the slime flotation foam image. First, the improved clustering algorithm and image morphology operation were used to extract the edges of the foam spots. Second, the image morphological operations were used as a starting point to look around the foam edge points. The pseudo-edge points were then removed using a region and spatial removal algorithm. Finally, the foam edges were extracted using the double-point directed expansion algorithm. A new criterion was proposed for segmentation effect determination based on the particularity of the segmented object. The feasibility and effectiveness of the foam segmentation method were investigated by comparative experiments. The experimental results showed that the proposed algorithm could obtain the foam surface properties more accurately and provide effective guidance for flotation production.

Application of Data Mining Technology with Improved Clustering Algorithm in Library Personalized Book Recommendation System

Application of Data Mining Technology with Improved Clustering Algorithm in Library Personalized Book Recommendation System

Application of Improved Clustering Algorithm in Precision Poverty Auditing - An Example from Region D

Application of Improved Clustering Algorithm in Precision Poverty Auditing - An Example from Region D

Application of improved clustering algorithm in precision poverty auditing - an example from region D

Application of improved clustering algorithm in precision poverty auditing - an example from region D

DEICA: A differential evolution‐based improved clustering algorithm for IoT‐based heterogeneous wireless sensor networks

SummaryWith the evolution of technology, many modern applications like habitat monitoring, environmental monitoring, disaster prediction and management, and telehealth care have been proposed on wireless sensor networks (WSNs) with Internet of Things (IoT) integration. However, the performance of these networks is restricted because of the various constraints imposed due to the participating sensor nodes, such as nonreplaceable limited power units, constrained computation, and limited storage. Power limitation is the most severe among these restrictions. Hence, the researchers have sought schemes enabling energy‐efficient network operations as the most crucial issue. A metaheuristic clustering scheme is proposed here to address this problem, which employs the differential evolution (DE) technique as a tool. The proposed scheme achieves improved network performance via the formulation of load‐balanced clusters, resulting in a more scalable and adaptable network. The proposed scheme considers multiple parameters such as nodes' energy level, degree, proximity, and population for suitable network partitioning. Through various simulation results and experimentation, it establishes its efficacy over state‐of‐the‐art schemes in respect of load‐balanced cluster formation, improved network lifetime, network resource utilization, and network throughput. The proposed scheme ensures up to 57.69%, 33.16%, and 57.74% gains in network lifetime, energy utilization, and data packet delivery under varying network configurations. Besides providing the quantitative analysis, a detailed statistical analysis has also been performed that describes the acceptability of the proposed scheme under different network configurations.