• 제목/요약/키워드: probability of mutation

Search Result 61, Processing Time 0.029 seconds

A Matrix-Based Genetic Algorithm for Structure Learning of Bayesian Networks

  • Ko, Song;Kim, Dae-Won;Kang, Bo-Yeong
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.11 no.3
    • /
    • pp.135-142
    • /
    • 2011
  • Unlike using the sequence-based representation for a chromosome in previous genetic algorithms for Bayesian structure learning, we proposed a matrix representation-based genetic algorithm. Since a good chromosome representation helps us to develop efficient genetic operators that maintain a functional link between parents and their offspring, we represent a chromosome as a matrix that is a general and intuitive data structure for a directed acyclic graph(DAG), Bayesian network structure. This matrix-based genetic algorithm enables us to develop genetic operators more efficient for structuring Bayesian network: a probability matrix and a transpose-based mutation operator to inherit a structure with the correct edge direction and enhance the diversity of the offspring. To show the outstanding performance of the proposed method, we analyzed the performance between two well-known genetic algorithms and the proposed method using two Bayesian network scoring measures.

Self-tuning of Strong Mutation Rate and Probability for Queen-Bee Evolution in Genetic Algorithms (유전자알고리즘에서 여왕벌 진화를 위한 강돌연변이 비율 및 확률의 자체조정)

  • Jung, Sung Hoon
    • Annual Conference of KIPS
    • /
    • 2011.11a
    • /
    • pp.245-248
    • /
    • 2011
  • 본 논문에서는 여왕벌 진화를 모방하여 개발한 유전자알고리즘에서 강돌연변이 수행비율 및 강돌연변이 확률을 자체적으로 조정하는 방법을 제안한다. 이렇게 함으로서 적절한 강돌연변이 수행비율 및 강돌연변이 확률을 여러 번의 실험을 통하여 경험적으로 선택하는 문제를 완화하여 여왕벌 진화의 적용을 보다 쉽게 할 수 있다. 3개의 최적화문제에 제안한 방법을 적용해 본 결과 비교적 우수한 성능을 보였다. 하지만 다수의 실험을 통하여 얻은 최고의 성능보다는 우수하지는 못했는데 추후 성능을 보다 더 개선하여 이에 근접한 성능을 얻을 수 있는 알고리즘의 개발이 필요하다.

Optical Interconnection Applied by Genetic Algorithm (유전 알고리즘을 적용한 광 상호연결)

  • Yoon, Jin-Seon;Kim, Nam
    • Journal of the Korean Institute of Telematics and Electronics D
    • /
    • v.36D no.7
    • /
    • pp.56-65
    • /
    • 1999
  • In this paper, a pixelated binary phase grating to generate $5{\times}5$ spots in designed using simple Genetic Algorithm(sGA) composed of selection, crossover, and mutation operators, and it can be applied for the optical interconnection. So as to adapt that GA is a robust and efficient schema, a chromosome is coded as a binary integer of length $32{\times}32$, the ranking method for decreasing the stochastic sampling error is performed, and a single-point crossover having $16{\times}16$ block size is used. A designed grating when the probabillty of mutation is 0.001, the probability of crossover is 0.75 and the population size is 300 has a 74.7[%] high diffraction efficiency and a $1.73{\times}10^{-1}$ uniformity quantitatively.

  • PDF

Genotype-Calling System for Somatic Mutation Discovery in Cancer Genome Sequence (암 유전자 배열에서 체세포 돌연변이 발견을 위한 유전자형 조사 시스템)

  • Park, Su-Young;Jung, Chai-Yeoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.12
    • /
    • pp.3009-3015
    • /
    • 2013
  • Next-generation sequencing (NGS) has enabled whole genome and transcriptome single nucleotide variant (SNV) discovery in cancer and method of the most fundamental being determining an individual's genotype from multiple aligned short read sequences at a position. Bayesian algorithm estimate parameter using posterior genotype probabilities and other method, EM algorithm, estimate parameter using maximum likelihood estimate method in observed data. Here, we propose a novel genotype-calling system and compare and analyze the effect of sample size(S = 50, 100 and 500) on posterior estimate of sequencing error rate, somatic mutation status and genotype probability. The result is that estimate applying Bayesian algorithm even for 50 of small sample size approached real parameter than estimate applying EM algorithm in small sample more accurately.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF

