An empirical study of unsupervised rule set extraction of clustered categorical data using a simulated bee colony algorithm

6Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This study investigates the use of a biologically inspired meta-heuristic algorithm to extract rule sets from clustered categorical data. A computer program which implemented the algorithm was executed against six benchmark data sets and successfully discovered the underlying generation rules in all cases. Compared to existing approaches, the simulated bee colony (SBC) algorithm used in this study has the advantage of allowing full customization of the characteristics of the extracted rule set, and allowing arbitrarily large data sets to be analyzed. The primary disadvantages of the SBC algorithm for rule set extraction are that the approach requires a relatively large number of input parameters, and that the approach does not guarantee convergence to an optimal solution. The results demonstrate that an SBC algorithm for rule set extraction of clustered categorical data is feasible, and suggest that the approach may have the ability to outperform existing algorithms in certain scenarios. © 2009 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

McCaffrey, J. D., & Dierking, H. (2009). An empirical study of unsupervised rule set extraction of clustered categorical data using a simulated bee colony algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5858 LNCS, pp. 182–192). https://doi.org/10.1007/978-3-642-04985-9_18

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