• 제목/요약/키워드: quantum genetic algorithm

Search Result 12, Processing Time 0.027 seconds

Feature Selection and Performance Analysis using Quantum-inspired Genetic Algorithm (양자 유전알고리즘을 이용한 특징 선택 및 성능 분석)

  • Heo, G.S.;Jeong, H.T.;Park, A.;Baek, S.J.
    • Smart Media Journal
    • /
    • v.1 no.1
    • /
    • pp.36-41
    • /
    • 2012
  • Feature selection is the important technique of selecting a subset of relevant features for building robust pattern recognition systems. Various methods have been studied for feature selection from sequential search algorithms to stochastic algorithms. In this work, we adopted a Quantum-inspired Genetic Algorithm (QGA) which is based on the concept and principles of quantum computing such as Q-bits and superposition of state for feature selection. The performance of QGA is compared to that of the Conventional Genetic Algorithm (CGA) with respect to the classification rates and the number of selected features. The experimental result using UCI data sets shows that QGA is superior to CGA.

  • PDF

An Application of Quantum-inspired Genetic Algorithm for Weapon Target Assignment Problem (양자화 유전자알고리즘을 이용한 무기할당)

  • Kim, Jung Hun;Kim, Kyeongtaek;Choi, Bong-Wan;Suh, Jae Joon
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.40 no.4
    • /
    • pp.260-267
    • /
    • 2017
  • Quantum-inspired Genetic Algorithm (QGA) is a probabilistic search optimization method combined quantum computation and genetic algorithm. In QGA, the chromosomes are encoded by qubits and are updated by quantum rotation gates, which can achieve a genetic search. Asset-based weapon target assignment (WTA) problem can be described as an optimization problem in which the defenders assign the weapons to hostile targets in order to maximize the value of a group of surviving assets threatened by the targets. It has already been proven that the WTA problem is NP-complete. In this study, we propose a QGA and a hybrid-QGA to solve an asset-based WTA problem. In the proposed QGA, a set of probabilistic superposition of qubits are coded and collapsed into a target number. Q-gate updating strategy is also used for search guidance. The hybrid-QGA is generated by incorporating both the random search capability of QGA and the evolution capability of genetic algorithm (GA). To observe the performance of each algorithm, we construct three synthetic WTA problems and check how each algorithm works on them. Simulation results show that all of the algorithm have good quality of solutions. Since the difference among mean resulting value is within 2%, we run the nonparametric pairwise Wilcoxon rank sum test for testing the equality of the means among the results. The Wilcoxon test reveals that GA has better quality than the others. In contrast, the simulation results indicate that hybrid-QGA and QGA is much faster than GA for the production of the same number of generations.

High Utility Itemset Mining over Uncertain Datasets Based on a Quantum Genetic Algorithm

  • Wang, Ju;Liu, Fuxian;Jin, Chunjie
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.8
    • /
    • pp.3606-3629
    • /
    • 2018
  • The discovered high potential utility itemsets (HPUIs) have significant influence on a variety of areas, such as retail marketing, web click analysis, and biological gene analysis. Thus, in this paper, we propose an algorithm called HPUIM-QGA (Mining high potential utility itemsets based on a quantum genetic algorithm) to mine HPUIs over uncertain datasets based on a quantum genetic algorithm (QGA). The proposed algorithm not only can handle the problem of the non-downward closure property by developing an upper bound of the potential utility (UBPU) (which prunes the unpromising itemsets in the early stage) but can also handle the problem of combinatorial explosion by introducing a QGA, which finds optimal solutions quickly and needs to set only very few parameters. Furthermore, a pruning strategy has been designed to avoid the meaningless and redundant itemsets that are generated in the evolution process of the QGA. As proof of the HPUIM-QGA, a substantial number of experiments are performed on the runtime, memory usage, analysis of the discovered itemsets and the convergence on real-life and synthetic datasets. The results show that our proposed algorithm is reasonable and acceptable for mining meaningful HPUIs from uncertain datasets.

