Fuzzy C-Means (FCM) and hard clustering are the most common tools for data partitioning. However, the presence of noisy observations in the data may cause generation of completely unreliable partitions from these clustering algorithms. Also, application of the Euclidean distance in FCM only produces spherical clusters. In this paper, a new noise-rejection clustering algorithm based on Mahalanob...

In the case of biomedical signals with a quasi-cyclic character, such as electrocardiographic signals, the high resolution electrocardiograms or electrical potentials recorded from the nervous system of patients (estimating brain activity evoked by a known stimulus), as a method of averaging in the time domain may be used for noise attenuation. In this paper there is presented input data partit...

The study of fuzzy time series has increasingly attracted much attention due to its salient capabilities of tackling vague and incomplete data. A variety of forecasting models have devoted to improving forecasting accuracy, however, the issue of partitioning intervals has rarely been investigated. Recently, we proposed a novel deterministic forecasting model to eliminate the major overhead of d...

— This paper analyses the set of iris codes stored or used in an iris recognition system as an f-granular space. The f-granulation is given by identifying in the iris code space the extensions of the fuzzy concepts wolves, goats, lambs and sheep (previously introduced by Doddington as 'animals' of the biometric menagerie) – which together form a partitioning of the iris code space. The main que...

The problem of identifying unstructured nonlinear systems is generally addressed on the basis multi-model representations involving several linear local models. In present work, models are combined to get a global representation using incremental fuzzy clustering. main contribution novel vector similarity measure defined in System Working Space (SWS) that combines angular deviation and usual Eu...

Researchers introduce in this paper, an efficient fuzzy time series forecasting model based on fuzzy clustering to handle forecasting problems and improving forecasting accuracy. Each value (observation) is represented by a fuzzy set. The transition between consecutive values is taken into account in order to model the time series data. Proposed model employed eight main steps in time-invariant...

The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number of cliques is minimized. Both problem...

The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of vertex-disjoint cliques, such that the editing cost is minimized. The Edge Clique Partitioning problem seeks to partition the edges of a given graph into edge-disjoint cliques, such that the number of cliques is minimized. Both problem...

In this paper, the LVQ (Learning Vector Quantization) model and its variants are regarded as the clustering tools to discriminate the natural seismic events (earthquakes) from the artificial ones (nuclear explosions). The study is based on the six spectral features of the P-wave spectra computed from the short period teleseismic recordings. The conventional LVQ proposed by Kohenen [2] and also ...

Many real-world classification algorithms can not be applied unless the continuous attributes are discretized and the interval discretization methods are used in many machine learning techniques. It is hard to determine the intervals for the discretization of numerical attributes that has an infinite number of candidates. And interval discretization methods are based on a crisp set, a value in ...