• Title/Summary/Keyword: 유전적프로그래밍

Search Result 54, Processing Time 0.037 seconds

Efficient Identification of Gene Regulatory Networks by Multi-Stage Evolutionary Algorithms (다중 진화 알고리즘에 의한 유전자 조절 네트워크의 효율적인 탐색)

  • Kim Kee-Young;Cho Dong-Yeon;Zhang Byoung-Tak
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2005.11b
    • /
    • pp.277-279
    • /
    • 2005
  • DNA 마이크로어레이 기술의 발전으로 유전자 발현에 대한 많은 양의 정보가 쏟아지게 되었고, 이러한 정보들을 이용하여 유전자 조절 네트워크를 수학적으로 모델링하는 것이 시스템 생물학의 중요 관심사로 떠오르고 있다. 본 논문에서는 실험에서 얻어낸 데이터를 유전 프로그래밍을 이용한 기호 회귀를 통해 데이터 지점을 조정하고 유전 프로그래밍의 결과 함수를 이용해 각 지점에서의 미분값을 얻어내었다. 그 뒤, 불리안 네트워크를 표현하는 이진 배열과 S-시스템을 표현하는 실수 배열을 결합한 해를 사용하는 유전 알고리즘으로 앞에서 얻은 데이터를 이용해 원하는 S-시스템의 구조와 매개변수를 구해내었다.

  • PDF

Implementing Linear Models in Genetic Programming to Utilize Accumulated Data in Shipbuilding (조선분야의 축적된 데이터 활용을 위한 유전적프로그래밍에서의 선형(Linear) 모델 개발)

  • Lee, Kyung-Ho;Yeun, Yun-Seog;Yang, Young-Soon
    • Journal of the Society of Naval Architects of Korea
    • /
    • v.42 no.5 s.143
    • /
    • pp.534-541
    • /
    • 2005
  • Until now, Korean shipyards have accumulated a great amount of data. But they do not have appropriate tools to utilize the data in practical works. Engineering data contains experts' experience and know-how in its own. It is very useful to extract knowledge or information from the accumulated existing data by using data mining technique This paper treats an evolutionary computation based on genetic programming (GP), which can be one of the components to realize data mining. The paper deals with linear models of GP for the regression or approximation problem when given learning samples are not sufficient. The linear model, which is a function of unknown parameters, is built through extracting all possible base functions from the standard GP tree by utilizing the symbolic processing algorithm. In addition to a standard linear model consisting of mathematic functions, one variant form of a linear model, which can be built using low order Taylor series and can be converted into the standard form of a polynomial, is considered in this paper. The suggested model can be utilized as a designing tool to predict design parameters with small accumulated data.

Response Surface Modeling by Genetic Programming I: A Directional Derivative-Based Smoothering Method (유전적 프로그래밍을 이용한 응답면의 모델링 I : 방향도함수 기반의 Smoothering 기법)

  • Yeun, Yun-Seog;Rhee, Wook
    • Journal of Information Technology Application
    • /
    • v.3 no.3
    • /
    • pp.1-24
    • /
    • 2001
  • This paper introduces the genetic programming algorithm(GP), which can approximate highly nonlinear functions, as a tool for the modeling of response surfaces. When the response surfaces is approximated, the very small or minimal teaming set should be used, and thus it is almost certain that GP trees will show overfilling that must be avoided at all costs. We present a novel method, calledDDBS(DirectionalDerivative-Based Smoothering), which very effectively eliminates the unwanted behaviors of GP trees such as large peaks, oscillations, and also overfitting. Four illustrative numerical examples are given to demonstrate the performance of the genetic programming algorithm that adopts DDBS.

  • PDF

