Simple Linkage Identification Using Genetic Clustering

  • Kei OhnishiEmail author
  • Chang Wook Ahn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 10593)


The paper proposes a simple linkage identification method for binary optimization problems. The method is basically equivalent to the genetic clustering method, called GC, inspired by the speciation due to segregation distortion genes that was previously proposed by us. A genetic algorithm using the method, called GAuGC, is also proposed. The GAuGC is applied to decomposable, nearly decomposable, and indecomposable problems. The results show that the GAuGC better solves problems with weak decomposability than the linkage tree genetic algorithm for comparison and also show that it cannot handle the deception well.


Genetic algorithm Genetic clustering Linkage identification Data clustering Decomposability 


  1. 1.
    Barabasi, A.L., Albert, R.: Emergence of scaling in random networks. Science 286, 509–512 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Beasley, J.E.: Or-library, multidimensional knapsack problem (1990).
  3. 3.
    Bosman, P.A.N., Thierens, D.: More concise and robust linkage learning by filtering and combining linkage hierarchies. In: 2013 Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 359–366 (2013)Google Scholar
  4. 4.
    Bu, T., Towsley, D.: On distinguishing between internet power law topology generators. In: Proceedings of IEEE INFOCOM 2002, pp. 638–647 (2003)Google Scholar
  5. 5.
    Chu, P.C., Beasley, J.E.: A genetic algorithm for the multidimensional knapsack problem. Heuristics 4, 63–86 (1998)CrossRefzbMATHGoogle Scholar
  6. 6.
    Deb, K., Goldberg, D.E.: Analyzing deception in trap functions. Found. Genet. Algorithms 2, 93–108 (1993)Google Scholar
  7. 7.
    Hamano, K., Ohnishi, K., Köppen, M.: Evolution of developmental timing for solving hierarchically dependent deceptive problems. In: Dick, G., et al. (eds.) SEAL 2014. LNCS, vol. 8886, pp. 58–69. Springer, Cham (2014). doi: 10.1007/978-3-319-13563-2_6 Google Scholar
  8. 8.
    Harik, G.: Learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, Illinois Genetic Algorithms Lab., Univ. of Illinois, Urbana, IL (1999)Google Scholar
  9. 9.
    Hsu, S.H., Yu, T.L.: Optimization by pairwise linkage detection, incremental linkage set, and restricted/back mixing: DSMGA-II. In: 2015 Genetic and Evolutionary Computation Conference (GECCO 2015), pp. 519–526 (2015)Google Scholar
  10. 10.
    Kauffman, S.A., Weinberger, E.D.: The NK model of rugged fitness landscapes and its application to maturation of the immune response. Theoret. Biol. 141(2), 211–245 (1989)CrossRefGoogle Scholar
  11. 11.
    Larranaga, P., Lozano, J.A.: Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer Academic Publishers, Dordrecht (2001)zbMATHGoogle Scholar
  12. 12.
    Martins, J.P., Fonseca, C.M., Delbem, A.C.: On the performance of linkage-tree genetic algorithms for the multidimensional knapsack problem. Neurocomputing 146(C), 17–29 (2014)CrossRefGoogle Scholar
  13. 13.
    Munetomo, M.: Linkage identification with epistasis measure considering monotonicity condition. In: 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 550–554 (2002)Google Scholar
  14. 14.
    Ohnishi, K., Koeppen, M., Ahn, C.W., Yoshida, K.: Genetic clustering based on segregation distortion caused by selfish genes. In: Proceedings of 2012 IEEE International Conference on Systems, Man, and Cybernetics (IEEE SMC 2012) (2012)Google Scholar
  15. 15.
    Pelikan, M., Goldberg, D.E.: Hierarchical problem solving and the Bayesian optimization algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2000), pp. 267–274 (2000)Google Scholar
  16. 16.
    Pelikan, M., Goldberg, D.E., Lobo, F.: A survey of optimization by building and using probabilistic models. IlliGAL Report No. 99018, Illinois Genetic Algorithms Lab., Univ. of Illinois, Urbana, IL (1999)Google Scholar
  17. 17.
    Thierens, D., Bosman, P.: Hierarchical problem solving with the linkage tree genetic algorithm. In: Proceedings of Genetic and Evolutionary Computation Conference (GECCO 2013), pp. 877–884 (2013)Google Scholar
  18. 18.
    Thierens, D., Goldberg, D.E.: Mixing in genetic algorithms. In: Proceedings of 5th International Conference on Genetic Algorithms (ICGA-1993). pp. 38–45 (1993)Google Scholar
  19. 19.
    Yu, T.L., Goldberg, D.E., Sastry, K., Lima, C.F., Pelikan, M.: Dependency structure matrix, genetic algorithms, and effective recombination. Evol. Comput. 17(4), 595–626 (2009)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Kyushu Institute of TechnologyFukuokaJapan
  2. 2.Gwangju Institute of Science and Techology (GIST)GwangjuKorea

Personalised recommendations