Fuzzy C-means Algorithm Research Articles

Dynamic Modeling Framework Based on Automatic Identification of Operating Conditions for Sintering Carbon Consumption Prediction

In iron and steel industry, sintering process requires huge carbon consumption. Achieving accurate and dynamic prediction of carbon consumption in this process is of evident significance to protect the environment and raise the economic efficiency of iron and steel industry. This paper develops an original dynamic modeling framework including automatic identification of operating conditions, modeling in different conditions, and dynamic prediction model of sintering carbon consumption. Firstly, an automatic kernel-based fuzzy C-means algorithm is presented for automatic identification of operating conditions. Dynamic relationships between the inputs and output of the model are analyzed by Copula Entropy, and then the relevant production data in each operating condition are determined by just-in-time learning method. Next, broad learning models are established under different operating conditions. Further, dynamic prediction model of sintering carbon consumption is designed, and the prediction error is adopted to quantify performance of the model and as one criteria to determine the update of production database. Finally, results of experiments using actual production data demonstrate the advantage and validity of the developed model compared with some advanced modeling methods. The developed model considers complex characteristics of the sintering process and presents a better dynamic performance and information mining performance.

Implementasi Algoritma Fuzzy C-Means untuk Pengelompokkan Provinsi di Indonesia Berdasarkan Kualitas Perguruan Tinggi

The education system in Indonesia is very large and complex with low quality. The quality of Indonesian education can improve, one way is by having equal distribution of education in every province in Indonesia. This equality can be one solution to improve the quality of graduates in Indonesia. This equality can be done by grouping Indonesian provinces with low quality education. One grouping method that can be used is the Fuzzy C-Means algorithm, which is a clustering technique that is determined by the degree of membership in each data point in one cluster. The grouping process was carried out using 136 data on Higher Education Gross Enrollment Rates in 34 provinces from 2019-2022. The data was processed using the Fuzzy C-Means algorithm and then a search for optimal clusters was carried out using the help of the Partition Coefficient Index. Based on testing from 2 to 10 clusters, the optimum cluster is 2 clusters, with a Partition Coefficinet Index value of 0.83491. In the optimum cluster, we get cluster 1 with 20 provinces and cluster 2 with 14 provincial groups. Characteristics resulting from data from 2019 to 2022, cluster 1 has provincial members with the lowest higher education APK compared to cluster 2, especially in cluster 1 members, namely Kep province. Bangka Belitung which has the lowest higher education APK is 2019 with 14.27 APK, 2020 with 14.73 APK, 2021 with 15.23 APK, 2022 14.85 APK.

A bi-layer optimization method of the grid-connected microgrid based on the multi-strategy of the beluga whale algorithm

Endeavoring to enhance the penetration rate of renewable energy sources, concurrently ensuring economic and operational stability, this study proposes a novel bi-layer optimization method of the wind–solar-storage AC/DC microgrid (MG). First, by incorporating a superordinate electric and seasonal hydrogen hybrid energy storage system (E&SHESS), the topology structure of the microgrid is established. Subsequently, to rectify the intrinsic limitations of the conventional beluga whale optimization (BWO) algorithm, this paper proposes a multi-strategy hybrid improvement to BWO (MHIBWO). This innovative improvement integrates an MTent strategy, a step size adjustment mechanism, and a crisscross strategy. Then, constructing a bi-layer iterative model based on the topology, annual net income and grid-connected friendliness are introduced as optimization objectives for the outer and inner layers, respectively, utilizing MHIBWO and CPLEX for resolution. Through a nested iteration of the two layers, the model outputs the capacity scheme with the best performance of economy and stability. Finally, the simulation unequivocally demonstrated the superiority of MHIBWO and the model proposed. In addition, based on the real data of the Elia power station, the validity of the method in operation is tested using the fuzzy C-means algorithm (FCMA) to extract and aggregate typical days, thereby presenting a sophisticated solution for the field of microgrids optimization configuration.

Low-Voltage Distribution Network Loss-Reduction Method Based on Load-Timing Characteristics and Adjustment Capabilities

The primary contributors to elevated line losses in low-voltage distribution networks are three-phase load imbalances and variations in load peak–valley differentials. The conventional manual phase sequence adjustment fails to capitalize on the temporal characteristics of the load, and the proliferation of smart homes has opened up new scheduling possibilities for managing the load. Consequently, this paper introduces a loss-reduction method for low-voltage distribution networks that leverages load-timing characteristics and adjustment capabilities. This method combines dynamic and static methods to reduce energy consumption from different time scales. To commence, this paper introduced a hierarchical fuzzy C-means algorithm (H-FCM), taking into account the distance and similarity of load curves. Subsequently, a phase sequence adjustment method, grounded in load-timing characteristics, was developed. The typical user load curve, derived from the classification of user loads, serves as the foundation for constructing a long-term commutation model, therefore mitigating the impact of load fluctuations on artificial commutation. Following this, this paper addressed the interruptible and transferable characteristics of various smart homes. This paper proposed a multi-objective transferable load (TL) optimal timing task adjustment model and a peak-shaving control strategy specifically designed for maximum sustainable power reduction of temperature-controlled loads (TCL). These strategies aim to achieve real-time load adjustment, correct static commutation errors, and reduce peak-to-valley differences. Finally, a simulation verification model was established in MATLAB (R2022a). The results show that the proposed method mainly solves the problems of three-phase imbalance and large load peak–valley difference in low-voltage distribution networks and reduces the line loss of low-voltage distribution networks through manual commutation and load adjustment.

Comparison of K-Means and Fuzzy C-Means Algorithms for Clustering Based on Happiness Index Components Across Provinces in Indonesia

Cluster analysis is a multivariate technique aimed at grouping objects into several clusters based on the characteristics they possess. This study aims to determine the clustering results of 34 provinces in Indonesia based on the indicators of the happiness index for the year 2021 by comparing non-hierarchical cluster analysis methods, namely K-Means and Fuzzy C-Means. K-Means is a non-hierarchical cluster analysis that divides objects into cluster groups based on the distance of objects to the nearest cluster center, while Fuzzy C-Means is a cluster analysis that uses a fuzzy grouping model where data becomes a member of a cluster formed based on membership degrees ranging from 0 to 1. Based on the research results, it is known that clustering with both K-Means and Fuzzy C-Means methods forms three clusters. Based on the standard deviation values between groups and the standard deviation ratio, the best method is the Fuzzy C-Means method because it has a larger standard deviation between groups and a smaller ratio compared to the K-Means method, which is 0.6680004. Therefore, this study concludes that the Fuzzy C-Means method is more optimal than the K-Means method.

Exploring Pattern Mining with FCM Algorithm for Predicting Female Athlete Behaviour in Sports Analytics

In the changing field of sports analytics, examining and predicting athlete behaviour is crucial for improving performance and reaching the best results. As data analysis becomes more important in sports, using pattern mining methods is critical to discovering meaningful patterns and trends in the large datasets used in sports analysis. This study proposes a Performance Optimization Framework for Female Athletes (POFFA) that explores the field of sports analytics to examine how pattern mining methods, explicitly using the Flexible Fuzzy C-Means (FFCM) algorithm, can help predict female athlete behaviour. This study aims to offer detailed insights into behavioural patterns that can help improve coaching techniques, training schedules, and performance improvement procedures by concentrating on female athletes. The study intends to provide a deep understanding of female athlete behaviour and game dynamics using the FCM approach, known for its effectiveness in dealing with complex, sparse, multi-objective optimization difficulties. The results of this study can enhance the field of sports analysis by providing detailed insights into the behavioural patterns displayed by female players in many sports categories. By combining pattern mining methods with the FCM algorithm, this study introduces a thorough process for examining and predicting athlete behaviour in sports analytics. In the end, the results of this study have practical significance for coaches, trainers, and sports professionals, offering helpful advice for improving the performance of female athletes in competitive sports settings. By using data-driven insights from pattern mining analyses, individuals in the sports business can improve their plans and interventions to enhance female athletes' athletic potential and overall performance results.

Risk-Quantification Method for Car-Following Behavior Considering Driving-Style Propensity