Quantum Bacterial Foraging Optimization for Cognitive Radio Spectrum Allocation

  • Li, Fei;Wu, Jiulong;Ge, Wenxue;Ji, Wei
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.2
    • /
    • pp.564-582
    • /
    • 2015
  • This paper proposes a novel swarm intelligence optimization method which integrates bacterial foraging optimization (BFO) with quantum computing, called quantum bacterial foraging optimization (QBFO) algorithm. In QBFO, a multi-qubit which can represent a linear superposition of states in search space probabilistically is used to represent a bacterium, so that the quantum bacteria representation has a better characteristic of population diversity. A quantum rotation gate is designed to simulate the chemotactic step for the sake of driving the bacteria toward better solutions. Several tests are conducted based on benchmark functions including multi-peak function to evaluate optimization performance of the proposed algorithm. Numerical results show that the proposed QBFO has more powerful properties in terms of convergence rate, stability and the ability of searching for the global optimal solution than the original BFO and quantum genetic algorithm. Furthermore, we examine the employment of our proposed QBFO for cognitive radio spectrum allocation. The results indicate that the proposed QBFO based spectrum allocation scheme achieves high efficiency of spectrum usage and improves the transmission performance of secondary users, as compared to color sensitive graph coloring algorithm and quantum genetic algorithm.

Optimal Scheme of Retinal Image Enhancement using Curvelet Transform and Quantum Genetic Algorithm

  • Wang, Zhixiao;Xu, Xuebin;Yan, Wenyao;Wei, Wei;Li, Junhuai;Zhang, Deyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.11
    • /
    • pp.2702-2719
    • /
    • 2013
  • A new optimal scheme based on curvelet transform is proposed for retinal image enhancement (RIE) using real-coded quantum genetic algorithm. Curvelet transform has better performance in representing edges than classical wavelet transform for its anisotropy and directional decomposition capabilities. For more precise reconstruction and better visualization, curvelet coefficients in corresponding subbands are modified by using a nonlinear enhancement mapping function. An automatic method is presented for selecting optimal parameter settings of the nonlinear mapping function via quantum genetic search strategy. The performance measures used in this paper provide some quantitative comparison among different RIE methods. The proposed method is tested on the DRIVE and STARE retinal databases and compared with some popular image enhancement methods. The experimental results demonstrate that proposed method can provide superior enhanced retinal image in terms of several image quantitative evaluation indexes.

A Study on Characteristics of Null Pattern Synthesis Algorithm Using Quantum-inspired Evolutionary Algorithm (양자화 진화알고리즘을 적용한 널 패턴합성 알고리즘의 특성 연구)

  • Seo, Jongwoo;Park, Dongchul
    • Journal of the Korea Institute of Military Science and Technology
    • /
    • v.19 no.4
    • /
    • pp.492-499
    • /
    • 2016
  • Null pattern synthesis method using the Quantum-inspired Evolutionary Algorithm(QEA) is described in this study. A $12{\times}12$ planar array antenna is considered and each element of the array antenna is controlled by 6-bit phase shifter. The maximum number of iteration of 500 is used in simulation and the rotation angle for updating Q-bit individuals is determined to make the individual converge to the best solution and is summarized in a look-up table. In this study we showed that QEA can satisfactorily synthesize the null pattern using smaller number of individuals compared with the conventional Genetic Algorithm.

