nach oben

AI & SOCIETY

Erschienen in:

28.08.2015 | Open Forum

On the applicability of diploid genetic algorithms

verfasst von: Harsh Bhasin, Sushant Mehta

Erschienen in: AI & SOCIETY | Ausgabe 2/2016

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

The heuristic search processes like simple genetic algorithms help in achieving optimization but do not guarantee robustness so there is an immediate need of a machine learning technique that also promises robustness. Diploid genetic algorithms ensure consistent results and can therefore replace Simple genetic algorithms in applications such as test data generation and regression testing, where robustness is more important. However, there is a need to review the work that has been done so far in the field. It is also important to analyse the applicability of the premise of the dominance techniques applied so far in order to implement the technique. The work presents a systematic review of diploid genetic algorithms, examines the premise of the dominance relation used in different works and discusses the future scope. The work also discusses the biological basis of evaluating dominance. The work is important as the future of machine learning relies on techniques that are robust as well as efficient.

Vorheriger Artikel Toward a better self-regulation: degree of certainty through fuzzy logic in a formative assessment

Nächster Artikel Growth strategy for Finnish science parks under external economic crises

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Agrawal H, Horgan JR, Krauser EW, London S (1993) Incremental regression testing. In: Proc. ICSM, pp 348–357

Alberts B, Johnson A, Lewis J, Raff M, Roberts K, Walters P (2002) Molecular biology of the cell, 4th edn. Garland Science, New York. ISBN 0-8153-3218-1, OCLC 145080076 48122761 57023651 69932405

Bagley JD (1967) The behaviour of adaptive systems which employ genetic and correlation algorithms. PhD thesis, University of Michigan, Ann Arbor, MI (University Microfilms No. 68-7556)

Bartolini C, Bertolino A, Sebastian G, Elbaum S, Marchett E (2011) Bringing white-box testing to service oriented architectures through a service oriented approach. J Syst Softw 84(4):655–668CrossRef

Berg J, Tymoczko JL, Stryer L (2006) Biochemistry, 6th edn. W. H. Freeman, San Francisco. ISBN 0-7167-8724-5

Bertolino A (2008) Software testing forever: old and new processes and techniques for Validating Today’s Applications, Keynote at 9th international conference product-focused software process improvement (PROFES 2008), Monte PorzioCatone, June 2008, LNCS 5089, p 1

Bhasin H, Singla N (2012a) Genetic based algorithm for N-puzzle problem. Int J Comput Appl 51(22):44–50

Bhasin H, Singla N (2012b) Harnessing cellular automata and genetic algorithms to solve travelling salesman problem. In: Proceedings of international conference on information computing and telecommunication, pp 72–77

Bhasin H, Singla N (2013a) Cellular Automata based test data generation. ACM Sigsoft Softw Eng Notes 38(4):1–7CrossRef

Bhasin H, Singla N (2013b) Cellular genetic test data generation. ACM Sigsoft Softw Eng Notes 38(5):1–7CrossRef

Bhasin H, Behal G, Aggarwal N, Saini RK, Choudhary S (2014) On the applicability of diploid genetic algorithms in dynamic environments. In: Soft computing and machine intelligence (ISCMI), 2014 international conference on, pp 94, 97. doi:10.1109/ISCMI.2014.27

Bhasin H, Behal G, Aggarwal N, Saini RK, Choudhary S (2015) On the applicability of diploid genetic algorithms in dynamic environments. Soft Comput. doi:10.1007/s00500-015-1803-5

Branke J (2001) Evolutionary optimization in dynamic environments. Kluwer, Norwell. ISBN:0792376315

Campbell N (1996) Biology, fourth edition. The Benjamin/Cummings Publishing Company, p 309, 310. ISBN 0-8053-1940-9

Crick F (1970) Central dogma of molecular biology. Nature 227(5258):561–563CrossRef

Dijkstra EW (1959) A note on two problems in connection with graphs. Numer Math 1:269–271. doi:10.1007/BF01386390 MathSciNetCrossRefMATH

Freeman WH, Griffiths A (2008) Introduction to genetic analysis, 9th edn. W.H. Freeman and Company, New York, pp 335–339. ISBN 978-0-7167-6887-6 and Company pp 826 ISBN 0-7167-4684-0

Goldberg DE (1989) Genetic algorithms in search, optimization and machine learning. Addison and Wesley, Reading

Goldberg DE, Richardson J (1987a) Genetic algorithms with sharing for multimodal function optimization. In: Proceedings of the second international conference in genetic algorithms, pp 41–49

Goldberg DE, Smith R (1987b) Nonstationary function optimization using genetic algorithms with dominance and diploidy. In: Proceedings of the second international conference of genetic algorithms, pp 59–68

Hausner W, Michael T (2001) Events during initiation of archaeal transcription: open complex formation and DNA–protein interactions. J Bacteriol 183(10):3025–3031CrossRef