A Survey of Sequence Alignment Algorithms (서열 정렬 알고리즘의 연구 동향)

  • 성종희;김동규
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2003.05b
    • /
    • pp.571-574
    • /
    • 2003
  • 서열 정렬(sequence alignment)은 새로운 서열의 기능적, 구조적, 진화적 분석을 용이하게 하기 때문에 분자 생물학(molecular biology) 등에서 널리 사용된다. 지금까지 서열 정렬 알고리즘들에 대한 연구는 활발히 진행되어 왔다. 특히, 생물학 데이터양의 기하급수적인 증가와 전체 유전체 서열의 분석이 이루어진 종(species)들이 증가하면서, 보다 빠르고 정확하게 서열 정력을 수행하는 알고리즘이 필요하게 되었다. 본 논문에서는 동적 프로그래밍 방식에서부터 전체 유전체 서열 알고리즘에 이르기까지 서열 정렬 알고리즘의 연구 동향을 분석하고자 한다.

  • PDF

Genetic Programming based Manufacutring Big Data Analytics (유전 프로그래밍을 활용한 제조 빅데이터 분석 방법 연구)

  • Oh, Sanghoun;Ahn, Chang Wook
    • Smart Media Journal
    • /
    • v.9 no.3
    • /
    • pp.31-40
    • /
    • 2020
  • Currently, black-box-based machine learning algorithms are used to analyze big data in manufacturing. This algorithm has the advantage of having high analytical consistency, but has the disadvantage that it is difficult to interpret the analysis results. However, in the manufacturing industry, it is important to verify the basis of the results and the validity of deriving the analysis algorithms through analysis based on the manufacturing process principle. To overcome the limitation of explanatory power as a result of this machine learning algorithm, we propose a manufacturing big data analysis method using genetic programming. This algorithm is one of well-known evolutionary algorithms, which repeats evolutionary operators such as selection, crossover, mutation that mimic biological evolution to find the optimal solution. Then, the solution is expressed as a relationship between variables using mathematical symbols, and the solution with the highest explanatory power is finally selected. Through this, input and output variable relations are derived to formulate the results, so it is possible to interpret the intuitive manufacturing mechanism, and it is also possible to derive manufacturing principles that cannot be interpreted based on the relationship between variables represented by formulas. The proposed technique showed equal or superior performance as a result of comparing and analyzing performance with a typical machine learning algorithm. In the future, the possibility of using various manufacturing fields was verified through the technique.

Designing for the Pattern of Cleaning Robot based on Genetic Progamming (유전 프로그래밍을 이용한 청소 로봇의 이동 패턴 계획)

  • Gwon, Soon-Joe;Lee, Jong-Hyun;Ahn, Chang Wook
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2014.11a
    • /
    • pp.924-927
    • /
    • 2014
  • 최근 주요 홈서비스 로봇 중 하나인 청소 로봇에 대한 수요가 증가하면서 주어진 공간을 효율적으로 처리하기 위한 높은 커버리지 성능이 주목받고 있다. 이에 따라 로봇의 커버리지 성능을 높이기 위하여 청소 로봇의 자율적인 운행을 통해 지도를 작성하고 이를 활용한 경로를 생성하여 로봇의 운행에 반영하였다. 하지만, 저가형 청소 로봇은 낮은 성능의 처리 성능을 가지고 있기 때문에 불가능하다. 이에 본 논문에서는 단순한 운행 기능만을 가지고 있는 청소 로봇의 이동 패턴을 유전 프로그래밍을 이용하여 최적의 운행 계획을 설계하는 기법을 제안한다. 또한 실험을 통해 제안 기법을 통해 생성된 이동 패턴이 기존 기법에 비해 높은 운행 효율성을 보장함을 확인 하였다.

