• 제목/요약/키워드: evolutionary computing

검색결과 81건 처리시간 0.024초

A Co-Evolutionary Computing for Statistical Learning Theory

  • Jun Sung-Hae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • 제5권4호
    • /
    • pp.281-285
    • /
    • 2005
  • Learning and evolving are two basics for data mining. As compared with classical learning theory based on objective function with minimizing training errors, the recently evolutionary computing has had an efficient approach for constructing optimal model without the minimizing training errors. The global search of evolutionary computing in solution space can settle the local optima problems of learning models. In this research, combining co-evolving algorithm into statistical learning theory, we propose an co-evolutionary computing for statistical learning theory for overcoming local optima problems of statistical learning theory. We apply proposed model to classification and prediction problems of the learning. In the experimental results, we verify the improved performance of our model using the data sets from UCI machine learning repository and KDD Cup 2000.

효율적인 DNA 서열 생성을 위한 진화연산 프로세서 구현 (Implementation of GA Processor for Efficient Sequence Generation)

  • 전성모;김태선;이종호
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2003년도 학술회의 논문집 정보 및 제어부문 B
    • /
    • pp.376-379
    • /
    • 2003
  • DNA computing based DNA sequence Is operated through the biology experiment. Biology experiment used as operator causes illegal reactions through shifted hybridization, mismatched hybridization, undesired hybridization of the DNA sequence. So, it is essential to design DNA sequence to minimize the potential errors. This paper proposes method of the DNA sequence generation based evolutionary operation processor. Genetic algorithm was used for evolutionary operation and extra hardware, namely genetic algorithm processor was implemented for solving repeated evolutionary process that causes much computation time. To show efficiency of the Proposed processor, excellent result is confirmed by comparing between fitness of the DNA sequence formed randomly and DNA sequence formed by genetic algorithm processor. Proposed genetic algorithm processor can reduce the time and expense for preparing DNA sequence that is essential in DNA computing. Also it can apply design of the oligomer for development of the DNA chip or oligo chip.

  • PDF

PESA: Prioritized experience replay for parallel hybrid evolutionary and swarm algorithms - Application to nuclear fuel

  • Radaideh, Majdi I.;Shirvan, Koroush
    • Nuclear Engineering and Technology
    • /
    • 제54권10호
    • /
    • pp.3864-3877
    • /
    • 2022
  • We propose a new approach called PESA (Prioritized replay Evolutionary and Swarm Algorithms) combining prioritized replay of reinforcement learning with hybrid evolutionary algorithms. PESA hybridizes different evolutionary and swarm algorithms such as particle swarm optimization, evolution strategies, simulated annealing, and differential evolution, with a modular approach to account for other algorithms. PESA hybridizes three algorithms by storing their solutions in a shared replay memory, then applying prioritized replay to redistribute data between the integral algorithms in frequent form based on their fitness and priority values, which significantly enhances sample diversity and algorithm exploration. Additionally, greedy replay is used implicitly to improve PESA exploitation close to the end of evolution. PESA features in balancing exploration and exploitation during search and the parallel computing result in an agnostic excellent performance over a wide range of experiments and problems presented in this work. PESA also shows very good scalability with number of processors in solving an expensive problem of optimizing nuclear fuel in nuclear power plants. PESA's competitive performance and modularity over all experiments allow it to join the family of evolutionary algorithms as a new hybrid algorithm; unleashing the power of parallel computing for expensive optimization.

Applications of Soft Computing Techniques in Response Surface Based Approximate Optimization

  • Lee, Jongsoo;Kim, Seungjin
    • Journal of Mechanical Science and Technology
    • /
    • 제15권8호
    • /
    • pp.1132-1142
    • /
    • 2001
  • The paper describes the construction of global function approximation models for use in design optimization via global search techniques such as genetic algorithms. Two different approximation methods referred to as evolutionary fuzzy modeling (EFM) and neuro-fuzzy modeling (NFM) are implemented in the context of global approximate optimization. EFM and NFM are based on soft computing paradigms utilizing fuzzy systems, neural networks and evolutionary computing techniques. Such approximation methods may have their promising characteristics in a case where the training data is not sufficiently provided or uncertain information may be included in design process. Fuzzy inference system is the central system for of identifying the input/output relationship in both methods. The paper introduces the general procedures including fuzzy rule generation, membership function selection and inference process for EFM and NFM, and presents their generalization capabilities in terms of a number of fuzzy rules and training data with application to a three-bar truss optimization.

  • PDF

