This chapter presents a new optimization method for clustering fuzzy data to generate Type-2 fuzzy system models. For this purpose, first, a new distance measure for calculating the (dis)similarity between fuzzy data is proposed. Then, based on the proposed distance measure, Fuzzy c-Mean (FCM) clustering algorithm is modified. Next, Xie-Beni cluster validity index is modified to be able to valu...

Fuzzy co-clustering is a technique that performs simultaneous fuzzy clustering of objects and features. It is known to be suitable for categorizing high-dimensional data, due to its dynamic dimensionality reduction mechanism achieved through simultaneous feature clustering. We introduce a new fuzzy co-clustering algorithm called Heuristic Fuzzy Co-clustering with the Ruspini’s condition (HFCR),...

In clustering we often face the situation that only a subset of the available attributes is relevant for forming clusters, even though this may not be known beforehand. In such cases it is desirable to have a clustering algorithm that automatically weights attributes or even selects a proper subset. In this paper I study such an approach for fuzzy clustering, which is based on the idea to trans...

Geodemographic analysis has been described as “the analysis of spatially referenced geodemographic and lifestyle data” (See and Openshaw, 2001, p.269) It is widely used in the public and private sectors for the planning and provision of products and services. Geodemographic analysis often uses clustering techniques which are used to classify the geodemographic data into groups, making the data ...

Fuzzy c-means clustering algorithm (FCM) is a method that is frequently used in pattern recognition. It has the advantage of giving good modeling results in many cases, although, it is not capable of specifying the number of clusters by itself. Aimed at the problems existed in the FCM clustering algorithm, a kernelbased fuzzy c-means (KFCM) is clustering algorithm is proposed to optimize fuzzy ...

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...

Document clustering is a very useful application in recent days especially with the advent of the World Wide Web. Most of the existing document clustering algorithms either produce clusters of poor quality or are highly computationally expensive. In this paper we propose a document-clustering algorithm, KMART, that uses an unsupervised Fuzzy Adaptive Resonance Theory (Fuzzy-ART) neural network....

This paper describes a hybrid approach of Fuzzy C-means clustering and Genetic Algorithm (GA) is proposed that provides better accuracy & increases the intrusion detection rate. This approach provides better accuracy of detection as compared to K-means and FCM Clustering. With this proposed approach intrusion detection rate is improved considerably.A brief overview of a hybrid approach of genet...