Extending the class of order-k delineable problems for the gene expression messy genetic algorithm

PDF Version Also Available for Download.

Description

This paper revisits the recently introduced gene expression messy genetic algorithm (GEMGA) and offers some modifications to the extend the class of order-k delineable problems (class of problems that can be solved using a bounded order of relations) in GEMGA. The fundamental components that control the delineability of relations are reviewed in the light of the recently proposed SEARCH framework. Modified class and relation comparison statistics of GEMGA are proposed. The sample complexity of this improved version of GEMGA is shown to be subquadratic. Theoretical conclusions are also substantiated by experimental results for large, multimodal order-k delineable problems with respect ... continued below

Physical Description

14 p.

Creation Information

Kargupta, H.; Goldberg, D.E. & Wang, L. October 1, 1996.

Context

This article is part of the collection entitled: Office of Scientific & Technical Information Technical Reports and was provided by UNT Libraries Government Documents Department to Digital Library, a digital repository hosted by the UNT Libraries. More information about this article can be viewed below.

Who

People and organizations associated with either the creation of this article or its content.

Authors

Sponsor

Publisher

Provided By

UNT Libraries Government Documents Department

Serving as both a federal and a state depository library, the UNT Libraries Government Documents Department maintains millions of items in a variety of formats. The department is a member of the FDLP Content Partnerships Program and an Affiliated Archive of the National Archives.

Contact Us

What

Descriptive information to help identify this article. Follow the links below to find similar items on the Digital Library.

Description

This paper revisits the recently introduced gene expression messy genetic algorithm (GEMGA) and offers some modifications to the extend the class of order-k delineable problems (class of problems that can be solved using a bounded order of relations) in GEMGA. The fundamental components that control the delineability of relations are reviewed in the light of the recently proposed SEARCH framework. Modified class and relation comparison statistics of GEMGA are proposed. The sample complexity of this improved version of GEMGA is shown to be subquadratic. Theoretical conclusions are also substantiated by experimental results for large, multimodal order-k delineable problems with respect to class average comparison statistic. We also present results for the recently constructed Goldberg-Lewei test functions.

Physical Description

14 p.

Notes

OSTI as DE96014641

Source

  • Foundations of genetic algorithms, San Diego, CA (United States), 3-6 Aug 1996

Language

Item Type

Identifier

Unique identifying numbers for this article in the Digital Library or other systems.

  • Other: DE96014641
  • Report No.: LA-UR--96-2748
  • Report No.: CONF-960820--5
  • Grant Number: W-7405-ENG-36
  • Office of Scientific & Technical Information Report Number: 392746
  • Archival Resource Key: ark:/67531/metadc680561

Collections

This article is part of the following collection of related materials.

Office of Scientific & Technical Information Technical Reports

Reports, articles and other documents harvested from the Office of Scientific and Technical Information.

Office of Scientific and Technical Information (OSTI) is the Department of Energy (DOE) office that collects, preserves, and disseminates DOE-sponsored research and development (R&D) results that are the outcomes of R&D projects or other funded activities at DOE labs and facilities nationwide and grantees at universities and other institutions.

What responsibilities do I have when using this article?

When

Dates and time periods associated with this article.

Creation Date

  • October 1, 1996

Added to The UNT Digital Library

  • July 25, 2015, 2:20 a.m.

Description Last Updated

  • Feb. 25, 2016, 4:38 p.m.

Usage Statistics

When was this article last used?

Yesterday: 0
Past 30 days: 0
Total Uses: 9

Interact With This Article

Here are some suggestions for what to do next.

Start Reading

PDF Version Also Available for Download.

Citations, Rights, Re-Use

Kargupta, H.; Goldberg, D.E. & Wang, L. Extending the class of order-k delineable problems for the gene expression messy genetic algorithm, article, October 1, 1996; New Mexico. (digital.library.unt.edu/ark:/67531/metadc680561/: accessed January 22, 2018), University of North Texas Libraries, Digital Library, digital.library.unt.edu; crediting UNT Libraries Government Documents Department.