Detection for JPEG steganography based on evolutionary feature selection and classifier ensemble selection

  • Ma, Xiaofeng;Zhang, Yi;Song, Xiangfeng;Fan, Chao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권11호
    • /
    • pp.5592-5609
    • /
    • 2017
  • JPEG steganography detection is an active research topic in the field of information hiding due to the wide use of JPEG image in social network, image-sharing websites, and Internet communication, etc. In this paper, a new steganalysis method for content-adaptive JPEG steganography is proposed by integrating the evolutionary feature selection and classifier ensemble selection. First, the whole framework of the proposed steganalysis method is presented and then the characteristic of the proposed method is analyzed. Second, the feature selection method based on genetic algorithm is given and the implement process is described in detail. Third, the method of classifier ensemble selection is proposed based on Pareto evolutionary optimization. The experimental results indicate the proposed steganalysis method can achieve a competitive detection performance by compared with the state-of-the-art steganalysis methods when used for the detection of the latest content-adaptive JPEG steganography algorithms.

A Brief Introduction to Soft Computing

  • Hong Dug Hun;Hwang Changha
    • 한국통계학회:학술대회논문집
    • /
    • 한국통계학회 2004년도 학술발표논문집
    • /
    • pp.65-66
    • /
    • 2004
  • The aim of this article is to illustrate what soft computing is and how important it is.

  • PDF

A comparative study of multi-objective evolutionary metaheuristics for lattice girder design optimization

  • Talaslioglu, Tugrul
    • Structural Engineering and Mechanics
    • /
    • 제77권3호
    • /
    • pp.417-439
    • /
    • 2021
  • The geometric nonlinearity has been successfully integrated with the design of steel structural system. Thus, the tubular lattice girder, one application of steel structural systems have already been optimized to obtain an economic design following the completion of computationally expensive design procedure. In order to decrease its computing cost, this study proposes to employ five multi-objective metaheuristics for the design optimization of geometrically nonlinear tubular lattice girder. Then, the employed multi-objective optimization algorithms (MOAs), NSGAII, PESAII, SPEAII, AbYSS and MoCell are evaluated considering their computing performances. For an unbiased evaluation of their computing performance, a tubular lattice girder with varying size-shape-topology and a benchmark truss design with 17 members are not only optimized considering the geometrically nonlinear behavior, but three benchmark mathematical functions along with the four benchmark linear design problems are also included for the comparison purpose. The proposed experimental study is carried out by use of an intelligent optimization tool named JMetal v5.10. According to the quantitative results of employed quality indicators with respect to a statistical analysis test, MoCell is resulted with an achievement of showing better computing performance compared to other four MOAs. Consequently, MoCell is suggested as an optimization tool for the design of geometrically nonlinear tubular lattice girder than the other employed MOAs.

병렬 환경하의 진화 이론을 이용한 결함인식 (Crack Identification Using Evolutionary Algorithms in Parallel Computing Environment)

  • 심문보;서명원
    • 대한기계학회논문집A
    • /
    • 제26권9호
    • /
    • pp.1806-1813
    • /
    • 2002
  • It is well known that a crack has an important effect on the dynamic behavior of a structure. This effect depends mainly on the location and depth of the crack. To identify the location and depth of a crack in a structure, a classical optimization technique was adopted by previous researchers. That technique overcame the difficulty of finding the intersection point of the superposed contours that correspond to the eigenfrequency caused by the crack presence. However, it is hard to select a trial solution initially for optimization because the defined objective function is heavily multimodal. A method is presented in this paper, which uses continuous evolutionary algorithms(CEAs). CEAs are effective for solving inverse problems and implemented on PC clusters to shorten calculation time. With finite element model of the structure to calculate eigenfrequencies, it is possible to formulate the inverse problem in optimization format. CEAs are used to identify the crack location and depth minimizing the difference from the measured frequencies. We have tried this new idea on a simple beam structure and the results are promising with high parallel efficiency over about 94%.

Applications of artificial intelligence and data mining techniques in soil modeling

  • Javadi, A.A.;Rezania, M.
    • Geomechanics and Engineering
    • /
    • 제1권1호
    • /
    • pp.53-74
    • /
    • 2009
  • In recent years, several computer-aided pattern recognition and data mining techniques have been developed for modeling of soil behavior. The main idea behind a pattern recognition system is that it learns adaptively from experience and is able to provide predictions for new cases. Artificial neural networks are the most widely used pattern recognition methods that have been utilized to model soil behavior. Recently, the authors have pioneered the application of genetic programming (GP) and evolutionary polynomial regression (EPR) techniques for modeling of soils and a number of other geotechnical applications. The paper reviews applications of pattern recognition and data mining systems in geotechnical engineering with particular reference to constitutive modeling of soils. It covers applications of artificial neural network, genetic programming and evolutionary programming approaches for soil modeling. It is suggested that these systems could be developed as efficient tools for modeling of soils and analysis of geotechnical engineering problems, especially for cases where the behavior is too complex and conventional models are unable to effectively describe various aspects of the behavior. It is also recognized that these techniques are complementary to conventional soil models rather than a substitute to them.