24 May 2013
  Welcome Guest
  Login | Help
Home
 
General Information
Transaction Series
Related Information
Connect with WIT Press
Connect with WIT
Login
Login ID:
Password:
 
Your Cart
There are 0 items in your cart. [View]

Adobe PDF Reader is required to view our papers:
Get Acrobat Reader




  Welcome to the WIT eLibrary

The home of the Transactions of the Wessex Institute collection, providing on-line access to papers presented at the Institute's prestigious international conferences and from its State-of-the-Art in Science & Engineering publications.

Paper Information

The window algorithm

Author(s): D A Newlands & D Brain

Abstract:
Genetic algorithm (GAs) have long been known as effective search techniques for high dimensional spaces.

Function finding attempts to discover a mathematical function that adequately describes a set of data.

A standard genetic algorithm searches for all coefficients of a function concurrently, but there are difficulties in simultaneously minimising run times and maximizing accuracy.

One recent improvement to GA performance is Delta Coding which searches all coefficients in parallel but increases the accuracy as the search progresses.

This paper presents another method of tackling the accuracy and speed trade-offs in GAs.

Instead of searching for all coefficients at the same time, a sliding window of coefficients is searched.

Experiments are performed into fitting functions to data points and results indicate that good performance can be obtained with small windows.

The results indicate that the window algorithm is a useful modification to the standard GA.

Some insight into window sizing is presented. 1 Introduction Many mathematical techniques exist for fitting functions to data, such as collocation and osculation [Scheid, 1968] but, for example, when the domain is of very high dimensionality, when attempting to fit a non-linear function to spaces between data points or when the surface is discontinuous, mathematical techniques become computationally infeasible.

It has been shown that some artificial neural networks [Ginsberg, 1993, Hecht-Nielsen, 1987] -a technique based on mathematical principles - cannot find some polynomials [Cardell et al., 1994].

Genetic algorithms [Goldberg, 1989] can search large spaces quickly and, due to their abstraction of data, have a wide ...

Size: 503 kb
Paper DOI: 10.2495/DATA020391

 

 

Download the Full Article

Price: US$ 0.00

This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon below.

Send this page to a friend. Send this page to a colleague.



This paper can be found in the following book

Data Mining III

Data Mining III

Buy Book from
Witpress.com



Download the Full Article

This article is part of the WIT OpenView scheme and you can download the full text Adobe PDF article for FREE by clicking the 'Openview' icon to the right.


Copyright© 2006 by WIT Press | About Prof Carlos Brebbia
Optimised for Microsoft Internet Explorer