Train Booking Agent with Adaptive Sentence Generation Using Interactive Genetic Programming (대화형 유전 프로그래밍을 이용한 적응적 문장생성 열차예약 에이전트)

  • Lim, Sung-Soo;Cho, Sung-Bae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.12 no.2
    • /
    • pp.119-128
    • /
    • 2006
  • As dialogue systems are widely required, the research on natural language generation in dialogue has raised attention. Contrary to conventional dialogue systems that reply to the user with a set of predefined answers, a newly developed dialogue system generates them dynamically and trains the answers to support more flexible and customized dialogues with humans. This paper proposes an evolutionary method for generating sentences using interactive genetic programming. Sentence plan trees, which stand for the sentence structures, are adopted as the representation of genetic programming. With interactive evolution process with the user, a set of customized sentence structures is obtained. The proposed method applies to a dialogue-based train booking agent and the usability test demonstrates the usefulness of the proposed method.

Diversity based Ensemble Genetic Programming for Improving Classification Performance (분류 성능 향상을 위한 다양성 기반 앙상블 유전자 프로그래밍)

  • Hong Jin-Hyuk;Cho Sung-Bae
    • Journal of KIISE:Software and Applications
    • /
    • v.32 no.12
    • /
    • pp.1229-1237
    • /
    • 2005
  • Combining multiple classifiers has been actively exploited to improve classification performance. It is required to construct a pool of accurate and diverse base classifier for obtaining a good ensemble classifier. Conventionally ensemble learning techniques such as bagging and boosting have been used and the diversify of base classifiers for the training set has been estimated, but there are some limitations in classifying gene expression profiles since only a few training samples are available. This paper proposes an ensemble technique that analyzes the diversity of classification rules obtained by genetic programming. Genetic programming generates interpretable rules, and a sample is classified by combining the most diverse set of rules. We have applied the proposed method to cancer classification with gene expression profiles. Experiments on lymphoma cancer dataset, prostate cancer dataset and ovarian cancer dataset have illustrated the usefulness of the proposed method. h higher classification accuracy has been obtained with the proposed method than without considering diversity. It has been also confirmed that the diversity increases classification performance.

A Genetic Programming Approach to Blind Deconvolution of Noisy Blurred Images (잡음이 있고 흐릿한 영상의 블라인드 디컨벌루션을 위한 유전 프로그래밍 기법)

  • Mahmood, Muhammad Tariq;Chu, Yeon Ho;Choi, Young Kyu
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.1
    • /
    • pp.43-48
    • /
    • 2014
  • Usually, image deconvolution is applied as a preprocessing step in surveillance systems to reduce the effect of motion or out-of-focus blur problem. In this paper, we propose a blind-image deconvolution filtering approach based on genetic programming (GP). A numerical expression is developed using GP process for image restoration which optimally combines and exploits dependencies among features of the blurred image. In order to develop such function, first, a set of feature vectors is formed by considering a small neighborhood around each pixel. At second stage, the estimator is trained and developed through GP process that automatically selects and combines the useful feature information under a fitness criterion. The developed function is then applied to estimate the image pixel intensity of the degraded image. The performance of developed function is estimated using various degraded image sequences. Our comparative analysis highlights the effectiveness of the proposed filter.

Shell platings manufacturing M/H inference and comparison using Artificial Neural Network and Gentic Programming (인공신경망과 유전적 프로그래밍을 이용한 선체 곡가공 M/H 추론 및 비교)

  • Shin, Yong-Wook;Ha, Duk-Ki;Jo, Moon-Hee;Kim, Su-Young
    • Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
    • /
    • 2003.10a
    • /
    • pp.163-166
    • /
    • 2003
  • Hull form designers have to design a ship with satisfying an economical, technical and environmental demand. When it is concerned by a technical and environmental demand, there will be a economical demand left to criticize optimization. In this case, there were used to be requirements which needs to meet only a best performance not concerning about input of Human resource. Life cycle's cost contains building cost and operation cost so that now we need to check Man Hour cost in building a ship. This research shows a correlation between hull form information, i.e. curvature, length, breadth and thickness of surface and Man Hour of the Shell plating manufacture with using Artificial Neural Network and Gentic Programming. This study will support to classify initial work, to have a high assumption possible through predicting a Man Hour and to provide a guide book to infer a building cost and a economical optimization hull form.

  • PDF