{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T05:43:50Z","timestamp":1648619030682},"reference-count":56,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2006,2,10]],"date-time":"2006-02-10T00:00:00Z","timestamp":1139529600000},"content-version":"unspecified","delay-in-days":9,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIEDAM"],"published-print":{"date-parts":[[2006,2]]},"abstract":"<jats:p>Previous applications of genetic programming (GP) have been restricted to searching for algebraic approximations mapping the design parameters (e.g., geometrical parameters) to a single design objective (e.g., weight). In addition, these algebraic expressions tend to be highly complex. By adding a simple extension to the GP technique, a powerful design data analysis tool is developed. This paper significantly extends the analysis capabilities of GP by searching for multiple simple models within a single population by splitting the population into multiple islands according to the design variables used by individual members. Where members from different islands \u201ccooperate,\u201d simple design models can be extracted from this cooperation. This relatively simple extension to GP is shown to have powerful implications to extracting design models that can be readily interpreted and exploited by human designers. The full analysis method, GP heuristics extraction method, is described and illustrated by means of a design case study.<\/jats:p>","DOI":"10.1017\/s089006040606001x","type":"journal-article","created":{"date-parts":[[2006,2,14]],"date-time":"2006-02-14T14:49:11Z","timestamp":1139928551000},"page":"1-18","source":"Crossref","is-referenced-by-count":3,"title":["Learning inexpensive parametric design models using an augmented genetic programming technique"],"prefix":"10.1017","volume":"20","author":[{"given":"PETER C.","family":"MATTHEWS","sequence":"first","affiliation":[]},{"given":"DAVID W.F.","family":"STANDINGFORD","sequence":"additional","affiliation":[]},{"given":"CARREN M.E.","family":"HOLDEN","sequence":"additional","affiliation":[]},{"given":"KEN M.","family":"WALLACE","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2006,2,10]]},"reference":[{"key":"S089006040606001X_ref043","doi-asserted-by":"publisher","DOI":"10.1162\/106365600568086"},{"key":"S089006040606001X_ref047","doi-asserted-by":"publisher","DOI":"10.1111\/1467-8551.00141"},{"key":"S089006040606001X_ref037","unstructured":"Michalski, R.S. & Tecuci, G. , Eds.(1994).Machine Learning: A Multistrategy Approach,Vol. IV.San Francisco, CA:Morgan Kaufmann."},{"key":"S089006040606001X_ref033","doi-asserted-by":"publisher","DOI":"10.1016\/S0893-6080(99)00013-1"},{"key":"S089006040606001X_ref044","unstructured":"Potter, M.A. , De Jong, K.A. , & Grefenstette, J.J. (1995).A coevolutionary approach to learning sequential decisionrules. InProc. Sixth Int. Conf. Genetic Algorithms( Eshelman, L. , Ed.), pp.366\u2013372.San Francisco, CA:Morgan Kaufmann."},{"key":"S089006040606001X_ref032","unstructured":"Leake, D.B. , Birnbaum, L. , Hammond, K. , Marlow, C. , & Yang, H. (1999).Case-Based Reasoning Research and Development 1999.Lecture Notes in Artificial Intelligence,Vol. 1650, pp.482\u2013496.Berlin:Springer\u2013Verlag."},{"key":"S089006040606001X_ref036","unstructured":"Michalski, R.S. & Kaufman, K.A. (1997).Data mining and knowledge discovery: a review of issues and amultistrategy approach. InMachine Learning and Data Mining: Methods and Applications( Michalski, R.S. , Bratko, I. & Kubat, M. , Eds.), pp.71\u2013112.Chichester:Wiley."},{"key":"S089006040606001X_ref031","unstructured":"Lawrence, S. , Tsoi, A.C. , & Back, A.D. (1996).Function approximation with neural networks and local methods: Bias,variance and smoothness.Proc. Australian Conf. Neural Networks( Bartlett, P. , Burkitt, A. & Williamson, R. , Eds.), pp.16\u201321, Australian National University."},{"key":"S089006040606001X_ref026","unstructured":"Koza, J.R. (1992).Genetic Programing: On the Programming of Computers by Means ofNatural Selection, Complex Adaptive Systems.Cambridge, MA:MIT Press."},{"key":"S089006040606001X_ref024","unstructured":"Johansson, U. , Niklasson, L. , & K\u00f6nig, R. (2004).Accuracy vs. comprehensibility in data mining models.Proc. Seventh Int. Conf. Information Fusion( Svensson, P. & Schubert, J. , Eds.), Vol. 1, pp.295\u2013300, Mountain View, CA."},{"key":"S089006040606001X_ref023","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03256-5_3"},{"key":"S089006040606001X_ref004","doi-asserted-by":"publisher","DOI":"10.1016\/0950-7051(96)81920-4"},{"key":"S089006040606001X_ref053","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1046294464"},{"key":"S089006040606001X_ref039","unstructured":"Modesitt, K.L. (1992).Basic principles and techniques in knowledge acquisition.InKnowledge Acquisition in Civil Engineering, pp.11\u201349.New York:American Society of Civil Engineers."},{"key":"S089006040606001X_ref007","unstructured":"Arciszewski, T. & Ziarko, W. (1992).Knowledge Acquisition in Civil Engineering, pp.50\u201368.New York:American Society of Civil Engineers."},{"key":"S089006040606001X_ref050","doi-asserted-by":"publisher","DOI":"10.1016\/S0142-694X(98)00018-0"},{"key":"S089006040606001X_ref052","doi-asserted-by":"publisher","DOI":"10.1016\/0952-1976(96)00037-1"},{"key":"S089006040606001X_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0956-0521(93)90046-Y"},{"key":"S089006040606001X_ref012","unstructured":"Corbett-Clark, T.A. (1998).Explanation from neural networks.PhD Thesis.Oxford University, Department of Engineering Science."},{"key":"S089006040606001X_ref020","doi-asserted-by":"publisher","DOI":"10.1016\/S0165-0114(01)00239-1"},{"key":"S089006040606001X_ref010","doi-asserted-by":"publisher","DOI":"10.1115\/DETC2003\/DAC-48759"},{"key":"S089006040606001X_ref038","unstructured":"Mitchell, T.M. (1997).Machine Learning.New York:McGraw\u2013Hill."},{"key":"S089006040606001X_ref035","unstructured":"Matthews, P.C. (2002).The application of self organizing maps in conceptual design.PhD Thesis.University of Cambridge, Engineering Department."},{"key":"S089006040606001X_ref017","doi-asserted-by":"publisher","DOI":"10.1017\/S0890060400003139"},{"key":"S089006040606001X_ref040","unstructured":"Nair, P.B. , Choudhury, A. , & Keane, A.J. (2002).Some greedy learning algorithms for sparse regression andclassification with Mercer kernels.Journal of Machine Learning Research, 3,781\u2013801."},{"key":"S089006040606001X_ref006","doi-asserted-by":"crossref","unstructured":"Arciszewski, T. (1997).Engineering semantic evaluation of decision rules.Journal of Intelligent and Fuzzy Systems 5(3),285\u2013295.","DOI":"10.3233\/IFS-1997-5309"},{"key":"S089006040606001X_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/j.destud.2003.10.006"},{"key":"S089006040606001X_ref009","unstructured":"Blessing, L.T.M. (1994).A process-based approach to computer-supported engineeringdesign.PhD Thesis.University of Twente."},{"key":"S089006040606001X_ref041","doi-asserted-by":"publisher","DOI":"10.1016\/j.destud.2004.05.006"},{"key":"S089006040606001X_ref025","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316801"},{"key":"S089006040606001X_ref008","unstructured":"Belding, T.C. (1995).The distributed genetic algorithm revisited.Proc. Sixth Int. Conf. Genetic Algorithms( Eshelman, L. , Ed.), pp.114\u2013121.San Francisco, CA:Morgan Kaufmann."},{"key":"S089006040606001X_ref016","unstructured":"Goldberg, D.E. (1989).Genetic Algorithms in Search, Optimization and MachineLearning.Reading, MA:Addison\u2013Wesley."},{"key":"S089006040606001X_ref029","doi-asserted-by":"publisher","DOI":"10.1016\/S0098-1354(00)00406-3"},{"key":"S089006040606001X_ref003","unstructured":"Andre, D. & Koza, J. (1996).A parallel implementation of genetic programming that achievessuper-linear performance.Proc. Int. Conf. Parallel and Distributed Processing Techniquesand Applications( Hamid, R. , Ed.),Vol. 3, pp.1163\u20131174,Athens, GA."},{"key":"S089006040606001X_ref015","unstructured":"Gen, M. & Cheng, R. (2000).Genetic Algorithms and Engineering Optimization.New York:Wiley."},{"key":"S089006040606001X_ref013","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2004.826605"},{"key":"S089006040606001X_ref034","unstructured":"Malmqvist, J. & Schachinger, P. (1997).Towards an implementation of the chromosome model\u2014Focusing thedesign specification.Proc. 11th Int. Conf. Engineering Design( Riitahuhta, A. , Ed.),Vol. 3, pp.203\u2013212,Tampere University of Technology."},{"key":"S089006040606001X_ref014","doi-asserted-by":"publisher","DOI":"10.1007\/BF01579252"},{"key":"S089006040606001X_ref046","doi-asserted-by":"publisher","DOI":"10.1007\/10721187_4"},{"key":"S089006040606001X_ref011","unstructured":"Cohoon, J.P. , Hegde, S.U. , Martin, W.N. , & Richards, D. (1987).Punctuated equilibria: a parallel genetic algorithm.Proc. Second Int. Conf. Genetic Algorithms and TheirApplication, pp.148\u2013154.Hillsdale, NJ:Erlbaum."},{"key":"S089006040606001X_ref021","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-9236(02)00008-8"},{"key":"S089006040606001X_ref027","unstructured":"Koza, J.R. , Bennet, F. H., III , Andre, D. , & Keane, M.A. (1999).Genetic Programming III: Darwinian Invention and ProblemSolving.San Francisco, CA:Morgan Kaufmann."},{"key":"S089006040606001X_ref018","unstructured":"Heckerman, D. (1999).A tutorial on learning with Bayesian networks. InLearning in Graphical Models( Jordan, M.I. , Ed.), pp.301\u2013354.Cambridge, MA:MIT Press."},{"key":"S089006040606001X_ref019","doi-asserted-by":"publisher","DOI":"10.1016\/S0957-4174(00)00024-5"},{"key":"S089006040606001X_ref048","doi-asserted-by":"publisher","DOI":"10.1115\/1.3258735"},{"key":"S089006040606001X_ref049","doi-asserted-by":"publisher","DOI":"10.1007\/PL00007198"},{"key":"S089006040606001X_ref051","unstructured":"Tanese, R. (1989).Distributed genetic algorithms for function optimization.PhD Thesis.University of Michigan."},{"key":"S089006040606001X_ref054","unstructured":"Wiegand, R.P. , Liles, W.C. , & De Jong, K.A. (2001).An empirical analysis of collaboration methods in cooperativecoevolutionary algorithms.Proc. Genetic and Evolutionary Computation Conf.(GECCO2001)( Spector, L. , Goodman, E.D. , Wu, A. , Langdon, W.B. , Voigt, H.-M. , Gen, M. , Sen, S. , Dorigo, M. , Pezeshk, S. , Garzon, M.H. & Burke, E. , Eds.), pp.1235\u20131242.San Francisco, CA:Morgan Kaufmann."},{"key":"S089006040606001X_ref056","unstructured":"\u017bytkow, J.M. (2000).Automated discovery: a fusion of multidisciplinaryprinciples. InAdvances in Artificial Intelligence. Lecture Notes in ArtificialIntelligence,Vol. 1822, pp.443\u2013448.Berlin:Springer\u2013Verlag."},{"key":"S089006040606001X_ref045","doi-asserted-by":"publisher","DOI":"10.1016\/S0954-1810(98)00021-1"},{"key":"S089006040606001X_ref028","doi-asserted-by":"publisher","DOI":"10.1109\/6104.924792"},{"key":"S089006040606001X_ref055","unstructured":"\u017bytkow, J.M. (1999).The melting pot of automated discovery: principles for a newscience. InDiscovery Science: Second Int. Conf. Lecture Notes in ArtificialIntelligence,Vol. 1721, pp.1\u201312.Berlin:Springer\u2013Verlag."},{"key":"S089006040606001X_ref042","unstructured":"Potter, M.A. (1997).The design and analysis of a computational model of cooperativecoevolution.PhD Thesis.George Mason University."},{"key":"S089006040606001X_ref030","doi-asserted-by":"crossref","unstructured":"Langley, P. , Simon, H.A. , Bradshaw, G.L. , & \u017bytkow, J.M. (1987).Scientific Discovery: Computational Explorations of the CreativeProcesses.Cambridge, MA:MIT Press.","DOI":"10.7551\/mitpress\/6090.001.0001"},{"key":"S089006040606001X_ref022","doi-asserted-by":"publisher","DOI":"10.1016\/S1474-0346(01)00005-2"},{"key":"S089006040606001X_ref001","unstructured":"Ahmed, S. (2001).Understanding the use and reuse of experience in engineeringdesign.PhD Thesis.University of Cambridge, Engineering Department."}],"container-title":["Artificial Intelligence for Engineering Design, Analysis and Manufacturing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S089006040606001X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,23]],"date-time":"2021-07-23T22:11:18Z","timestamp":1627078278000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S089006040606001X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":56,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["S089006040606001X"],"URL":"https:\/\/doi.org\/10.1017\/s089006040606001x","relation":{},"ISSN":["0890-0604","1469-1760"],"issn-type":[{"value":"0890-0604","type":"print"},{"value":"1469-1760","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}