A data mining based genetic algorithm

Document Type

Conference Proceeding

Publication Date

11-16-2006

Abstract

Genetic algorithms (GAs) are considered as a global search approach for optimization problems. Through the proper evaluation strategy, the best "chromosome" can be found from the numerous genetic combinations. Although the GA operations do provide the opportunity to find the optimum solution, they may fail in some cases, especially when the length of a chromosome is very long. In this paper, a data mining-based GA is presented to efficiently improve the Traditional GA (TGA). By analyzing support and confidence parameters, the important genes, called DNA, can be obtained. By adopting DNA extraction, it is possible that TGA will avoid stranding on a local optimum solution. Furthermore, the new GA operation, DNA implantation, was developed for providing potentially high quality genetic combinations to improve the performance of TGA. Experimental results in the area of digital watermarking show that our data mining-Jbased GA successfully reduces the number of evolutionary iterations needed to find a solution. © 2006 IEEE.

Identifier

33750905521 (Scopus)

ISBN

[0769525601, 9780769525600]

Publication Title

Proc the Fourth IEEE Workshop on Software Technol for Future Embedded and Ubiquitous Syst Seus 2006 Andthe Second Int Workshop on Collaborative Comput Integr and Assur Wccia 2006

External Full Text Location

https://doi.org/10.1109/SEUS-WCCIA.2006.2

First Page

55

Last Page

60

Volume

2006

This document is currently not available here.

Share

COinS