Improvement of evolution speed of individuals through hybrid reproduction of monogenesis and gamogenesis in genetic algorithms (유전자알고리즘에서 단성생식과 양성생식을 혼용한 번식을 통한 개체진화 속도향상)

  • Jung, Sung-Hoon
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.3
    • /
    • pp.45-51
    • /
    • 2011
  • This paper proposes a method to accelerate the evolution speed of individuals through hybrid reproduction of monogenesis and gamogenesis. Monogenesis as a reproduction method that bacteria or monad without sexual distinction divide into two individuals has an advantage for local search and gamogenesis as a reproduction method that individuals with sexual distinction mate and breed the offsprings has an advantages for keeping the diversity of individuals. These properties can be properly used for improvement of evolution speed of individuals in genetic algorithms. In this paper, we made relatively good individuals among selected parents to do monogenesis for local search and forced relatively bad individuals among selected parents to do gamogenesis for global search by increasing the diversity of chromosomes. The mutation probability for monogenesis was set to a lower value than that of original genetic algorithm for local search and the mutation probability for gamogenesis was set to a higher value than that of original genetic algorithm for global search. Experimental results with four function optimization problems showed that the performances of three functions were very good, but the performances of fourth function with distributed global optima were not good. This was because distributed global optima prevented individuals from steady evolution.

Analysis of Optimal Infiltraction Route using Genetic Algorithm (유전자 알고리즘을 이용한 최적침투경로 분석)

  • Bang, Soo-Nam;Sohn, Hyong-Gyoo;Kim, Sang-Pil;Kim, Chang-Jae;Heo, Joon
    • Korean Journal of Remote Sensing
    • /
    • v.27 no.1
    • /
    • pp.59-68
    • /
    • 2011
  • The analysis of optimal infiltration path is one of the representative fields in which the GIS technology can be useful for the military purpose. Usually the analysis of the optimal path is done with network data. However, for military purpose, it often needs to be done with raster data. Because raster data needs far more computation than network data, it is difficult to apply the methods usually used in network data, such as Dijkstra algorithm. The genetic algorithm, which has shown great outcomes in optimization problems, was applied. It was used to minimize the detection probability of infiltration route. 2D binary array genes and its crossover and mutation were suggested to solve this problem with raster data. 30 tests were performed for each population size, 500, 1000, 2000, and 3000. With each generation, more adoptable routes survived and made their children routes. Results indicate that as the generations increased, average detection probability decreased and the routes converged to the optimal path. Also, as the population size increases, more optimal routes were found. The suggested genetic algorithm successfully finds the optimal infiltration route, and it shows better performance with larger population.