To systematically study the influence of a propensity for a particular driving style on car-following risk, a safety potential field risk-quantification method that considers driving style is proposed. First, we classify driving behaviors and construct a field-based safety potential car-following model via analogy with intermolecular interactions; second, we establish a risk-quantification model by considering driving style, risk exposure, and risk severity and classify the consequent risk into four levels, high risk, medium risk, low risk, and safe, using the fuzzy C-means algorithm. Finally, we predict the car-following risk using the LightGBM algorithm in real time. The experimental results show that the LightGBM algorithm can recognize up to 86% of medium–high risk levels compared to the Decision Tree and Random Forest Algorithms. It can achieve effective prediction of car-following risk, which provides sufficient warning information to drivers and helps improve the overall safety of vehicle operation.

Optimization of artificial intelligence cloud computing in information management design

In order to promote the construction of enterprise informatization, the author studied the adaptive optimization method of Efficient Management Information System (EMIS). The author proposes to combine the fuzzy C-means algorithm to form a server clustering algorithm, and adds an improved Drosophila optimization algorithm to overcome the problems of slow Rate of convergence of GRNN and easy to fall into the minimum, and the cloud platform collects 23 performance indicators, the output results of the coordinated evolutionary algorithm are analyzed by the neighborhood rough set analysis of algorithms to select features to avoid the curse of dimensionality problem. The experimental results indicate that, compared with existing research results, the algorithm proposed by the author has increased its speed by 1.43, 3.22, and 3.72 times, respectively; In terms of convergence steps, they have also been reduced by 1.61, 5, and 6 times respectively, and when running the algorithm, the computer’s memory and CPU usage are controlled at around 50%, without affecting normal functionality. This proves that the task scheduling of the cloud platform is more balanced, and indirectly proves the accuracy of the algorithm’s clustering effect.

Analysis of Urban Congestion Traceability: The Role of the Built Environment

Analyzing the factors influencing traffic congestion is essential for urban planning and coordinated development. Previous research frequently focuses on the internal aspects of traffic systems, often overlooking the impact of external factors on congestion sources. Therefore, this study utilizes a geospatial dataset and mobile signaling data, firstly applying the Fuzzy C-Means (FCM) algorithm to identify congested roads of different levels and trace the localization of travelers’ origins on regional congested roads. Furthermore, it employs the LightGBM method to study the influence of the built environment of various congestion sources on network-level congestion. The findings are as follows: (1) There is a positive correlation between traffic congestion and geographical location, with congestion predominantly caused by a few specific plots and demonstrating a concentrated trend in city centers. (2) Residential population density is the most critical factor, accounting for over 12% of the congestion contribution, followed by road density and working population density. (3) Both residential and working population densities show a non-linear positive correlation with congestion contribution, while the mixture of land use displays a non-linear V-shaped influence. Additionally, when residential population density is between 8000 and 11,000, it notably exacerbates congestion contribution. Significantly, by emphasizing land use considerations in traffic system analysis, these findings illuminate the intricate linkages between urban planning and traffic congestion, advocating for a more comprehensive approach to urban development strategies.

Fuzzy Clustering-Based Grouping for Mapping the Distribution of Student Success Data

Learning activities are the main activity in the overall teaching and learning process in schools. This is because whether or not the achievement of educational goals depends on how the learning process is carried out by students. The uneven level of student success in learning is one of the problems in the school's efforts to realize the vision and mission of SMKN 5 Pekanbaru in preparing skilled graduates to be able to work in certain sectors by the public interest and the industrial world. In this study, mapping and grouping student grade data was carried out using the Fuzzy C-Means algorithm to provide information to the school in making the right decisions and optimizing the learning process. Furthermore, clustering was carried out in several experiments K=3 to K=7, and obtained the best validity value tested with the Silhouette Index of 0.4277 located at K=5. Then the distribution of cluster 5 on student score data was obtained with details, namely cluster 1 with a capacity of 1 student, cluster 2 with a capacity of 27 students, cluster 3 with a capacity of 1 student, cluster 4 with a capacity of 10 students, cluster 5 with a capacity of 23 students.

Detecting IoT Anomalies Using Fuzzy Subspace Clustering Algorithms

