Extraction of minimal decision algorithm using rough sets and genetic algorithm
β Scribed by Michiyuki Hirokane; Hideyuki Konishi; Ayaho Miyamoto; Fumihiro Nishimura
- Publisher
- John Wiley and Sons
- Year
- 2007
- Tongue
- English
- Weight
- 782 KB
- Volume
- 38
- Category
- Article
- ISSN
- 0882-1666
No coin nor oath required. For personal study only.
β¦ Synopsis
Abstract
With the performance improvement of computers in recent years, the amount of stored available data is rapidly increasing. But it is also required that the computer fully utilize the stored resources and perform higherβlevel intelligent jobs. In civil engineering, it is crucial to reuse knowledge which has been accumulated through the experience of engineers, etc. For this purpose, it is necessary to establish a method for knowledge acquisition and a method for explicit representation of the acquired knowledge. This paper applies the genetic algorithm to the process of deriving a decision algorithm from instances by using rough sets, and proposes a method of deriving a simple and useful decision algorithm with a relatively small amount of computation. A decision algorithm is actually derived from the data on accident instances at actual construction sites, and the recognition rate and other performance measures are investigated by the kβfold cross validation method. Β© 2007 Wiley Periodicals, Inc. Syst Comp Jpn, 38(4): 39β51, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/scj.20405
π SIMILAR VOLUMES
This article describes a parallel real-coded genetic algorithm implemented to find global minimum energy structures of microclusters of non-bonded argon and xenon atoms. Using appropriate genetic operators, the genetic algorithm was able to find minimum energy structures for microclusters of two to
A novel immune algorithm was proposed by imitating the defending process of an immune system, and with the aid of genetic algorithm, application of the immune algorithm to the resolution of overlapping chromatograms was investigated. The method takes an overlapping chromatogram as its input and iter
In this article, the coupling coefficients of the coupled-resonator filters are extracted using the genetic algorithms (GA). To demonstrate the feasibility of the proposed method, filters with different orders and different characteristics are tested. In all cases, the parameters of these filters ca
A space-fixed modified genetic algorithm (SFMGA) approach was used to obtain global minima for the silicon clusters (Si) n using a semiempirical potential. One modification to the usual GA is the use of gradient-driven minimization of each geometry. A novel feature of the method is the use of space-