Herding is the process of bringing individuals (e.g. animals) together into a group. More specifically, we consider self– organized herding as the process of moving a set of individuals to a given number of locations (cluster centers) without any external control. We formally describe the relation between herding and clustering and show that any clustering model can be used to control herding p...

Keywords: Cluster analysis Fuzzy clustering Fuzzy c-means (FCM) Initialization Bias correction Probability weight a b s t r a c t Fuzzy clustering is generally an extension of hard clustering and it is based on fuzzy membership partitions. In fuzzy clustering, the fuzzy c-means (FCM) algorithm is the most commonly used clustering method. Numerous studies have presented various generalizations o...

Based on the basic theory of fuzzy set, this paper suggests the notion of FCM fuzzy set, which is subject to the constraint condition of fuzzy c-means clustering algorithm. The cluster fuzzy degree and the lattice degree of approaching for the FCM fuzzy set are presented, and their functions in the validation process of fuzzy clustering are deeply analyzed. A new cluster validity index is propo...

The big challenge for many areas such as business, marketing, medical science etc. is management of information. The solution for this is provided by the data mining. The application of data mining is text mining, which provides methods such as classification, clustering etc. to extract the important information from unstructured data or text documents. The technique which is used for grouping ...

The technology of DNA microarrays has become the most sophisticated and the most widely used among other microarrays. This paper shows the feature of microarray analysis and the expanded information of DNA microarray analysis. The clustering technique is the process of finding a structured data from unlabeled data. It is a grouping process of dividing the data in groups of similar type and it c...

In this paper, a modified version of the FCM algorithm is presented to deal with clusters with totally different geometrical properties. The proposed algorithm adopts a novel non-metric distance measure based on the idea of "point symmetry". Experimental results on several data sets are presented to illustrate its effectiveness.

Fuzzy c-means (FCM) has been considered as an effective algorithm for image segmentation. However, it still suffers from two problems: one is insufficient robustness to image noise, and the other is the Euclidean distance in FCM, which is sensitive to outliers. In this paper, we propose two new algorithms, generalized FCM (GFCM) and hierarchical FCM (HFCM), to solve these two problems. Traditio...

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

In order to preserve more image details and enhance its robustness to noise for image segmentation, an improved fuzzy c-means algorithm (FCM) for image segmentation is presented by incorporating the local spatial information and gray level information in this paper. The modified membership function and clustering center function are more mathematically reasonable than those of the FLICM, so the...