There are many applications of anomaly detection in the Internet of Things domain. IoT technology consists of a large number of interconnecting digital devices not only generating huge data continuously but also making real-time computations. Since IoT devices are highly exposed due to the Internet, they frequently meet with the challenges of illegitimate access in the form of intrusions, anomalies, fraud, etc. Identifying these illegitimate accesses can be an exciting research problem. In numerous applications, either fuzzy clustering or rough set theory or both have been successfully employed. As the data generated in IoT domains are high-dimensional, the clustering methods used for lower-dimensional data cannot be efficiently applied. Also, very few methods were proposed for such applications until today with limited efficacies. So, there is a need to address the problem. In this article, mixed approaches consisting of nano topology and fuzzy clustering techniques have been proposed for anomaly detection in the IoT domain. The methods first use nano topology of rough set theory to generate CORE as a subspace and then employ a couple of well-known fuzzy clustering techniques on it for the detection of anomalies. As the anomalies are detected in the lower dimensional space, and fuzzy clustering algorithms are involved in the methods, the performances of the proposed approaches improve comparatively. The effectiveness of the methods is evaluated using time-complexity analysis and experimental studies with a synthetic dataset and a real-life dataset. Experimentally, it has been found that the proposed approaches outperform the traditional fuzzy clustering algorithms in terms of detection rates, accuracy rates, false alarm rates and computation times. Furthermore, nano topological and common Mahalanobis distance-based fuzzy c-means algorithm (NT-CM-FCM) is the best among all traditional or nano topology-based algorithms, as it has accuracy rates of 84.02% and 83.21%, detection rates of 80.54% and 75.37%, and false alarm rates of 7.89% and 9.09% with the KDDCup’99 dataset and Kitsune Network Attack Dataset, respectively.

A Hybrid of Fuzzy C-Means for the segmentation in CT scan and X-ray images for screening the COVID-19 patients

In this paper, using CT scan and X-ray images, we present a hybrid approach, based on combining fuzzy C-means with k-means clustering, to evaluate and determine pneumonia infection caused by the coronavirus disease (COVID-19). To achieve this objective, we introduce a hybrid method that combines fuzzy C-means clustering with K-means clustering. This hybrid approach is designed to effectively segment object boundaries within medical images, enabling the precise identification of pneumonia-related features. In addition to our hybrid method, we compare its performance with two other segmentation approaches: the Expectation Maximization (EM) algorithm and 2D Entropy segmentation. Which, the method we propose uses a comparison between the performances of the based on a database of medical imaging test. Experimental results showed that the proposed approach outperforms, it was found that the hybrid fuzzy C-means algorithm segmentation images methods give better performance in terms of accuracy, precision, and F-measure, which is effective in boundaries segmentation. Comparative results of the accuracy and image quality index demonstrate the robustness of AI. It also helps to improve work efficiency with accurate analysis of COVID-19 infection on CT scan and X-rays. In addition, the approach helps radiologists make clinical decisions for diagnosis, follow-up, and prognosis.

Performance of ML-Based Unsupervised Clustering Algorithms for WSN Node Clustering

Abstract: Wireless Sensor Networks are generally deployed in dynamically changing environment. When compared to common wired network nodes, WSN nodes must do more work. Since WSN devices are battery powered, so power management is a challenge. Clustering is one solution that has been proposed to alleviate the issue of limited power. Clustering is the most important method stabilizes the lifetime of the network. It entails the aggregation of sensor nodes into clusters and cluster head is picked out from all the clusters. Clustering is implemented in wireless sensor networks through the Machine Learning techniques. In wireless sensor networks, machine learning algorithms have an important role in cluster head formation and maintain the stability of the nodes in the cluster. Machine Learning approaches used in wireless sensor networks can be classified as Supervised learning, Unsupervised learning, and Reinforcement learning. Among these learning techniques, unsupervised learning deals with different clustering algorithms such as k-means, K-medoids, Fuzzy C-means, hierarichalbased, and SOM. This paper evaluates the performance of the variants of k-Means (kM) and Fuzzy C-means (FCM) algorithms in terms of the clustering and accuracy. This paper imparts performance analysis of different clustering algorithms in machine learning applied for wireless sensor networks. From the analysis, the Fuzzy C-Means algorithm found to be more suitable for node clustering in WSN

Fuzzy C-Means clustering for physical model calibration and 7-day, 10-year low flow estimation in ungaged basins: comparisons to traditional, statistical estimates