Association of Ultrasonography Features of Follicular Thyroid Carcinoma With Tumor Invasiveness and Prognosis Based on WHO Classification and TERT Promoter Mutation

  • Myoung Kyoung Kim;Hyunju Park;Young Lyun Oh;Jung Hee Shin;Tae Hyuk Kim;Soo Yeon Hahn
    • Korean Journal of Radiology
    • /
    • v.25 no.1
    • /
    • pp.103-112
    • /
    • 2024
  • Objective: To investigate the association of ultrasound (US) features of follicular thyroid carcinoma (FTC) with tumor invasiveness and prognosis based on the World Health Organization (WHO) classification and telomerase reverse transcriptase (TERT) promoter mutations. Materials and Methods: This retrospective study included 54 surgically confirmed FTC patients with US images and TERT promoter mutations (41 females and 13 males; median age [interquartile range], 40 years [30-51 years]). The WHO classification consisted of minimally invasive (MI), encapsulated angioinvasive (EA), and widely invasive (WI) FTCs. Alternative classifications included Group 1 (MI-FTC and EA-FTC with wild type TERT), Group 2 (WI-FTC with wild type TERT), and Group 3 (EA-FTC and WI-FTC with mutant TERT). Each nodule was categorized according to the US patterns of the Korean Thyroid Imaging Reporting and Data System (K-TIRADS) and American College of Radiology-TIRADS (ACR-TIRADS). The Jonckheere-Terpstra and Cochran-Armitage tests were used for statistical analysis. Results: Among 54 patients, 29 (53.7%) had MI-FTC, 16 (29.6%) had EA-FTC, and nine (16.7%) had WI-FTC. In both the classifications, lobulation, irregular margins, and final assessment categories showed significant differences (all Ps ≤ 0.04). Furthermore, the incidences of lobulation, irregular margin, and high suspicion category tended to increase with increasing tumor invasiveness and worse prognosis (all Ps for trend ≤ 0.006). In the WHO groups, hypoechogenicity differed significantly among the groups (P = 0.01) and tended to increase in proportion as tumor invasiveness increased (P for trend = 0.02). In the alternative group, punctate echogenic foci were associated with prognosis (P = 0.03, P for trend = 0.03). Conclusion: Increasing tumor invasiveness and worsening prognosis in FTC based on the WHO classification and TERT promoter mutation results were positively correlated with US features that indicate malignant probability according to both K-TIRADS and ACR-TIRADS.

A Study on the Improvement of Vehicle Ride Comfort by Genetic Algorithms (유전자 알고리즘을 이용한 차량 승차감 개선에 관한 연구)

  • 백운태;성활경
    • Transactions of the Korean Society of Automotive Engineers
    • /
    • v.6 no.4
    • /
    • pp.76-85
    • /
    • 1998
  • Recently, Genetic Algorithm(GA) is widely adopted into a search procedure for structural optimization, which is a stochastic direct search strategy that mimics the process of genetic evolution. This methods consist of three genetics operations maned selection, crossover and mutation. Contrast to traditional optimal design techniques which use design sensitivity analysis results, GA, being zero-order method, is very simple. So, they can be easily applicable to wide area of design optimization problems. Also, owing to multi-point search procedure, they have higher probability of converge to global optimum compared to traditional techniques which take one-point search method. In this study, a method of finding the optimum values of suspension parameters is proposed by using the GA. And vehicle is modelled as planar vehicle having 5 degree-of-freedom. The generalized coordinates are vertical motion of passenger seat, sprung mass and front and rear unsprung mass and rotate(pitch) motion of sprung mass. For rapid converge and precluding local optimum, share function which distribute chromosomes over design bound is introduced. Elitist survival model, remainder stochastic sampling without replacement method, multi-point crossover method are adopted. In the sight of the improvement of ride comfort, good result can be obtained in 5-D.O.F. vehicle model by using GA.

  • PDF

Design of a Protected Server Network with Decoys for Network-based Moving Target Defense

  • Park, Tae-Keun;Park, Kyung-Min;Moon, Dae-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.23 no.9
    • /
    • pp.57-64
    • /
    • 2018
  • In recent years, a new approach to cyber security, called the moving target defense, has emerged as a potential solution to the challenge of static systems. In this paper, we design a protected server network with a large number of decoys to anonymize the protected servers that dynamically mutate their IP address and port numbers according to Hidden Tunnel Networking, which is a network-based moving target defense scheme. In the network, a protected server is one-to-one mapped to a decoy-bed that generates a number of decoys, and the decoys share the same IP address pool with the protected server. First, the protected server network supports mutating the IP address and port numbers of the protected server very frequently regardless of the number of decoys. Second, it provides independence of the decoy-bed configuration. Third, it allows the protected servers to freely change their IP address pool. Lastly, it can reduce the possibility that an attacker will reuse the discovered attributes of a protected server in previous scanning. We believe that applying Hidden Tunnel Networking to protected servers in the proposed network can significantly reduce the probability of the protected servers being identified and compromised by attackers through deploying a large number of decoys.