| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10322581 | Expert Systems with Applications | 2012 | 10 Pages |
Abstract
⺠Variable-Length Genetic Algorithm can be used to automatically learn regular expressions using a set of positive and negative examples. ⺠We proposed an algorithm based on Zipf's law to build an alphabet of tokens. ⺠Genetic algorithms can be introduced in the Searchy agent platform in a data extraction environment as evolutive wrappers.
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
David F. Barrero, MarÃa D. R-Moreno, David Camacho,