In the northeast U.S., resource managers commonly apply 7-day, 10-year (7Q10) low flow estimates for protecting aquatic species in streams. In this paper, the efficacy of process-based hydrologic models is evaluated for estimating 7Q10s compared to the United States Geological Survey's (USGS) widely applied web-application StreamStats, which uses traditional statistical regression equations for estimating extreme flows. To generate the process-based estimates, the USGS's National Hydrologic Modeling (NHM-PRMS) framework (which relies on traditional rainfall-runoff modeling) is applied with 36 years of forcings from the Daymet climate dataset to a representative sample of ninety-four unimpaired gages in the Northeast and Mid-Atlantic U.S. The rainfall-runoff models are calibrated to the measured streamflow at each gage using the recommended NHM-PRMS calibration procedure and evaluated using Kling-Gupta Efficiency (KGE) for daily streamflow estimation. To evaluate the 7Q10 estimates made by the rainfall-runoff models compared to StreamStats, a multitude of error metrics are applied, including median relative bias (cfs/cfs), Root Mean Square Error (RMSE) (cfs), Relative RMSE (RRMSE) (cfs/cfs), and Unit-Area RMSE (UA-RMSE) (cfs/mi2). The calibrated rainfall-runoff models display both improved daily streamflow estimation (median KGE improving from 0.30 to 0.52) and 7Q10 estimation (smaller median relative bias, RMSE, RRMSE, and UA-RMSE, especially for basins larger than 100 mi2). The success of calibration is extended to ungaged locations using the machine learning algorithm Fuzzy C-Means (FCM) clustering, finding that traditional K-Means clustering (FCM clustering with no fuzzification factor) is the preferred method for model regionalization based on (1) Silhouette Analysis, (2) daily streamflow KGE, and (3) 7Q10 error metrics. The optimal rainfall-runoff models created with clustering show improvement for daily streamflow estimation (a median KGE of 0.48, only slightly below that of the calibrated models at 0.52); however, these models display similar error metrics for 7Q10 estimation compared to the uncalibrated models, neither of which provide improved error compared to the statistical estimates. Results suggest that the rainfall-runoff models calibrated to measured streamflow data provide the best 7Q10 estimation in terms of all error metrics except median relative bias, but for all models applicable to ungaged locations, the statistical estimates from StreamStats display the lowest error metrics in every category.

Fuzzy Evolutionary Algorithm in Construction Project for Valuation

Clustering algorithms has emerged as an important data mining technique for pattern recognition, data analysis and dimensionality reduction. Clustering is usually used in all fields to merge the same feature objects into a single group. The clustering method is incorporated with search algorithms to search the dataset from the databases. For large databases, there is a need of good clustering algorithm with high accuracy. Despite its high performance, the existing methods show some limitations. This paper focused on optimize the clustering method with a search structure for large multidimensional databases with dynamic indexes for the effective validation of construction projects. In the construction project validation to improve the clustering methods using Evolutionary Constrained Differential Optimization (ECDO) and Distributed Weighted Fuzzy C-Means algorithm to improve clustering performance than the centralized clustering approaches. The proposed methodology includes ECDO which presents new cluster tree indexing approach with cluster speed improvement in the validation of the construction projects. Distributed Fuzzy Possibilistic C-Means algorithm is proposed in improvement of cluster centre to overcome coincidence cluster problems. The comparative analysis stated that proposed ECDO model exhibits ~6% reduced memory utilization ~11% reduced scalability and ~8% minimized selectivity than the conventional WPCM model.

Retracted: False Financial Statement Identification Based on Fuzzy C-Means Algorithm

Retracted: False Financial Statement Identification Based on Fuzzy C-Means Algorithm

Simulation-Enhanced MQAM Modulation Identification in Communication Systems: A Subtractive Clustering-Based PSO-FCM Algorithm Study

Signal modulation recognition is often reliant on clustering algorithms. The fuzzy c-means (FCM) algorithm, which is commonly used for such tasks, often converges to local optima. This presents a challenge, particularly in low-signal-to-noise-ratio (SNR) environments. We propose an enhanced FCM algorithm that incorporates particle swarm optimization (PSO) to improve the accuracy of recognizing M-ary quadrature amplitude modulation (MQAM) signal orders. The process is a two-step clustering process. First, the constellation diagram of the received signal is used by a subtractive clustering algorithm based on SNR to figure out the initial number of clustering centers. The PSO-FCM algorithm then refines these centers to improve precision. Accurate signal classification and identification are achieved by evaluating the relative sizes of the radii around the cluster centers within the MQAM constellation diagram and determining the modulation order. The results indicate that the SC-based PSO-FCM algorithm outperforms the conventional FCM in clustering effectiveness, notably enhancing modulation recognition rates in low-SNR conditions, when evaluated against a variety of QAM signals ranging from 4QAM to 64QAM.

