skip to main content
10.1145/2498328.2500048acmconferencesArticle/Chapter ViewAbstractPublication Pagesacm-seConference Proceedingsconference-collections
research-article

New genetic algorithm with a maximal information coefficient based mutation

Published:04 April 2013Publication History

ABSTRACT

In this paper, the Maximal Information Coefficient (MIC) will be used to modify the Genetic Algorithm (GA) in order to solve multi-variable optimization problems more efficiently and accurately. The MIC modified GA (MICGA) learns the problem structure by calculating the MIC. The original GA is compared to the MICGA and many other types of optimization algorithms to determine the most efficient optimization method.

References

  1. A. Das and B. Mahua. Affine-based registration of ct and mr modality images of human brain using multiresolution approaches: comparative study on genetic algorithm and particle swarm optimization. Neural Computing & Applications, 20(2):223--237, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. K. Deb. Genetic algorithm {computer program}, 2001.Google ScholarGoogle Scholar
  3. K. Deb, A. Anand, and D. Joshi. A computationaly efficient evolutionary algorithm for real-parameter optimization. Evolutionary Computation, 10. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. W. Gong, Z. Cai, C. X. Ling, and H. Li. A real-coded biogeography-based optimization with mutation, 2009.Google ScholarGoogle Scholar
  5. N. Hansen and A. Ostermeir. Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2):159--195, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. S. He, Q. Wu, and J. R. Saunders. Group search optimizer: An optimization algorithm inspired by animal searching behavior. IEEE Transactions on Evolutionary Computation, 13(5):973--990, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. J. Kennedy and R. Eberhart. Swarm Intelligence. Morgan Kaufmann, San Francisco, CA, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. A. Y. Lam, V. O. Li, and J. J. Yu. Real-coded chemical reaction optimization. IEEE Transactions on Evolutionary Computation, 16(3):339--353, 2012.Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. D. N. Reshef, Y. A. Reshef, H. K. Finucane, S. R. Grossman, G. McVean, P. J. Turnbaugh, E. S. Lander, M. Mitzenmacher, and P. C. Sabeti. Detecting novel associations in large data sets. Science Magazine, 334(6062):1518--1524, 2011.Google ScholarGoogle Scholar
  10. L. Sahoo, A. K. Bhunia, and P. K. Kapur. Genetic algorithm based multi-objective reliability optimization in interval environment. Computers & Industrial Engineering, 62(1):152--160, 2012. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. R. Storn and K. Price. Differential evolution - a simple and efficient heuristic for global optimization over continuous spaces. Journal of Global Optimization, 11(4):341--359, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H.-C. Tseng and J.-Y. Chen. Thermal analysis and packaging optimization of collector-up hbts using an enhanced genetic-algorithm methodology. Packaging & Manufacturing Technology, 2(2):231--239, 2012.Google ScholarGoogle ScholarCross RefCross Ref
  13. X. Yao and Y. Liu. Faster evoultion strategies. In Proc. 6th International Conference of Evolutionary Programming, pages 151--162, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. X. Yao, Y. Liu, and G. Lin. Evolutionary programming made faster. IEEE Transactions on Evolutionary Computation, 3(2):82--102, 1999. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. New genetic algorithm with a maximal information coefficient based mutation

              Recommendations

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in
              • Published in

                cover image ACM Conferences
                ACMSE '13: Proceedings of the 51st ACM Southeast Conference
                April 2013
                224 pages
                ISBN:9781450319010
                DOI:10.1145/2498328
                • General Chair:
                • Ashraf Saad

                Copyright © 2013 ACM

                Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

                Publisher

                Association for Computing Machinery

                New York, NY, United States

                Publication History

                • Published: 4 April 2013

                Permissions

                Request permissions about this article.

                Request Permissions

                Check for updates

                Qualifiers

                • research-article

                Acceptance Rates

                Overall Acceptance Rate178of377submissions,47%

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader