Symbolic Regression on Network Properties

Created by W.Langdon from gp-bibliography.bib Revision:1.8010

@InProceedings{Maertens:2017:EuroGP,

• author = "Marcus Maertens and Fernando Kuipers and Piet {Van Mieghem}",
• title = "Symbolic Regression on Network Properties",
• booktitle = "EuroGP 2017: Proceedings of the 20th European Conference on Genetic Programming",
• year = "2017",
• month = "19-21 " # apr,
• editor = "Mauro Castelli and James McDermott and Lukas Sekanina",
• series = "LNCS",
• volume = "10196",
• publisher = "Springer Verlag",
• address = "Amsterdam",
• pages = "131--146",
• organisation = "species",
• keywords = "genetic algorithms, genetic programming",
• isbn13 = "978-3-319-55695-6",
• DOI = "doi:10.1007/978-3-319-55696-3_9",
• abstract = "Networks are continuously growing in complexity, which creates challenges for determining their most important characteristics. While analytical bounds are often too conservative, the computational effort of algorithmic approaches does not scale well with network size. This work uses Cartesian Genetic Programming for symbolic regression to evolve mathematical equations that relate network properties directly to the eigenvalues of network adjacency and Laplacian matrices. In particular, we show that these eigenvalues are powerful features to evolve approximate equations for the network diameter and the isoperimetric number, which are hard to compute algorithmically. Our experiments indicate a good performance of the evolved equations for several real-world networks and we demonstrate how the generalization power can be influenced by the selection of training networks and feature sets.",
• notes = "Part of \cite{Castelli:2017:GP} EuroGP'2017 held inconjunction with EvoCOP2017, EvoMusArt2017 and EvoApplications2017",

}

Genetic Programming entries for Marcus Maertens Fernando Kuipers Piet Van Mieghem

Citations