Time Series Perturbation Modeling Algorithm : Combination of Genetic Programming and Quantum Mechanical Perturbation Theory (시계열 섭동 모델링 알고리즘 : 운전자 프로그래밍과 양자역학 섭동이론의 통합)

  • Lee, Geum-Yong
    • The KIPS Transactions:PartB
    • /
    • v.9B no.3
    • /
    • pp.277-286
    • /
    • 2002
  • Genetic programming (GP) has been combined with quantum mechanical perturbation theory to make a new algorithm to construct mathematical models and perform predictions for chaotic time series from real world. Procedural similarities between time series modeling and perturbation theory to solve quantum mechanical wave equations are discussed, and the exemplary GP approach for implementing them is proposed. The approach is based on multiple populations and uses orthogonal functions for GP function set. GP is applied to original time series to get the first mathematical model. Numerical values of the model are subtracted from the original time series data to form a residual time series which is again subject to GP modeling procedure. The process is repeated until predetermined terminating conditions are met. The algorithm has been successfully applied to construct highly effective mathematical models for many real world chaotic time series. Comparisons with other methodologies and topics for further study are also introduced.

An Optimized Deployment Mechanism for Virtual Middleboxes in NFV- and SDN-Enabling Network

  • Xiong, Gang;Sun, Penghao;Hu, Yuxiang;Lan, Julong;Li, Kan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3474-3497
    • /
    • 2016
  • Network Function Virtualization (NFV) and Software Defined Networking (SDN) are recently considered as very promising drivers of the evolution of existing middlebox services, which play intrinsic and fundamental roles in today's networks. To address the virtual service deployment issues that caused by introducing NFV or SDN to networks, this paper proposes an optimal solution by combining quantum genetic algorithm with cooperative game theory. Specifically, we first state the concrete content of the service deployment problem and describe the system framework based on the architecture of SDN. Second, for the service location placement sub-problem, an integer linear programming model is built, which aims at minimizing the network transport delay by selecting suitable service locations, and then a heuristic solution is designed based on the improved quantum genetic algorithm. Third, for the service amount placement sub-problem, we apply the rigorous cooperative game-theoretic approach to build the mathematical model, and implement a distributed algorithm corresponding to Nash bargaining solution. Finally, experimental results show that our proposed method can calculate automatically the optimized placement locations, which reduces 30% of the average traffic delay compared to that of the random placement scheme. Meanwhile, the service amount placement approach can achieve the performance that the average metric values of satisfaction degree and fairness index reach above 90%. And evaluation results demonstrate that our proposed mechanism has a comprehensive advantage for network application.

Quantitative Structure-Activity Relationship(QSAR) Study of New Fluorovinyloxycetamides

  • Jo, Du Ho;Lee, Seong Gwang;Kim, Beom Tae;No, Gyeong Tae
    • Bulletin of the Korean Chemical Society
    • /
    • v.22 no.4
    • /
    • pp.388-394
    • /
    • 2001
  • Quantitative Structure-Activity Relationship (QSAR) have been established of 57 fluorovinyloxyacetamides compounds to correlate and predict EC50 values. Genetic algorithm (GA) and multiple linear regression analysis were used to select the descriptors and to generate the equations that relate the structural features to the biological activities. This equation consists of three descriptors calculated from the molecular structures with molecular mechanics and quantum-chemical methods. The results of MLR and GA show that dipole moment of z-axis, radius of gyration and logP play an important role in growth inhibition of barnyard grass.

Analysis of Tunnelling Rate Effect on Single Electron Transistor

  • Sheela, L.;Balamurugan, N.B.;Sudha, S.;Jasmine, J.
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.5
    • /
    • pp.1670-1676
    • /
    • 2014
  • This paper presents the modeling of Single Electron Transistor (SET) based on Physical model of a device and its equivalent circuit. The physical model is derived from Schrodinger equation. The wave function of the electrode is calculated using Hartree-Fock method and the quantum dot calculation is obtained from WKB approximation. The resulting wave functions are used to compute tunneling rates. From the tunneling rate the current is calculated. The equivalent circuit model discuss about the effect of capacitance on tunneling probability and free energy change. The parameters of equivalent circuit are extracted and optimized using genetic algorithm. The effect of tunneling probability, temperature variation effect on tunneling rate, coulomb blockade effect and current voltage characteristics are discussed.