C-means Clustering Research Articles

A Fuzzy Fusion Method for Multi-Ship Collision Avoidance Decision-Making with Merchant and Fishing Vessels

In multi-vessel collision avoidance decision-making, the collision between merchant and fishing vessels is a significant challenge. This paper proposes a fuzzy fusion method for making avoidance decisions under the influence of the navigation environment. First, C-means clustering was used to collect and analyze Automatic Identification System (AIS) data from fishing vessels. On this basis, the environment collision risk was determined using fuzzy reasoning. Second, the basic collision risk is obtained by calculating the DCPA and TCPA, and the integrated Collision Risk Index (CRI) is concluded by fuzzy logic through basic collision risk and the environment collision risk. The similar cases are extracted from the fuzzy case database, and collision avoidance decisions for merchant vessels are formulated following fuzzy adjustments. Finally, to validate the method, data from Chengshantou coastal waters is employed for verification. The results show that it can provide theoretical guidance and practical value for merchant vessels in making collision avoidance decisions.

Development of Statistical Downscaling Model Based on Volterra Series Realization, Principal Components, Climate Classification, and Ridge Regression

This paper applied the fuzzy function approach, combined with the ridge regression model, to produce daily rainfall projections from large-scale climate variables. This study developed a statistical downscaling model based on principal components, c-means fuzzy clustering, Volterra series, and ridge regression. The model is known, hereafter as SDC2R2. In the developed downscaling model, the use of ridge regression, instead of multiple linear regression, is proposed to downscale daily rainfall with wide range (WR) predictors. The WR predictors were applied to sufficiently incorporate climate change signals. The developed model also captured the non-linear interactions of the climate variables by applying the transformation of Volterra series realization over WR predictors. This transformation was performed by applying principal components as orthogonal filters. Further, these principal components were clustered by using c-means clustering and non-linear transformations were applied on these membership functions, to improve the prediction ability of the model. The reanalysis of climate data from the National Centres for Environmental Prediction (NCEP) was used to develop the model and was validated by using the Global Climate Model (GCM) for four locations in the Manawatu River basin. The developed model was used to obtain future daily rainfall projections from three Representative Concentrative Pathways (RCP 2.6, RCP 4.5, and RCP 8.5) scenarios from the Canadian Earth System Model (CanESM2) GCM. The performance of the model was compared with a widely used statistical downscaling model (SDSM). It was observed that the model performed better than SDSM in downscaling rainfall on a daily basis. Every scenario indicated that there is a probability of obtaining high future rainfall frequency. The results of this study provide valuable information for decision-makers since climate change may potentially impact the Manawatu basin.

Argo data anomaly detection algorithm based on selective ensemble of fuzzy clustering

Abstract Argo profiling float data is a crucial data source for fundamental research and predictive forecasting operations in oceanography and environmental science. However, compiling and organizing such datasets demands considerable time and human resources. Therefore, the quest for effective methods of detecting anomalies in Argo data is of paramount importance. In this regard, we propose three improvement strategies within the stacking ensemble framework: preserving the original training set, weighting base model outputs, and combining the two former methods. The aim is to explore implicit relationships within the data, enhance model prediction diversity, and improve Accuracy. Additionally, in the selection of base models, to address the challenge of conventional clustering-based ensemble algorithms in achieving high levels of both diversity and accuracy among base learners, we introduce a selective ensemble method based on C-means clustering. This method selects base learners for the ensemble based on weighted scores derived from membership and performance evaluation metrics. Both of these enhancement approaches demonstrate effective application and improved detection performance when applied to Argo data.

Mapping Domestic and Foreign Tourists in East Java Using C-Means Clustering

Mapping Domestic and Foreign Tourists in East Java Using C-Means Clustering

Full-parameter adaptive fuzzy clustering for noise image segmentation based on non-local and local spatial information

The fuzzy clustering C-means (FCM) algorithm is a compelling image segmentation method in image segmentation. However, the algorithm is less robust for images containing noise. This paper proposes a non-local full-parameter adaptive spatial information combined with a local fuzzy factor for noisy image segmentation. Firstly, we realize the adaptive calculation of the smoothing parameter, search term window, and neighborhood window in the non-local spatial information by defining the smoothness and designing the adaptive matching function. Secondly, the image’s non-local and local spatial information is considered comprehensively to reduce noise interference and segmentation ambiguity. Finally, the weighted average membership linking is used as the denominator of the objective function to reduce the number of iterations. The results in synthetic noise image and color image segmentation experiments show that the proposed algorithm has outstanding performance in various evaluation metrics and visual effects, outperforming most other variants of fuzzy clustering-based algorithms.

