Evolution of Multi-adaptive Discretization Intervals for a Rule-Based Genetic Learning System

نویسندگان

  • Jaume Bacardit
  • Josep Maria Garrell i Guiu
چکیده

Genetic Based Machine Learning (GBML) systems traditionally have evolved rules that only deal with discrete attributes. Therefore, some discretization process is needed in order to teal with realvalued attributes. There are several methods to discretize real-valued attributes into a nite number of intervals, however none of them can eÆciently solve all the possible problems. The alternative of a high number of simple uniform-width intervals usually expands the size of the search space without a clear performance gain. This paper proposes a rule representation which uses adaptive discrete intervals that split or merge through the evolution process, nding the correct discretization intervals at the same time as the learning process is done.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Evolution of adaptive discretization intervals for rule-based genetic learning system

The traditional classi er rules evolved in genetic based machine learning (GBML) systems need a discretization process to handle problems with real-valued attributes. A good discretization procedure is needed to generate a solution with good accuracy because the alternative of a high number of simple uniform-width intervals is bad due to the big search space being hardly explorable in a reasona...

متن کامل

Evolution Of Adaptive Discretization Intervals For A Rule-based Genetic Learning System

The traditional classi er rules evolved in genetic based machine learning (GBML) systems need a discretization process to handle problems with real-valued attributes. A good discretization procedure is needed to generate a solution with good accuracy because the alternative of a high number of simple uniform-width intervals is bad due to the big search space being hardly explorable in a reasona...

متن کامل

Adaptive Rule-Base Influence Function Mechanism for Cultural Algorithm

This study proposes a modified version of cultural algorithms (CAs) which benefits from rule-based system for influence function. This rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. This is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. This rule ...

متن کامل

Developing Self-adaptive Melody Search Algorithm for Optimal Operation of Multi-reservoir Systems

Operation of multi-reservoir systems is known as complicated and often large-scale optimization problems. The problems, because of broad search space, nonlinear relationships, correlation of several variables, as well as problem uncertainty, are difficult requiring powerful algorithms with specific capabilities to be solved. In the present study a Self-adaptive version of Melody Search algorith...

متن کامل

Multi-objective Differential Evolution for the Flow shop Scheduling Problem with a Modified Learning Effect

This paper proposes an effective multi-objective differential evolution algorithm (MDES) to solve a permutation flow shop scheduling problem (PFSSP) with modified Dejong's learning effect. The proposed algorithm combines the basic differential evolution (DE) with local search and borrows the selection operator from NSGA-II to improve the general performance.  First the problem is encoded with a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002