To effectively optimize Takagi-Sugeno-Kang (TSK) fuzzy systems for regression problems, a mini-batch gradient descent with regularization, DropRule, and AdaBound (MBGD-RDA) algorithm was recently proposed. This paper further proposes FCM-RDpA, which improves MBGD-RDA by replacing the grid partition approach in rule initialization c-means clustering, Powerball AdaBelief, integrates proposed AdaB...

Wujiang River, one of the main branches of the Beijiang River in South China, is frequently suffered from flood disasters. Flood clustering becomes one of the critical sub-issues for realizing the different types of flood features. This paper attempts to put forward a flood clustering approach for flood feature identification which is important to the flood risk management and flood forecasting...

Aiming to solve the problem that photovoltaic power generation is always accompanied by uncertainty and short-term prediction accuracy of (PV) not high, this paper proposes a method for forecasting (PPF) analysis using fuzzy-c-means (FCM), whale optimization algorithm (WOA), bi-directional long memory (BILSTM), no-parametric kernel density estimation (NPKDE). First, principal component (PCA) us...

Fuzzy C-means (FCM) clustering has been widely used successfully in many real-world applications. However, the FCM algorithm is sensitive to the initial prototypes, and it cannot handle non-traditional curved clusters. In this paper, a multi-center fuzzy C-means algorithm based on transitive closure and spectral clustering (MFCM-TCSC) is provided. In this algorithm, the initial guesses of the l...

Fuzzy C-means clustering (FCM) is an important technique used in cluster analysis. The standard FCM algorithm calls the centroids to be randomly initialized resulting in the requirement of making estimations from expert users to determine the number of clusters. To overcome these observed limitations of applying the FCM algorithm, an efficient image segmentation model, Hybrid Fuzzy C-means Algo...

Some of the well-known fuzzy clustering algorithms are based on Euclidean distance function, which can only be used to detect spherical structural clusters. Gustafson-Kessel clustering algorithm and Gath-Geva clustering algorithm were developed to detect non-spherical structural clusters. However, the former needs added constraint of fuzzy covariance matrix, the later can only be used for the d...

Pattern recognition is the science of data structure and its classification. There are many classification and clustering methods prevalent in pattern recognition area. In this research, rainfall data in a region in Northern Iran are classified with natural breaks classification method and with a revised fuzzy c-means (FCM) algorithm as a clustering approach. To compare these two methods, the r...

The weighting exponentm is called the fuzzifier that can influence the performance of fuzzy c-means (FCM). It is generally suggested that mA[1.5,2.5]. On the basis of a robust analysis of FCM, a new guideline for selecting the parameter m is proposed. We will show that a large m value will make FCM more robust to noise and outliers. However, considerably large m values that are greater than the...

Automated brain MR image segmentation is a challenging pattern recognition problem that received significant attention lately. The most popular solutions involve fuzzy c-means (FCM) or similar clustering mechanisms. Several improvements have been made to the standard FCM algorithm, in order to reduce its sensitivity to Gaussian, impulse, and intensity non-uniformity noises. This paper presents ...

Gath–Geva (GG) algorithm is one of the most popular methodologies for fuzzy c-means (FCM)-type clustering of data comprising numeric attributes; it is based on the assumption of data deriving from clusters of Gaussian form, a much more flexible construction compared to the spherical clusters assumption of the original FCM. In this paper, we introduce an extension of the GG algorithm to allow fo...