A MODEL FOR MULTI-LAYER DYNAMIC SOCIAL NETWORKS TO DISCOVER INFLUENTIAL GROUPS BASED ON A COMBINATION OF META-HEURISTIC ALGORITHM AND C-MEANS CLUSTERING

Science and technology are proliferating, and complex networks have become a necessity in our daily life, so separating people from complex networks built on the fundamental needs of human life is almost impossible. This research presented a multi-layer dynamic social networks model to discover influential groups based on a developing frog-leaping algorithm and C-means clustering. We collected the data in the first step. Then, we conducted data cleansing and normalization to identify influential individuals and groups using the optimal data by forming a decision matrix. Hence, we used the matrix to identify and cluster (based on phase clustering) and determined each group’s importance. The frog-leaping algorithm was used to improve the identification of influence parameters, which led to improvement in node’s importance, to discover influential individuals and groups in social networks, In the measurement and simulation of clustering section, the proposed method was contrasted against the K-means method, and its equilibrium value in cluster selection resulted from 5. The proposed method presented a more genuine improvement compared to the other methods. However, measuring precision indicators for the proposed method had a 3.3 improvement compared to similar methods and a 3.8 improvement compared to the M-ALCD primary method.

Incremental Fuzzy Clustering Based on Feature Reduction

In the era of big data, more and more datasets are gradually beyond the application scope of traditional clustering algorithms because of their large scale and high dimensions. In order to break through the limitations, incremental mechanism and feature reduction have become two indispensable parts of current clustering algorithms. Combined with single-pass and online incremental strategies, respectively, we propose two incremental fuzzy clustering algorithms based on feature reduction. The first uses the Weighted Feature Reduction Fuzzy C-Means (WFRFCM) clustering algorithm to process each chunk in turn and combines the clustering results of the previous chunk into the latter chunk for common calculation. The second uses the WFRFCM algorithm for each chunk to cluster at the same time, and the clustering results of each chunk are combined and calculated again. In order to investigate the clustering performance of these two algorithms, six datasets were selected for comparative experiments. Experimental results showed that these two algorithms could select high-quality features based on feature reduction and process large-scale data by introducing the incremental strategy. The combination of the two phases can not only ensure the clustering efficiency but also keep higher clustering accuracy.

Which Features Are More Correlated to Illuminant Estimation: A Composite Substitute

Computational color constancy (CCC) is to endow computers or cameras with the capability to remove the color bias effect caused by different scene illuminations. The first procedure of CCC is illuminant estimation, i.e., to calculate the illuminant color for a given image scene. Recently, some methods directly mapping image features to illuminant estimation provide an effective and robust solution for this issue. Nevertheless, due to diverse image features, it is uncertain to select which features to model illuminant color. In this research, a series of artificial features weaved into a mapping-based illuminant estimation framework is extensively investigated. This framework employs a multi-model structure and integrates the functions of kernel-based fuzzy c-means (KFCM) clustering, non-negative least square regression (NLSR), and fuzzy weighting. By comparing the resulting performance of different features, the features more correlated to illuminant estimation are found in the candidate feature set. Furthermore, the composite features are designed to achieve the outstanding performances of illuminant estimation. Extensive experiments are performed on typical benchmark datasets and the effectiveness of the proposed method has been validated. The proposed method makes illuminant estimation an explicit transformation of suitable image features with regressed and fuzzy weights, which has significant potential for both competing performances and fast implementation against state-of-the-art methods.

Bank Failure Analysis Based on BP Neural Network and C-Means Clustering

Banks are an important financial support for national economic development. It can adjust the market economy, adjust the industrial structure, raise funds for national construction, and provide loans to enterprises and individuals who are short of funds. With the downward pressure of economic pressure, some banks' liabilities are higher than assets. With the accumulation of time, liabilities cannot be repaid, and finally they can only end up in bankruptcy. Compared with domestic banks, the phenomenon of international bank bankruptcy is more serious. In order to reduce the occurrence of such events, we need to analyze the causes and current situation of bank bankruptcy.

ANFIS soft sensing model of SMB chromatographic separation process based on new adaptive population evolution particle swarm optimization algorithm

Aiming at predicting the purity of the extract and raffinate components in the simulated moving bed (SMB) chromatographic separation process, a soft-sensor modeling method was proposed by adoptig the hybrid learning algorithm based on an improved particle swarm optimization (PSO) algorithm and the least means squares (LMS) method to optimize the adaptive neural fuzzy inference system (ANFIS) parameters. The hybrid learning algorithm includes a premise parameter learning phase and a conclusion parameter learning phase. In the premise parameter learning stage, the input data space division of the SMB chromatographic separation process and the initialization of the premise parameters are realized based on the fuzzy C-means (FCM) clustering algorithm. Then, the improved PSO algorithm is used to calculate the excitation intensity and normalized excitation intensity of all the rules for each individual in the population. In the conclusion parameter learning phase, these linear parameters are identified by the LMS method. In order to improve population diversity and convergence accuracy, the population evolution rate function was defined. According to the relationship between population diversity, population fitness function and particle position change, a new adaptive population evolution particle swarm optimization (NAPEPSO) algorithm was proposed. The inertia weight is adaptively adjusted according to the evolution of the population and the change of the particle position, thereby improving the diversity of the particle swarm and the ability of the algorithm to jump out of the local optimal solution. The simulation results show that the proposed soft-sensor model can effectively predict the key economic and technical indicators of the SMB chromatographic separation process so as to meet the real-time and efficient operation of the SMB chromatographic separation process.

Neural Network: An Improved FCM for Multimodal Cultural Data Analysis

With the development of cloud computing, big data, and artificial intelligence (AI) technology, there is a growing interest in “cultural analysis.” Cultural analysis requires different types of data such as texts, pictures, and videos. The richness and differences of resources in the cultural field lead to diverse modalities of cultural data. Traditional text analysis methods can no longer meet the data analysis needs of current multimedia cultural resources. This article starts from cultural data’s feature information to solve the heterogeneity problem faced by massive multimodal cultural data analysis. It analyzes it from geography, time, art, and thematic character, classified and aggregated to form a multimodal cultural feature information matrix. The corresponding correlation measurement methods for different matrices from the above dimensions are proposed, solved in turn, and substituted into the optimized training back propagation (BP) neural network to obtain the final correlation degree. The improved fuzzy C-means (FCM) clustering algorithm is used to aggregate the high correlation cultural data based on the degree. The algorithm proposed in this study is compared with the existing algorithm. The experimental results show that the optimized BP neural network is at least 58% more accurate than the current method for calculating different matrices’ correlation degrees. In terms of accuracy, the improved fuzzy C-means algorithm effectively reduces the random interference in the selection of the initial clustering center, which is significantly higher than other clustering algorithms.

Landslide susceptibility mapping with the fusion of multi-feature SVM model based FCM sampling strategy: A case study from Shaanxi Province

ABSTRACT The quality of “non-landslide’ samples data impacts the accuracy of geological hazard risk assessment. This research proposed a method to improve the performance of support vector machine (SVM) by perfecting the quality of ‘non-landslide’ samples in the landslide susceptibility evaluation model through fuzzy c-means (FCM) cluster to generate more reliable susceptibility maps. Firstly, three sample selection scenarios for ‘non-landslide’ samples include the following principles: 1) select randomly from low-slope areas (scenario-SS), 2) select randomly from areas with no hazards (scenario-RS), 3) obtain samples from the optimal FCM model (scenario-FCM), and then three sample scenarios are constructed with 10,193 landslide positive samples. Next, we have compared and evaluated the performance of three sample scenarios in the SVM models based on the statistical indicators such as the proportion of disaster points, density of disaster points precision, receiver operating characteristic (ROC) curve, and area under the ROC curve (AUC). Finally, The evaluation results show that the ‘non-landslide’ negative samples based on the FCM model are more reasonable. Furthermore, the hybrid method supported by SVM and FCM models exhibits the highest prediction efficiency. Scenario FCM produces an overall accuracy of approximately 89.7% (AUC), followed by scenario-SS (86.7%) and scenario-RS (85.6%).

An Investigation of Takagi-Sugeno Fuzzy Modeling for Spatial Prediction with Sparsely Distributed Geospatial Data

Fuzzy set theory has shown potential for reducing uncertainty as a result of data sparsity and also provides advantages for quantifying gradational changes like those of pollutant concentrations through fuzzy clustering based approaches. The ability to lower the sampling frequency and perform laboratory analyses on fewer samples, yet still produce an adequate pollutant distribution map, would reduce the initial cost of new remediation projects. To assess the ability of fuzzy modeling to make spatial predictions using fewer sample points, its predictive ability was compared with the ordinary kriging (OK) and inverse distance weighting (IDW) methods under increasingly sparse data conditions. This research used a Takagi–Sugeno (TS) fuzzy modelling approach with fuzzy c-means (FCM) clustering to make spatial predictions of the lead concentrations in soil. The performance of the TS model was very dependent on the number of outliers in the respective validation set. For modeling under sparse data conditions, the TS fuzzy modeling approach using FCM clustering and constant width Gaussian shaped membership functions did not show any advantages over IDW and OK for the type of data tested. Therefore, it was not possible to speculate on a possible reduction in sampling frequency for delineating the extent of contamination for new remediation projects.

Segmentation of Intracerebral Hemorrhage based on Improved U-Net

Abstract Automatic medical image segmentation effectively aids in stroke diagnosis and treatment. In this article, an improved U-Net neural network for auxiliary diagnosis of intracerebral hemorrhage is proposed, which can realize the automatic segmentation of hemorrhage from brain CT images. The pixels of brain CT images are first clustered into four classes: gray matter, white matter, cerebrospinal fluid, and hemorrhage by fuzzy c-means (FCM) clustering, followed by the removal of the skull by morphological imaging, and finally an improved U-Net neural network model is proposed to automatically segment hemorrhages from the brain CT images. Experiment results showed that the objective function of binary cross-entropy was better than dice loss and focal loss for the proposed method. Its dice similarity coefficient reached 0.860 ± 0.031, which was better than the methods of white matter FCM clustering and multipath context generation adversarial networking. This improved method dramatically enhanced the accuracy of segmentation for intracerebral hemorrhage.

Change detection in remote sensing images based on manifold regularized joint non-negative matrix factorization

A novel and effective change detection method based on manifold regularized joint non-negative matrix factorization (MJNMF) framework is proposed in this paper, which detects the changes that occurred in multi-temporal remote sensing images. Most change detection methods, including dictionary learning, principal component analysis (PCA), etc., do not consider the non-negativity among image pixels. However, image itself is a non-negative signal, and the non-negative constraint has better interpretability in practical applications. Nonnegative Matrix Factorization, which incorporates the non-negativity constraint and thus learns object parts, obtains the parts-based representation as well as enhancing the interpretability of the issue correspondingly. In this paper, our proposed approach based on MJNMF framework aims to establish a pair of joint basis matrices by unchanged training samples from unchanged area. Then, unchanged pixels can be well reconstructed by the corresponding basis matrix, while changed pixels cannot be reconstructed from the basis matrix corresponding to the knowledge of unchanged samples, or a larger reconstruction error can be generated even if changed pixels are reconfigurable. In order to suppress similar information and highlight different information, the cross-reconstruction error is used to generate the difference image. Finally, the binary image is obtained by the robust fuzzy local information c-means (FLICM) clustering algorithm. In addition, inspired by manifold learning, we incorporate manifold regularization into the proposed method to keep the geometric structure of data and improve the accuracy of change detection. Experimental results obtained on simulated and real remote sensing images confirm the effectiveness of the proposed method.

False Financial Statement Identification Based on Fuzzy C-Means Algorithm

Financial accountants falsify financial statements by means of financial techniques such as financial practices and financial standards, and when compared with conventional financial data, it is found that the falsified financial data often lack correlation or even contradict each other in terms of financial data indicators. At the same time, there are also inherent differences in reporting patterns from conventional financial data, but these differences are difficult to test manually. In this paper, the fuzzy C-means (FCM) clustering method is used to amplify these differences and thus identify false financial statements. In the proposed algorithm, firstly, the normalization constraint of the FCM clustering algorithm on the sum of affiliation of individual samples is relaxed to the constraint on the sum of affiliation of all samples, thus reducing the sensitivity of the algorithm to noise and isolated points; secondly, a new affiliation correction method is proposed to address the problem that the difference in affiliation is too large after the relaxation of the constraint. In the discussion of this paper, most of the information comes from the annual reports of companies, administrative penalty decisions of the Securities Regulatory Commission, and some information comes from research reports made by securities institutions, which are limited sources of information. The proposed method can correct the affiliation to a reasonable range, effectively avoiding the problem that some samples have too much affiliation and become a class of their own and also avoiding the problem that it is difficult to choose the termination threshold of the algorithm iteration due to too little affiliation, and can ensure that the constraint on the sum of affiliation of all samples is always satisfied during the iteration of the algorithm. The method has the characteristics of high recognition accuracy and has the significance of theoretical method innovation.

Separation of magnetotelluric signals based on refined composite multiscale dispersion entropy and orthogonal matching pursuit

Magnetotelluric (MT) data processing can increase the reliability of measured data. Traditional MT data denoising methods are usually applied to entire MT time-series, which results in the loss of useful MT signals and a decrease of imaging accuracy of electromagnetic inversion. However, targeted MT noise separation can retain part of the signal unaffected by strong noise and enhance the quality of MT responses. Thus, we propose a novel method for MT noise separation that uses the refined composite multiscale dispersion entropy (RCMDE) and the orthogonal matching pursuit (OMP) algorithm. First, the RCMDE is extracted from each segment of the MT data. Then, the RCMDEs for each segment are input to the fuzzy c-mean (FCM) clustering algorithm for automatic identification of the MT signal and noise. Next, the OMP method is utilized to remove the identified noise segments independently. Finally, the reconstructed signal consists of the denoised signal segments and the identified useful signal segments. We conducted simulation experiments and algorithm evaluations on electromagnetic transfer function (EMTF) data, simulated data and measured sites. The results indicate that the RCMDE can improve the stability of multiscale dispersion entropy (MDE) and multiscale entropy (ME) by analyzing the characteristics of the signal samples library, effectively distinguishing MT signals and noise. Compared with the existing technique of denoising entire time series, the proposed method uses the RCMDE as characteristic parameter and uses the OMP algorithm for noise separation, simplifies the multi-feature fusion, and improves the accuracy of signal-noise identification. Moreover, the denoising efficiency is accelerated, and the MT response in the low-frequency band is greatly improved.

Estimation of soil organic carbon storage based on digital soil mapping technique.

Accurate spatial distribution information of soil properties would be helpful for improving the accuracy of soil organic carbon storage estimation. In this study, terrain factors were used as predictors, and the fuzzy C-means (FCM) clustering method was used to make digital soil prediction mapping for soil organic carbon content, soil bulk density, soil depth, and soil gravel content in Nanshan forest farm in Jiyuan City of Henan Province. Based on the digital mapping results, the prediction mapping of soil organic carbon density and the estimation of soil organic carbon storage were realized. The results showed that the average soil organic carbon density in the study area based on the digital soil mapping method was 4.24 kg·m-2, the mean error (ME), mean absolute error (MAE) and root mean square error (RMSE) of the prediction map were 0.08, 2.80 and 5.03 kg·m-2, respectively. The accuracy, stability and reliability of the prediction results were higher than the tradiation methods. The soil organic carbon storage in the study area was estimated to be 3.08×108 kg. Based on the digital soil mapping technology, only a small number of soil samples could be used to map and estimate the soil organic carbon density with high accuracy, which could characterize the spatial distribution characteristics of soil organic carbon density. This study provided a new way to estimate soil organic carbon storage, which would help to improve the accuracy and efficiency of soil organic carbon storage estimation.

Fuzzy C-Means based LSED analysis model of single-cell RNA sequencing data for gene expression difference data

Analysis of single-cell RNA sequencing (scRNA-seq) data is often complicate due to the sparsity and high data dimensionality. In this work, we proposed Fuzzy C-means based linear stable-exponential distribution (LSED) model for analyzing scRNA-seq count data of chronic myeloid leukemia (CML) patients. We propose pipelines stages for analysis in which noisy and inconsistent data form sequencing is removed during data preprocessing, this process data then form the cluster of gene feature using fuzzy c-means (FCM) clustering, relevant features are extracted during feature extraction approach. These extracted features are then fed into LSED model in order to difference feature data of gene expression. Finally we evaluate the performance for proposed analysis model based on parameter estimation, distribution comparison and parameter analysis. From the result analysis it was observed that proposed analysis model parameter reflect change in condition of patient more effectively as well as this model fits difference data of gene expression in more better way in comparison to Cauchy and stable distribution. Additional, the results of Gene-set enrichment analysis specify the affinity of proposed model can replicate the distinct enhancement of BCR-ABL+ stem cell as well as BCR-ABL- stem cells. Significantly, proposed FCM based LSED analysis model studies CML from the perspective of statistical models, which present a new sight for CML scientific research.

Parallel FCM clustering algorithm of fuzzy number based on cut set

Aiming at the problem of complex method and low efficiency of fuzzy numbers in classification processing, a parallel Fuzzy CMeans (FCM) clustering method based on cut set is proposed. Firstly, according to the decomposition theorem, the fuzzy numbers are divided horizontally into the form of the union of interval numbers, and then the interval numbers are transformed into the determined “real” data, and the parallel FCM clustering algorithm is used to classify the fuzzy numbers. The theoretical analysis and application show that the method has good classification accuracy and efficiency for fuzzy data clustering.