An Oriented Clonal Selection Algorithm for Associative Classification

Article Preview

Abstract:

In this paper, we present an oriented clonal selection algorithm (O-CLONALG) for mining association rules effectively for classification. Different with the traditional evolutionary algorithms, O-CLONALG firstly scans dataset one time to find the frequent rules with one item. The items are used to generate new rules and the mutation operation is limited in it. When mutation operation takes place, each rule in the same generation was added a new item. The results have shown that it is efficient in dealing with the problem on the complexity of the rule search space. At the same time, good classification accuracy has been achieved

You might also be interested in these eBooks

Info:

Periodical:

Pages:

3320-3323

Citation:

Online since:

May 2012

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] W. Li, J. Han and J. Pei, In Proc. of the IEEE Int'l Conf. on Data Mining (ICDM01), pp.369-376(2001).

Google Scholar

[2] B. Liu, Y. Ma and C.K. Wong, Eds.Berlin, Germany: Springer-Verlag, (2001)

Google Scholar

[3] A. A. Freitas, SIGKDD Explor.News l., vol.2,no.1, p.65–69,2000.

Google Scholar

[4] D. R. Carvalho, A. A. Freitas and N. F. Ebecken, in Proc.4th Int. Conf. Data Mining,2003, p.545–556.

Google Scholar

[5] Tien Dung Do, Siu Cheung Hui and Bernard Fong, IEEE transactions on evolutionary computation, VOL.13, NO. 2, APRIL 2009.

DOI: 10.1109/tevc.2008.923394

Google Scholar

[6] D. J. Newman, S. Hettich, C. Blake, and C. Merz, UCI Repository of Machine Learning Databases. Berleley, CA: Dept. Information Comput. Sci., University of California, 1998.

Google Scholar