Higgs PG (2000) RNA secondary structure: physical and computational aspects. Q Rev Biophys 33(3):199–253CrossRef

Hillis D (1992) Coevolving parasites improve simulated evolution as an optimization procedure. Artificial Life II

Hollstein RB (1971) Artificial genetic adaptation in computer control systems Ph.D. Thesis University of Michigan

Kitchenham BA (2012) Systematic review in software engineering: where we are and where we should be going. In: Proceedings of the 2nd international workshop on evidential assessment of software technologies, pp 1–2

Lee S, Rowlands H (2005) Finding robust optima with a diploid genetic algorithm. Int J Simul 6(9):73–80

Lewis J, Hart E, Ritchiew G (2004) A comparison of dominance mechanisms and simple mutation on non-stationary problems. In: The PPSN V proceedings of the 5th international conference on parallel problem solving from nature, pp 139–148

Liekens AML, Eikelder HMMT, Hilbers PAJ (2003) Modelling and simulating diploid simple genetic algorithms foundations of genetic algorithms VII (FOGA VII) Malaga, Spain

Mitchell M (1996) An introduction to genetic algorithms. MIT Press, CambridgeMATH

Ng KP, Wong KC (1995) A new diploid scheme and dominance change mechanism for non-stationary function optimisation. In: Proceedings of the 6th international conference on genetic algorithms, pp 159–166

Nissen P, Hansen J, Ban N, Moore PB, Steitz TA (2000) The structural basis of ribosome activity in peptide bond synthesis. Science 289(5481):920–930CrossRef

Rosenberg RS (1967) Simulation of genetic populations with biochemical properties. Doctoral Dissertation, University of Michigan Dissertation Abstracts International, volume 28, issue no. 7, p 2732B

Rosenberg RS (1970a) Simulation of genetic populations with biochemical properties: I. The model. Math Biosci 7:223–257CrossRef

Rosenberg RS (1970b) Simulation of genetic populations with biochemical properties: II. Selection of crossover probabilities. Math Biosci 8:1–37CrossRef

Russell P (2001) Genetics. Benjamin Cummings, New York. ISBN 0-8053-4553-1

Ryan C (1994) The degree of oneness. In: Proceedings of the 1994 ECAI workshop on genetic algorithms

Saenger W (1984) Principles of nucleic acid structure. Springer, New York. ISBN 0-387-90762-9CrossRef

Schafer R (2009) Using a diploid genetic algorithm to create and maintain a complex system in dynamic equilibrium, Stanford University

Solomon EP, Berg LR, Martin DW (2004) Biology, 8th edition, international student edition. Thomson Brooks/Cole. ISBN 978-0-495-30978-8

Tinoco I, Bustamante C (1999) How RNA folds. J Mol Biol 293(2):271–281CrossRef

Watson JD, Crick FHC (1953) A structure for deoxyribose nucleic acid. Nature 171(4356):737–738CrossRef

Weicker K, Weicker N (2001) Burden and benefits of redundancy. Found Genet Algorithms 6:313–333CrossRefMATH

Yang S (2003) Non-stationary problem optimization using the primal-dual genetic algorithm. In: Proceedings of the 2003 congress on evolutionary computation, volume 3, pp 2246–2253

Yang S (2006) On the design of diploid genetic algorithms for problem optimization in dynamic environments evolutionary computation, IEEE congress

Yang S, Yao X (2005) Experimental study on population-based incremental learning algorithms for dynamic optimization problems. Soft Comput 9(11):815–834CrossRefMATH

Yang S, Zeng SLY, Zhang Q, Kang L (2007) Learning the dominance in diploid genetic algorithms for changing optimization problems. In: Proceedings of the 2nd International Symposium on Intelligence Computation and Applications, pp 157–162

Yoo S, Harman M (2012) Regression testing minimization, selection and prioritization: a survey. Softw Test Verif Reliab 22(2):67–120. doi:10.1002/stv.430 CrossRef

Yukiko Y, Nobue A (1984) A diploid genetic algorithm for preserving population diversity—Pseudo Meiosis GA. In: Parallel problem solving from nature lecture notes in computer science, volume 886, pp 36–45

Titel: On the applicability of diploid genetic algorithms
verfasst von: Harsh Bhasin
Sushant Mehta
Publikationsdatum: 28.08.2015
Verlag: Springer London
Erschienen in: AI & SOCIETY / Ausgabe 2/2016
Print ISSN: 0951-5666
Elektronische ISSN: 1435-5655
DOI: https://doi.org/10.1007/s00146-015-0591-x

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Springer Professional "Technik"

Weitere Artikel der Ausgabe 2/2016

Human, machines, and the interpretation of formal systems

Bernhard Irrgang: Critics of technological lifeworld, collection of philosophical essays

Presence: Is it just pretending?

Thirty years on

Artificial supper intelligence: beyond rhetoric

Auto-Catastrophic Theory: the necessity of self-destruction for the formation, survival, and termination of systems