This paper presents new algorithms (Fuzzy c-Medoids or FCMdd and Robust Fuzzy c-Medoids or RFCMdd) for fuzzy clustering of relational data. The objective functions are based on selecting c representative objects (medoids) from the data set in such a way that the total fuzzy dissimilarity within each cluster is minimized. A comparison of FCMdd with the well-known Relational Fuzzy c-Means algorit...

Nowadays, the Fuzzy C-Means method has become one of the most popular clustering methods based on minimization of a criterion function. However, the performance of this clustering algorithm may be significantly degraded in the presence of noise. This paper presents a robust clustering algorithm called Bilateral Weighted Fuzzy CMeans (BWFCM). We used a new objective function that uses some kinds...

this paper presents a comparative study between three versions of adaptive neuro-fuzzy inference system (anfis) algorithms and a pseudo-forward equation (pfe) to characterize the north sea reservoir (f3 block) based on seismic data. according to the statistical studies, four attributes (energy, envelope, spectral decomposition and similarity) are known to be useful as fundamental attributes in ...

This paper is a survey of fuzzy set theory applied in cluster analysis. These fuzzy clustering algorithms have been widely studied and applied in a variety of substantive areas. They also become the major techniques in cluster analysis. In this paper, we give a survey of fuzzy clustering in three categories. The first category is the fuzzy clustering based on fuzzy relation. The second one is t...

Much research has shown that fuzzy c-means clustering is a powerful tool for partitioning samples into different categories. However, the cost function of the classical fuzzy c-means (FCM) is defined by the distances from data to the cluster centers with their fuzzy memberships. In this study, a new fuzzy clustering algorithm, namely the fuzzy weighted c-means (FWCM), is proposed. In this propo...

An overview of fuzzy c-means clustering algorithms is given where we focus on different objective functions: they use regularized dissimilarity, entropy-based function, and function for possibilistic clustering. Classification functions for the objective functions and their properties are studied. Fuzzy c-means algorithms using kernel functions is also discussed with kernelized cluster validity...

Clustering is a standard approach in analysis of data and construction of separated similar groups. The most widely used robust soft clustering methods are fuzzy, rough and rough fuzzy clustering. The prominent feature of soft clustering leads to combine the rough and fuzzy sets. The Rough Fuzzy C-Means (RFCM) includes the lower and boundary estimation of rough sets, and fuzzy membership of fuz...

In this paper, the utility of credibilistic critical values in crisp conversion of fuzzy data sets is considered. Conversion of this type becomes essential mainly when clustering of fuzzy data sets is carried out. In this paper performance of two popular clustering algorithms namely Fuzzy c–means and Fuzzy c–medoids algorithms are evaluated under credibilistic critical value crisp conversion is...