Skip to main content
Erschienen in: Soft Computing 5/2011

01.05.2011 | Focus

Using selfish gene theory to construct mutual information and entropy based clusters for bivariate optimizations

verfasst von: Feng Wang, Zhiyi Lin, Cheng Yang, Yuanxiang Li

Erschienen in: Soft Computing | Ausgabe 5/2011

Einloggen

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

search-config
loading …

Abstract

This paper proposes a new approach named SGMIEC in the field of estimation of distribution algorithm (EDA). While the current EDAs require much time in the statistical learning process as the relationships among the variables are too complicated, the selfish gene theory (SG) is deployed in this approach and a mutual information and entropy based cluster (MIEC) model with an incremental learning and resample scheme is also set to optimize the probability distribution of the virtual population. Experimental results on several benchmark problems demonstrate that, compared with BMDA, COMIT and MIMIC, SGMIEC often performs better in convergent reliability, convergent velocity and convergent process.

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!

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!

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!

Anhänge
Nur mit Berechtigung zugänglich
Literatur
Zurück zum Zitat Ahn CW, Ramakrishna RS (2008) On the scalability of real-coded bayesian optimization algorithm. IEEE Trans Evol Comput 12(3):307–322CrossRef Ahn CW, Ramakrishna RS (2008) On the scalability of real-coded bayesian optimization algorithm. IEEE Trans Evol Comput 12(3):307–322CrossRef
Zurück zum Zitat Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburgh Baluja S (1994) Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, Pittsburgh
Zurück zum Zitat Baluja S, Davies S (1997) Using optimal dependency-trees for combinational optimization. In: ICML ’97: Proceedings of the fourteenth international conference on machine learning, San Francisco, pp 30–38 Baluja S, Davies S (1997) Using optimal dependency-trees for combinational optimization. In: ICML ’97: Proceedings of the fourteenth international conference on machine learning, San Francisco, pp 30–38
Zurück zum Zitat Baluja S, Davies S (1998) Fast probabilistic modeling for combinatorial optimization. In: Proceedings of 15th national conference on artificial intelligence (AAAI), pp 469–476 Baluja S, Davies S (1998) Fast probabilistic modeling for combinatorial optimization. In: Proceedings of 15th national conference on artificial intelligence (AAAI), pp 469–476
Zurück zum Zitat Bonet J, Isbell CL, Viola P (1997) Mimic: finding optima by estimating probability densities. In: Advances in neural information processing systems, vol 9. MIT Press, Cambridge, pp 424–430 Bonet J, Isbell CL, Viola P (1997) Mimic: finding optima by estimating probability densities. In: Advances in neural information processing systems, vol 9. MIT Press, Cambridge, pp 424–430
Zurück zum Zitat Corno F, Reorda MS, Squillero G (1998a) A new evolutionary algorithm inspired by the selfish gene theory. In ICEC’98: IEEE international conference on evolutionary computation, pp 575–580 Corno F, Reorda MS, Squillero G (1998a) A new evolutionary algorithm inspired by the selfish gene theory. In ICEC’98: IEEE international conference on evolutionary computation, pp 575–580
Zurück zum Zitat Corno F, Reorda M, Squillero G (1998b) The selfish gene algorithm: a new evolutionary optimization strategy. In SAC98: 13th annual ACM symposium on applied computing, Atlanta, pp 349–355 Corno F, Reorda M, Squillero G (1998b) The selfish gene algorithm: a new evolutionary optimization strategy. In SAC98: 13th annual ACM symposium on applied computing, Atlanta, pp 349–355
Zurück zum Zitat Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley series in telecommunications and signal processing. Wiley, New York Cover TM, Thomas JA (2006) Elements of information theory, 2nd edn. Wiley series in telecommunications and signal processing. Wiley, New York
Zurück zum Zitat Dawkins R (1989) The selfish gene—new edition. Oxford University Press, Oxford Dawkins R (1989) The selfish gene—new edition. Oxford University Press, Oxford
Zurück zum Zitat Harik G (1999) Linkage learning via probabilistic modeling in the ecga. Technical report, University of Illinois at Urbana-Champaign Harik G (1999) Linkage learning via probabilistic modeling in the ecga. Technical report, University of Illinois at Urbana-Champaign
Zurück zum Zitat Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4):287–297CrossRef Harik GR, Lobo FG, Goldberg DE (1999) The compact genetic algorithm. IEEE Trans Evol Comput 3(4):287–297CrossRef
Zurück zum Zitat Harik GR, Lobo FG, Sastry K (2006) Linkage learning via probabilistic modeling in the extended compact genetic algorithm(ecga). In: Scalable optimization via probabilistic modeling, pp 39–61 Harik GR, Lobo FG, Sastry K (2006) Linkage learning via probabilistic modeling in the extended compact genetic algorithm(ecga). In: Scalable optimization via probabilistic modeling, pp 39–61
Zurück zum Zitat Hong Y, Kwong S, Wang H, Xie ZH, Ren Q (2008) Svpcga: Selection on virtual population based compact genetic algorithm. In: IEEE Congress on evolutionary computation, pp 265–272 Hong Y, Kwong S, Wang H, Xie ZH, Ren Q (2008) Svpcga: Selection on virtual population based compact genetic algorithm. In: IEEE Congress on evolutionary computation, pp 265–272
Zurück zum Zitat Larranaga P, Lozano J (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, BostonMATH Larranaga P, Lozano J (2002) Estimation of distribution algorithms: a new tool for evolutionary computation. Kluwer, BostonMATH
Zurück zum Zitat Muhlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions i. binary parameters. In PPSN IV: Proceedings of the 4th international conference on parallel problem solving from nature, London, pp 178–187 Muhlenbein H, Paass G (1996) From recombination of genes to the estimation of distributions i. binary parameters. In PPSN IV: Proceedings of the 4th international conference on parallel problem solving from nature, London, pp 178–187
Zurück zum Zitat Pelikan M, Muhlenbein H (1998) Marginal distribution in evolutionary algorithms. In In Proceedings of the international conference on genetic algorithms Mendel’98, pp 90–95 Pelikan M, Muhlenbein H (1998) Marginal distribution in evolutionary algorithms. In In Proceedings of the international conference on genetic algorithms Mendel’98, pp 90–95
Zurück zum Zitat Pelikan M, Muhlenbein H (1999) The bivariate marginal distribution algorithm. In: Advances in soft computing: engineering design and manufacturing. Springer, London, pp 521–535 Pelikan M, Muhlenbein H (1999) The bivariate marginal distribution algorithm. In: Advances in soft computing: engineering design and manufacturing. Springer, London, pp 521–535
Zurück zum Zitat Pelikan M, Goldberg DE, Cantu-Paz E (1999) Boa: the bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation conference (GECCO-99). Morgan Kaufmann, pp 525–532 Pelikan M, Goldberg DE, Cantu-Paz E (1999) Boa: the bayesian optimization algorithm. In Proceedings of the genetic and evolutionary computation conference (GECCO-99). Morgan Kaufmann, pp 525–532
Zurück zum Zitat Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542–561CrossRef Yang S, Yao X (2008) Population-based incremental learning with associative memory for dynamic environments. IEEE Trans Evol Comput 12(5):542–561CrossRef
Zurück zum Zitat Yang SY, Ho SL, Ni GZ, Machado JM, Wong KF (2007) A new implementation of population based incremental learning method for optimizations in electromagnetics. IEEE Trans Mag 43(4):1601–1604CrossRef Yang SY, Ho SL, Ni GZ, Machado JM, Wong KF (2007) A new implementation of population based incremental learning method for optimizations in electromagnetics. IEEE Trans Mag 43(4):1601–1604CrossRef
Zurück zum Zitat Yu T-L, Goldberg DE (2004) Dependency structure matrix analysis: offline utility of the dependency structure matrix genetic algorithm. In GECCO (2), pp 355–366 Yu T-L, Goldberg DE (2004) Dependency structure matrix analysis: offline utility of the dependency structure matrix genetic algorithm. In GECCO (2), pp 355–366
Zurück zum Zitat Yu T-L, Sastry K, Goldberg DE, Pelikan M (2007) Population sizing for entropy-based model building in discrete estimation of distribution algorithms. In GECCO, pp 601–608 Yu T-L, Sastry K, Goldberg DE, Pelikan M (2007) Population sizing for entropy-based model building in discrete estimation of distribution algorithms. In GECCO, pp 601–608
Zurück zum Zitat Zhang Q, Zhou A, Jin Y (2008) Rm-meda: A regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41–63CrossRef Zhang Q, Zhou A, Jin Y (2008) Rm-meda: A regularity model-based multiobjective estimation of distribution algorithm. IEEE Trans Evol Comput 12(1):41–63CrossRef
Zurück zum Zitat Zhou A, Zhang Q, Jin Y, Sendhoff B (2008) Combination of eda and de for continuous biobjective optimization. In: IEEE congress on evolutionary computation, pp 1447–1454 Zhou A, Zhang Q, Jin Y, Sendhoff B (2008) Combination of eda and de for continuous biobjective optimization. In: IEEE congress on evolutionary computation, pp 1447–1454
Metadaten
Titel
Using selfish gene theory to construct mutual information and entropy based clusters for bivariate optimizations
verfasst von
Feng Wang
Zhiyi Lin
Cheng Yang
Yuanxiang Li
Publikationsdatum
01.05.2011
Verlag
Springer-Verlag
Erschienen in
Soft Computing / Ausgabe 5/2011
Print ISSN: 1432-7643
Elektronische ISSN: 1433-7479
DOI
https://doi.org/10.1007/s00500-010-0557-3

Weitere Artikel der Ausgabe 5/2011

Soft Computing 5/2011 Zur Ausgabe