{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T22:13:46Z","timestamp":1673216026504},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,5,24]],"date-time":"2006-05-24T00:00:00Z","timestamp":1148428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2007,1,17]]},"DOI":"10.1007\/s00500-006-0097-z","type":"journal-article","created":{"date-parts":[[2006,5,24]],"date-time":"2006-05-24T11:06:47Z","timestamp":1148468807000},"page":"541-548","source":"Crossref","is-referenced-by-count":5,"title":["Building-block Identification by Simultaneity Matrix"],"prefix":"10.1007","volume":"11","author":[{"given":"Chatchawit","family":"Aporntewan","sequence":"first","affiliation":[]},{"given":"Prabhas","family":"Chongstitvatana","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,24]]},"reference":[{"key":"97_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A connectionist machine for genetic hillclimbing","author":"DH Ackley","year":"1987","unstructured":"Ackley DH (1987) A connectionist machine for genetic hillclimbing. Kluwer, Boston"},{"key":"97_CR2","first-page":"1566","volume-title":"Proceedings of genetic and evolutionary computation conference","author":"C Aporntewan","year":"2003","unstructured":"Aporntewan C, Chongstitvatana P (2003) Building-block identification by simultaneity matrix. In: Cant-\u00faPaz E et\u00a0al (eds) Proceedings of genetic and evolutionary computation conference. Springer, Berlin Heidelberg New York, pp 1566\u20131567"},{"key":"97_CR3","first-page":"877","volume-title":"Proceedings of genetic and evolutionary computation conference","author":"C Aporntewan","year":"2004","unstructured":"Aporntewan C, Chongstitvatana P (2004) Simultaneity matrix for solving hierarchically decomposable functions. In: Deb K et\u00a0al (eds) Proceedings of genetic and evolutionary computation conference. Springer, Berlin Heidelberg New York, pp 877\u2013888"},{"key":"97_CR4","volume-title":"Population-based incremental learning: a method for integrating genetic search based function optimization and competitive learning","author":"S Baluja","year":"1994","unstructured":"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, PA"},{"key":"97_CR5","first-page":"424","volume-title":"Advances in neural information processing systems, vol 9","author":"JS De Bonet","year":"1997","unstructured":"De Bonet JS, Isbell CL, Viola P (1997) MIMIC: finding optima by estimating probability densities. In: Mozer MC, Jordan MI, Petsche T (eds) Advances in neural information processing systems, vol 9. MIT, Cambridge, pp 424\u2013431"},{"key":"97_CR6","first-page":"338","volume-title":"Proceedings of the 7th international conference on genetic algorithms","author":"KA De Jong","year":"1997","unstructured":"De Jong KA, Potter MA, Spears WM (1997) Using problem generators to explore the effects of epistasis. In: B\u00e4ck T (eds) Proceedings of the 7th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 338\u2013345"},{"key":"97_CR7","volume-title":"Genetic algorithms in search optimization and machine learning","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE (1989) Genetic algorithms in search optimization and machine learning. Addison Wesley, Reading"},{"key":"97_CR8","first-page":"493","volume-title":"Complex systems, vol 3, no 5","author":"DE Goldberg","year":"1989","unstructured":"Goldberg DE, Korb B, Deb K (1989) Messy genetic algorithms: motivation, analysis and first results. In: Wolfram S (eds) Complex systems, vol 3, no 5. Complex Systems Publications Inc., Champaign, pp 493\u2013530"},{"key":"97_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3643-4","volume-title":"The design of innovation: lessons from and for competent genetic algorithms","author":"DE Goldberg","year":"2002","unstructured":"Goldberg DE (2002) The design of innovation: lessons from and for competent genetic algorithms. Kluwer, Boston"},{"key":"97_CR10","first-page":"247","volume-title":"Foundation of genetic algorithms 4","author":"GR Harik","year":"1997","unstructured":"Harik GR (1997) Learning linkage. In: Belew RK, Vose MD (eds) Foundation of genetic algorithms 4. Morgan Kaufmann, San Francisco, pp 247\u2013262"},{"key":"97_CR11","unstructured":"Harik GR (1999) Linkage learning via probabilistic modeling in the ECGA. Technical Report 99010, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Champaign, IL"},{"key":"97_CR12","first-page":"183","volume-title":"Foundation of genetic algorithms 5","author":"D Heckerman","year":"1999","unstructured":"Heckerman D, Geiger D, Chickering M (1999) Test function generators as embedded landscapes. In: Banzhaf W, Reeves C (eds) Foundation of genetic algorithms 5. Morgan Kaufmann, San Francisco, pp 183\u2013198"},{"key":"97_CR13","volume-title":"Adaptation in natural and artificial systems","author":"JH Holland","year":"1975","unstructured":"Holland JH (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI"},{"key":"97_CR14","first-page":"373","volume-title":"Evolutionary computation, vol 8, no 4","author":"JH Holland","year":"2000","unstructured":"Holland JH (2000) Building blocks, cohort genetic algorithms, and hyperplane-defined functions. In: Whitley D (eds) Evolutionary computation, vol 8, no 4. MIT, Cambridge, pp 373\u2013391"},{"key":"97_CR15","doi-asserted-by":"crossref","unstructured":"Kargupta H (1996) The gene expression messy genetic algorithm. In: Proceedings of the IEEE international conference on evolutionary computation. IEEE Press, Piscataway, pp 814\u2013819","DOI":"10.1109\/ICEC.1996.542706"},{"key":"97_CR16","unstructured":"Kargupta H, Buescher K (1995) The gene expression messy genetic algorithm for financial applications. In: Proceedings of the IEEE\/IAFE conference on computational intelligence for financial engineering. IEEE Press, Piscataway, pp 155\u2013161"},{"key":"97_CR17","unstructured":"Kargupta H et\u00a0al (1998) Scalable data mining from distributed, heterogeneous data, using collective learning and gene expression based genetic algorithms. WSU Technical Report EECS-98-001, School of EECS, Washington State University, Pullman, WA"},{"key":"97_CR18","first-page":"43","volume-title":"Evolutionary computation, vol 9, no 1","author":"H Kargupta","year":"2001","unstructured":"Kargupta H, Park B (2001) Gene expression and fast construction of distributed evolutionary representation. In: Whitley D (eds) Evolutionary computation, vol 9, no 1. MIT, Cambridge, pp 43\u201369"},{"key":"97_CR19","first-page":"377","volume-title":"Evolutionary computation, vol 7, no 4","author":"M Munetomo","year":"1999","unstructured":"Munetomo M, Goldberg DE (1999). Linkage identification by non-monotonicity detection for overlapping functions. In: Whitley D (eds) Evolutionary computation, vol 7, no 4. MIT, Cambridge, pp 377\u2013398"},{"key":"97_CR20","first-page":"353","volume-title":"Evolutionary computation, vol 7, no 4.","author":"H M\u00fchlenbein","year":"1999","unstructured":"M\u00fchlenbein H, Mahnig T (1999) FDA \u2013 A scalable evolutionary algorithm for the optimization of additively decomposable functions. In: Whitley D (eds) Evolutionary computation, vol 7, no 4. MIT, Cambridge, pp 353\u2013376"},{"key":"97_CR21","first-page":"359","volume-title":"Proceedings of the 6th international conference on genetic algorithms","author":"J Paredis","year":"1995","unstructured":"Paredis J (1995) The symbiotic evolution of solutions and their representations. In: Eshelman LJ (eds) Proceedings of the 6th international conference on genetic algorithms. Morgan Kaufmann, San Mateo, pp 359\u2013365"},{"key":"97_CR22","unstructured":"Pelikan M (1999) A simple implementation of the Bayesian optimization algorithm (BOA) in C++ (version 1.0). Technical Report 99011, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Champaign, IL"},{"key":"97_CR23","first-page":"525","volume-title":"Proceedings of genetic and evolutionary computation conference vol 1","author":"M Pelikan","year":"1999","unstructured":"Pelikan M, Goldberg DE, Cant\u00fa-Paz E (1999) BOA: The Bayesian optimization algorithm. In: Banzhaf W et\u00a0al (eds) Proceedings of genetic and evolutionary computation conference vol 1. Morgan Kaufmann, San Francisco, pp 525\u2013532"},{"key":"97_CR24","first-page":"5","volume-title":"Computational optimization and applications, vol 21, no 1","author":"M Pelikan","year":"1999","unstructured":"Pelikan M, Goldberg DE, Lobo F (1999) A survey of optimization by building and using probabilistic models. In: Hager WW (eds) Computational optimization and applications, vol 21, no 1. Kluwer, Dordrecht, pp 5\u201320"},{"key":"97_CR25","unstructured":"Pelikan M (2000) A C++ implementation of the Bayesian optimization algorithm (BOA) with decision graph. Technical Report 2000025, Illinois Genetic Algorithms Laboratory, University of Illinois at Urbana-Champaign, Champaign, IL"},{"key":"97_CR26","volume-title":"Bayesian optimization algorithm: from single level to hierarchy","author":"M Pelikan","year":"2002","unstructured":"Pelikan M (2002) Bayesian optimization algorithm: from single level to hierarchy. Doctoral dissertation, University of Illinois at Urbana-Champaign, Champaign IL"},{"key":"97_CR27","first-page":"1271","volume-title":"Proceedings of genetic and evolutionary computation conference","author":"M Pelikan","year":"2003","unstructured":"Pelikan M, Goldberg DE (2003). Hierarchical BOA solves ising spin glasses and MAXSAT. In: Cant-\u00faPaz E et\u00a0al (eds) Proceedings of genetic and evolutionary computation conference. Springer, Berlin Heidelberg New York, pp 1271\u20131282"},{"key":"97_CR28","first-page":"341","volume-title":"Evolutionary computation, vol 8, no 3","author":"AA Salman","year":"2000","unstructured":"Salman AA, Mehrotra K, Mohan CK (2000) Adaptive linkage crossover. In: Whitley D (eds) Evolutionary computation, vol 8, no 3. MIT, Cambridge, pp 341\u2013370"},{"key":"97_CR29","unstructured":"Sastry K, Xiao G (2001) Cluster optimization using extended compact genetic algorithm. Technical Report 2001016, Illinois Genetic algorithms Laboratory, University of Illinois at Urbana-Champaign, Champaign, IL"},{"key":"97_CR30","doi-asserted-by":"crossref","unstructured":"Smith J, Fogarty T (1996) Recombination strategy adaptation via evolution of gene linkage. In: Proceedings of the IEEE international conference on evolutionary computation. IEEE Press, Piscataway, pp 826\u2013831","DOI":"10.1109\/ICEC.1996.542708"},{"key":"97_CR31","first-page":"331","volume-title":"Evolutionary computation, vol 7, no 4","author":"D Thierens","year":"1999","unstructured":"Thierens D (1999) Scalability problems of simple genetic algorithms. In: Whitley D (eds) Evolutionary computation, vol 7, no 4. MIT, Cambridge, pp 331\u2013352"},{"key":"97_CR32","first-page":"1406","volume-title":"Proceedings of congress on evolutionary computation","author":"RA Watson","year":"1999","unstructured":"Watson RA, Pollack JB (1999). Hierarchically consistent test problems for genetic algorithms. In: Angeline PJ, Michalewicz Z, Schoenauer M, Yao X, Zalzala, A (eds) Proceedings of congress on evolutionary computation. IEEE, Piscataway, pp 1406\u20131413"},{"key":"97_CR33","first-page":"245","volume-title":"Artificial intelligence, vol 85, no 1\u20132","author":"D Whitley","year":"1996","unstructured":"Whitley D, Rana S, Dzubera J, Mathias KE (1996). Evaluating evolutionary algorithms. In Perrault CR, Sandewall E (eds) Artificial intelligence, vol 85, no 1\u20132. Elsevier, Amsterdam, pp 245\u2013276"},{"key":"97_CR34","volume-title":"Artificial intelligence","author":"PH Winston","year":"1992","unstructured":"Winston PH (1992) Artificial intelligence, 3rd edn. Addison-Wesley, Reading","edition":"3"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0097-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-006-0097-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-006-0097-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T01:39:48Z","timestamp":1559093988000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-006-0097-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,24]]},"references-count":34,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2007,1,17]]}},"alternative-id":["97"],"URL":"https:\/\/doi.org\/10.1007\/s00500-006-0097-z","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,5,24]]}}}