In this paper, a two-phase method for computer network intrusion detection is proposed. In the first phase, a set of patterns (data) are clustered by the fuzzy c-means algorithm. In the second phase, outliers are constructed by a distance-based technique and a class label is assigned to each pattern. The KDD Cup 1999 data set is used for the experiment. The results show that, for binary classif...

One of the most famous algorithms that appeared in the area of image segmentation is the Fuzzy C-Means (FCM) algorithm. This algorithm has been used in many applications such as data analysis, pattern recognition, and image segmentation. It has the advantages of producing high quality segmentation compared to the other available algorithms. Many modifications have been made to the algorithm to ...

This study proposes a new single-solution based metaheuristic, namely the Vortex Search algorithm (VS), for fuzzy clustering of ECG beats. The newly proposed metaheuristic is quite simple and highly competitive when compared to the population-based metaheuristics. In order to study the performance of the proposed method a number of experiments are performed over a dataset which is created by us...

A novel approach to fuzzy clustering for image segmentation is described. The fuzzy C-means objective function is generalized to include a spatial penalty on the membership functions. The penalty term leads to an iterative algorithm that is only slightly different from the original fuzzy C-means algorithm and allows the estimation of spatially smooth membership functions. To determine the stren...

Intuitionistic fuzzy sets are generalized fuzzy sets whose elements are characterized by a membership, as well as a non-membership value. The membership value indicates the degree of belongingness, whereas the nonmembership value indicates the degree of non-belongingness of an element to that set. The utility of intuitionistic fuzzy sets theory in computer vision is increasingly becoming appare...

The kernelized fuzzy c-means algorithm uses kernel methods to improve the clustering performance of the well known fuzzy c-means algorithm by mapping a given dataset into a higher dimensional space non-linearly. Thus, the newly obtained dataset is more likely to be linearly seprable. However, to further improve the clustering performance, an optimization method is required to overcome the drawb...

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

This paper presents a variation of fuzzy c-means (FCM) algorithm that provides data clustering. The proposed algorithm incorporates the local spatial information in a novel fuzzy way. The new algorithm is called Weighted Fuzzy Local Information C-Means (WFLICM). WFLICM can overcome the disadvantages of the known fuzzy Cmeans algorithm and at the same time enhances the clustering performance. Th...

Many variants of fuzzy c-means (FCM) clustering method are applied to crisp numbers but only a few of them are extended to non-crisp numbers, mainly due to the fact that the latter needs complicated equations and exhausting calculations. Vector form of fuzzy c-means (VFCM), proposed in this paper, simplifies the FCM clustering method applying to non-crisp (symbolic interval and fuzzy) numbers. ...