This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the data set to be clustered is described by a proximity matrix only (relational data) and the number of clusters must be automatically estimated from such data. A fuzzy variant of an evolutionary algorithm for relational clustering is derived and compared against two systematic (pseudo-exhaustive) approaches that can also be used to automatically estimate the number of fuzzy clusters in relational data. An extensive collection of experiments involving 18 artificial and two real data sets is reported and analyzed. (C) 2011 Elsevier B.V. All rights reserved
The proposed relational fuzzy clustering method, called FRFP ( fuzzy relational fixed point), is bas...
This paper presents a survey of evolutionary algorithms designed for clustering tasks. It tries to r...
Two new algorithms for fuzzy clustering are presented. Convergence of the proposed algorithms is pro...
This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the da...
AbstractThis paper is concerned with the computational efficiency of fuzzy clustering algorithms whe...
This paper is concerned with the computational efficiency of clustering algorithms when the data set...
This paper is concerned with the computational efficiency of clustering algorithms when the data set...
This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be m...
In this paper, we show how one can take advantage of the stability and effectiveness of object data ...
In this paper, we propose a new approach to robust fuzzy clustering of relational data, which does n...
International audienceThis paper introduces fuzzy clustering algorithms that can partition objects t...
A fuzzy version of an Evolutionary Algorithm for Clustering (EAC) proposed in, previous work is intr...
One of the critical aspects of clustering algorithms is the correct identification of the dissimilar...
Two types of data are used in pattern recognition, object and relational data. Object data is the mo...
the original method of fuzzy clustering using genetic algorithm is proposed. The chromosomes of the...
The proposed relational fuzzy clustering method, called FRFP ( fuzzy relational fixed point), is bas...
This paper presents a survey of evolutionary algorithms designed for clustering tasks. It tries to r...
Two new algorithms for fuzzy clustering are presented. Convergence of the proposed algorithms is pro...
This paper is concerned with the computational efficiency of fuzzy clustering algorithms when the da...
AbstractThis paper is concerned with the computational efficiency of fuzzy clustering algorithms whe...
This paper is concerned with the computational efficiency of clustering algorithms when the data set...
This paper is concerned with the computational efficiency of clustering algorithms when the data set...
This paper tackles the problem of showing that evolutionary algorithms for fuzzy clustering can be m...
In this paper, we show how one can take advantage of the stability and effectiveness of object data ...
In this paper, we propose a new approach to robust fuzzy clustering of relational data, which does n...
International audienceThis paper introduces fuzzy clustering algorithms that can partition objects t...
A fuzzy version of an Evolutionary Algorithm for Clustering (EAC) proposed in, previous work is intr...
One of the critical aspects of clustering algorithms is the correct identification of the dissimilar...
Two types of data are used in pattern recognition, object and relational data. Object data is the mo...
the original method of fuzzy clustering using genetic algorithm is proposed. The chromosomes of the...
The proposed relational fuzzy clustering method, called FRFP ( fuzzy relational fixed point), is bas...
This paper presents a survey of evolutionary algorithms designed for clustering tasks. It tries to r...
Two new algorithms for fuzzy clustering are presented. Convergence of the proposed algorithms is pro...