Fuzzy C-Mean (FCM) is an unsupervised clustering algorithm based on fuzzy set theory that allows an element to belong to more than one cluster. Where fuzzy means “unclear” or “not defined” and c denotes “clustering”. In FCM the number of cluster are randomly selected. [15] FCM is the advanced version of K-means clustering algorithm and doing more work than K-means. K-Means just needs to do a di...

Clustering is the one of the efficient datamining techniques for intrusion detection. In clustering algorithm kmean clustering is widely used for intrusion detection. Because it gives efficient results incase of huge datasets. But sometime kmean clustering fails to give best result because of class dominance problem and no class problem. So for removing these problems we are proposing two new a...

K-means clustering is a very popular clustering technique which is used in numerous applications. Given a set of n data points in R d and an integer k, the problem is to determine a set of k points R d , called centers, so as to minimize the mean squared distance from each data point to its nearest center. A popular heuristic for k-means clustering is Lloyd's algorithm. In this paper we present...

Clustering is the process of dividing a set of input data into a number of subgroups. The members of each subgroup are similar to each other but different from members of other subgroups. The genetic algorithm has enjoyed many applications in clustering data. One of these applications is the clustering of images. The problem with the earlier methods used in clustering images was in selecting in...

The K-means clustering algorithm is an old algorithm that has been intensely researched owing to its simplicity of implementation. However, there have also been criticisms on its performance, in particular, for demanding the value of K a priori. It is evident from previous researches that providing the number of clusters a priori does not in any way assist in the production of good quality clus...

Many clustering algorithms exist that estimate a cluster centroid, such as K-means, K-medoids or mean-shift, but no algorithm seems to exist that clusters data by returning exactly K meaningful modes. We propose a natural definition of a K-modes objective function by combining the notions of density and cluster assignment. The algorithm becomes K-means and K-medoids in the limit of very large a...

S.Keerthana1, Mrs. S. Akila2 1Research Scholar, Department of Computer Science, Vellalar College for Women, Erode, Tamilnadu, India 2Assistant Professor, Dept. of Computer Science, Vellalar College for Women, Erode, Tamilnadu, India ---------------------------------------------------------------------***--------------------------------------------------------------------Abstract Clustering is a...