Clustering is a task of assigning a set of objects into groups called clusters. In general the clustering algorithms can be classified into two categories. One is hard clustering; another one is soft (fuzzy) clustering. Hard clustering, the data’s are divided into distinct clusters, where each data element belongs to exactly one cluster. In soft clustering, data elements belong to more than one...

The problem of clustering a real s-dimensional data set X={x(1 ),,,,,x(n)} subset R(s) is considered. Usually, each observation (or datum) consists of numerical values for all s features (such as height, length, etc.), but sometimes data sets can contain vectors that are missing one or more of the feature values. For example, a particular datum x(k) might be incomplete, having the form x(k)=(25...

Most existing fuzzy clustering approaches group objects in a dataset based on either a feature-vector representation of each object, or pairwise relationship representation between each pair of objects. However, when both forms of data representations from different descriptions are available for a given dataset, we believe that a dual and cooperative analysis of feature-vectors (vector data) a...

Researchers have observed that multistage clustering can accelerate convergence and improve clustering quality. Two-stage and two-phase fuzzy C-means (FCM) algorithms have been reported. In this paper, we demonstrate that the FCM clustering algorithm can be improved by the use of static and dynamic single-pass incremental FCM procedures. Keywords-Clustering; Fuzzy C-Means Clustering; Incrementa...

This work presents an implementation of a parallel Fuzzy c-means cluster analysis tool, which implements both aspects of cluster investigation: the calculation of clusters’ centers with the degrees of membership of records to clusters, and the determination of the optimal number of clusters for a given dataset using the PBM index. Topics of Interest: Unsupervised Classification, Fuzzy c-Means, ...

A new clustering algorithm for proximity data, called RECM (Relational evidential c-means) is presented. This algorithm generates a credal partition, a new clustering structure based on the theory of belief functions, which extends the existing concepts of hard, fuzzy and possibilistic partitions. Two algorithms, EVCLUS (Evidential Clustering) and ECM (Evidential c-Means) were previously availa...