The development of Artificial Neural Networks (ANNs) is usually a slow process in which the human expert has to test several architectures until he finds the one that achieves best results to solve a certain problem. This work presents a new technique that uses Genetic Programming (GP) for automatically generating ANNs. To do this, the GP algorithm had to be changed in order to work with graph structures, so ANNs can be developed. This technique also allows the obtaining of simplified networks that solve the problem with a small group of neurons. In order to measure the performance of the system and to compare the results with other ANN development methods by means of Evolutionary Computation (EC) techniques, several tests were performed with problems based on some of the most used test databases. The results of those comparisons show that the system achieves good results comparable with the already existing techniques and, in most of the cases, they worked better than those techniques., {"references":["S. Haykin, Neural Networks (2nd ed.), Englewood Cliffs, NJ: Prentice\nHall, 1999.","J. R. Rabu├▒al and J. Dorado, (eds.) Artificial Neural Networks in Real-\nLife Applications, Idea Group Inc, 2005.","J. R. Koza, Genetic Programming: On the Programming of Computers\nby Means of Natural Selection, Cambridge, MA, MIT Press, 1992.","J.R. Rabu├▒al, J. Dorado, A. Pazos, J. Pereira and D. Rivero, \"A New\nApproach to the Extraction of ANN Rules and to Their Generalization\nCapacity Through GP\". Neural Computation, vol. 16, n. 7. 2004. pp.\n1483-1523.","M. Bot, \"Application of Genetic Programming to Induction of Linear\nClassification Trees\", Final Term Project Report, Vrije Universiteit,\nAmsterdam, 1999.","J. R. Rabu├▒al, J. Dorado, J. Puertas, A. Pazos, A. Santos and D. Rivero,\n\"Prediction and Modelling of the Rainfall-Runoff Transformation of a\nTypical Urban Basin using ANN and GP\", Applied Artificial\nIntelligence, 2003.","R. S. Sutton, \"Two problems with backpropagation and other steepestdescent\nlearning procedure for networks\", Proc. 8th Annual Conf.\nCognitive Science Society, Hillsdale, NJ: Erlbaum, 1986, pp. 823-831.","D. J. Janson and J. F. Frenzel, \"Training product unit neural networks\nwith genetic algorithms\", IEEE Expert, vol. 8, 1993, pp. 26-33.","G. W. Greenwood, \"Training partially recurrent neural networks using\nevolutionary strategies\", IEEE Trans. Speech Audio Processing, vol. 5,\n1997, pp. 192-194.\n[10] E. Alba, J. F. Aldana and J. M. Troya, \"Fully automatic ANN design: A\ngenetic approach\", Proc. Int. Workshop Artificial Neural Networks\n(IWANN-93), Lecture Notes in Computer Science, vol. 686. Berlin,\nGermany: Springer-Verlag, 1993, pp. 399-404.\n[11] H. Kitano, \"Designing neural networks using genetic algorithms with\ngraph generation system\", Complex Systems, vol. 4, 1990, pp. 461-476.\n[12] X. Yao and Y. Liu, \"Toward designing artificial neural networks by\nevolution\", Appl. Math. Computation, vol. 91, no. 1, 1998, pp. 83-90.\n[13] S. A. Harp, T. Samad and A. Guha, \"Toward the genetic synthesis of\nneural networks\", Proc. 3rd Int. Conf. Genetic Algorithms and Their\nApplications, J.D. Schafer, Ed. San Mateo, CA: Morgan Kaufmann,\n1989, pp. 360-369.\n[14] S. Nolfi and D. Parisi, \"Evolution of Artificial Neural Networks\",\nHandbook of brain theory and neural networks, Second Edition,\nCambridge, MA: MIT Press, 2002, pp. 418-421.\n[15] P. Turney, D. Whitley and R. Anderson, \"Special issue on the\nbaldwinian effect\", Evolutionary Computation, vol. 4, no. 3, 1996, pp.\n213-329.\n[16] A. Zomorodian, 1995. \"Context-free Language Induction by Evolution\nof Deterministic Push-down Automata Using Genetic Programming\", in\nWorking Notes of the Genetic Programming Symposium, AAAI-95, Eric\nSiegel and John Koza, chairs. AAAI Press. 1995.\n[17] Z. Fan, K. Seo, R. C. Rosenberg, J. Hu and E. D. Goodman, \"Exploring\nMultiple Design Topologies Using Genetic Programming And Bond\nGraphs\". GECCO 2002: Proceedings of the Genetic and Evolutionary\nComputation Conference. Springer-Verlag. 2002, pp. 1073-1080\n[18] Z. Fan, K. Seo, J. Hu, R. C. Rosenberg and E. D. Goodman, \"System-\nLevel Synthesis of MEMS via Genetic Programming and Bond Graphs\",\nGenetic and Evolutionary Computation -- GECCO-2003. Vol. 2724.\n2003, pp. 2058-2071.\n[19] F. Gruau, \"Genetic micro programming of neural networks\", in Kinnear,\nJr., K. E., editor, Advances in Genetic Programming, chapter 24, MIT\nPress, 1994, pp. 495-518.\n[20] S. Luke and L. Spector, \"Evolving Graphs and Networks with Edge\nencoding: Preliminary Report\". In Late Breaking Papers at the Genetic\nProgramming 1996 Conference (GP96). J. Koza, ed. Stanford: Stanford\nBookstore, 1996, pp. 117-124.\n[21] A. Teller, \"Evolving Programmers: The Co-evolution of Intelligent\nRecombination Operators\", in Advances in Genetic Programming II, P.\nAngeline and K. Kinnear, editors. Cambridge: MIT Press., 1996.\n[22] W. Kantschik, P. Dittrich, M. Brameier and W. Banzhaf,\n\"MetaEvolution in Graph GP\", Proceedings of EuroGP'99, LNCS, Vol.\n1598. SpringerVerlag, 1999, pp. 15-28.\n[23] R. Poli \"Evolution of Graph-like Programs with Parallel Distributed\nGenetic Programming\", Genetic Algorithms: Proceedings of the Seventh\nInternational Conference, 1997.\n[24] W. Kantschik, W. Banzhaf, \"Linear-Graph GP - A new GP Structure\",\nin Proceedings of the 4th European Conference on Genetic\nProgramming, EuroGP 2002, 2002.\n[25] A. Teller A. and M. Veloso, \"Internal reinforcement in a connectionist\ngenetic programming approach\", Artificial Intelligence. Vol. 120, N. 2,\n2000, pp. 165-198.\n[26] D. J. Montana, \"Strongly typed genetic programming\", Evolutionary\nComputation, Vol. 3, No. 2, 1995, pp. 199-200.\n[27] C. J. Mertz and P. M. Murphy, UCI repository of machine learning\ndatabases. http://www-old.ics.uci.edu/pub/machine-learning-databases,\n2002\n[28] E. Cant├║-Paz and C. Kamath, \"An Empirical Comparison of\nCombinations of Evolutionary Algorithms and Neural Networks for\nClassification Problems\", IEEE Transactions on systems, Man and\nCybernetics - Part B: Cybernetics, 2005, pp. 915-927.\n[29] T. G. Dietterich, \"Approximate statistical tests for comparing supervised\nclassification learning algorithms\", Neural Computation, Vol. 10, No. 7,\n1998, pp. 1895-1924."]}