Mining comprehensible clustering rules with an evolutionary algorithm

Ioannis Sarafis, Phil Trinder, Ali Zalzala

Research output: Chapter in Book/Report/Conference proceedingChapter (peer-reviewed)peer-review

3 Citations (Scopus)


In this paper, we present a novel evolutionary algorithm, called NOCEA, which is suitable for Data Mining (DM) clustering applications. NOCEA evolves individuals that consist of a variable number of non-overlapping clustering rules, where each rule includes d intervals, one for each feature. The encoding scheme is non-binary as the values for the boundaries of the intervals are drawn from discrete domains, which reflect the automatic quantization of the feature space. NOCEA uses a simple fitness function, which is radically different from any distance-based criterion function suggested so far. A density-based merging operator combines adjacent rules forming the genuine clusters in data. NOCEA has been evaluated on challenging datasets and we present results showing that it meets many of the requirements for DM clustering, such as ability to discover clusters of different shapes, sizes, and densities. Moreover, NOCEA is independent of the order of input data and insensitive to the presence of outliers, and to initialization phase. Finally, the discovered knowledge is presented as a set of non-overlapping clustering rules, contributing to the interpretability of the results. © Springer-Verlag Berlin Heidelberg 2003.

Original languageEnglish
Title of host publicationGenetic and Evolutionary Computation — GECCO 2003
Subtitle of host publicationGenetic and Evolutionary Computation Conference Chicago, IL, USA, July 12–16, 2003 Proceedings, Part II
Number of pages12
ISBN (Electronic)978-3-540-45110-5
Publication statusPublished - 2003

Publication series

NameLecture Notes in Computer Science
ISSN (Print)0302-9743


Dive into the research topics of 'Mining comprehensible clustering rules with an evolutionary algorithm'. Together they form a unique fingerprint.

Cite this