Parameter selection of suppressed relative entropy fuzzy c-means clustering algorithm

The relative entropy fuzzy c-means (REFCM) clustering algorithm improves the robustness of the fuzzy c-means (FCM) algorithm against noise. However, its increased complexity results in slower convergence. To address this issue, we have proposed a suppressed REFCM (SREFCM) algorithm, in which a constant suppression rate, α, is selected. However, in cases where external factors, such as changes in the data structure, are present, relying on a fixed α value may result in a decline in algorithm performance, which is clearly unsuitable. Therefore, the adaptive selection of parameters is a critical step. Based on the data structure itself, this paper proposes an algorithm for adaptive parameter selection utilizing partition entropy coefficient and alternating modified partition coefficient, and compares it to six parameter selection algorithms based on generalized rules: θ′ type, ρ type, β type, τ type, σ type and ξ type. Empirical findings indicate that adapting parameters can enhance the partitioning capability of the algorithm while ensuring a rapid convergence rate.

Optimizing the Probabilistic Neural Network Model with the Improved Manta Ray Foraging Optimization Algorithm to Identify Pressure Fluctuation Signal Features.

To improve the identification accuracy of pressure fluctuation signals in the draft tube of hydraulic turbines, this study proposes an improved manta ray foraging optimization (ITMRFO) algorithm to optimize the identification method of a probabilistic neural network (PNN). Specifically, first, discrete wavelet transform was used to extract features from vibration signals, and then, fuzzy c-means algorithm (FCM) clustering was used to automatically classify the collected information. In order to solve the local optimization problem of the manta ray foraging optimization (MRFO) algorithm, four optimization strategies were proposed. These included optimizing the initial population of the MRFO algorithm based on the elite opposition learning algorithm and using adaptive t distribution to replace its chain factor to optimize individual update strategies and other improvement strategies. The ITMRFO algorithm was compared with three algorithms on 23 test functions to verify its superiority. In order to improve the classification accuracy of the probabilistic neural network (PNN) affected by smoothing factors, an improved manta ray foraging optimization (ITMRFO) algorithm was used to optimize them. An ITMRFO-PNN model was established and compared with the PNN and MRFO-PNN models to evaluate their performance in identifying pressure fluctuation signals in turbine draft tubes. The evaluation indicators include confusion matrix, accuracy, precision, recall rate, F1-score, and accuracy and error rate. The experimental results confirm the correctness and effectiveness of the ITMRFO-PNN model, providing a solid theoretical foundation for identifying pressure fluctuation signals in hydraulic turbine draft tubes.

Adaptive fuzzy weighted C-mean image segmentation algorithm combining a new distance metric and prior entropy

The fuzzy C-mean clustering algorithm (FCM) is effective in image segmentation. However, its sensitivity to initialization settings and the limitation of the Euclidean distance metric in measuring similarity lead to unsatisfactory image segmentation. To overcome these shortcomings, we propose an adaptive fuzzy weighted C-mean image segmentation algorithm that combines a new distance metric and prior entropy. This algorithm significantly contributes in three aspects. First, we employ an improved sparse subspace clustering (SSC) algorithm based on the superpixel image for initialization settings. This step aims to obtain the initial number of clusters and the membership matrix, ensuring the algorithm’s convergence to the optimal solution. Second, to better capture differences between image regions, we introduce a novel distance metric that combines Euclidean and non-Euclidean distances. Simultaneously, the fuzzy weight is introduced to mitigate redundant feature interference, making the clustering result more reasonable. Finally, leveraging prior entropy – a maximum entropy under conditional constraints – we refine the algorithm’s adaptability to unknown features, thereby improving clustering accuracy. Comparative experiments with several state-of-the-art algorithms validate the effectiveness and robustness of our proposed algorithm.