Evolutionary fuzzy clustering of relational data

Citations of this article
Mendeley users who have this article in their library.


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. © 2011 Elsevier B.V. All rights reserved.




Horta, D., De Andrade, I. C., & Campello, R. J. G. B. (2011). Evolutionary fuzzy clustering of relational data. Theoretical Computer Science, 412(42), 5854–5870. https://doi.org/10.1016/j.tcs.2011.05.039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free