Zobrazeno 1 - 10
of 13
pro vyhledávání: '"Stephen Dignum"'
Publikováno v:
Genetic Programming and Evolvable Machines. 13:197-238
Bloat can be defined as an excess of code growth without a corresponding improvement in fitness. This problem has been one of the most intensively studied subjects since the beginnings of Genetic Programming. This paper begins by briefly reviewing th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2bf9820ddf48e75336e0cee0e6ce1722
https://doi.org/10.1007/s10710-011-9150-5
https://doi.org/10.1007/s10710-011-9150-5
Autor:
Udo Kruschwitz, Ulises Cerviño Beresi, Maria Fasli, Dyaa Albakour, Stephen Dignum, Anne De Roeck, Malcolm Clark, Yunhyong Kim, Dawei Song
This paper presents an overview of automatic methods for building domain knowledge structures (domain models) from text collections. Applications of domain models have a long history within knowledge engineering and artificial intelligence. In the la
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::86659152fb3c34a7dfa54b154a0ee4ad
http://oro.open.ac.uk/33891/1/IP_and_M_DomainModel_Preprint.pdf
http://oro.open.ac.uk/33891/1/IP_and_M_DomainModel_Preprint.pdf
Autor:
Yunhyong Kim, Dawei Song, Stephen Dignum, Anne De Roeck, Maria Fasli, Ulises Cerviño Beresi, Udo Kruschwitz
Publikováno v:
IEEE/WIC/ACM International Conference on Web Intelligence (WI2010)
Web Intelligence
Web Intelligence
While much research has been performed on query logs collected for major Web search engines, query log analysis to enhance search on smaller and more focused collections has attracted less attention. Our hypothesis is that an intranet search engine c
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::fea23cf731a5f45d0e44ea81f1f743f5
http://oro.open.ac.uk/35138/1/AutoAdapt-WI2010.pdf
http://oro.open.ac.uk/35138/1/AutoAdapt-WI2010.pdf
Autor:
Stephen Dignum, Riccardo Poli
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642121470
EuroGP
EuroGP
Recent theoretical work has characterised the search bias of GP sub-tree swapping crossover in terms of program length distributions, providing an exact fixed point for trees with internal nodes of identical arity. However, only an approximate model
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::76a33585c3da76222a748ebd12979eb0
https://doi.org/10.1007/978-3-642-12148-7_4
https://doi.org/10.1007/978-3-642-12148-7_4
Autor:
Sara Silva, Stephen Dignum
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783642011801
EuroGP
EuroGP
Operator equalisation is a recent bloat control technique that allows accurate control of the program length distribution during a GP run. By filtering which individuals are allowed in the population, it can easily bias the search towards smaller or
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c2b4aa71b320dd4041b398ced51325be
https://doi.org/10.1007/978-3-642-01181-8_14
https://doi.org/10.1007/978-3-642-01181-8_14
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540786702
EuroGP
EuroGP
The neutral theory of molecular evolution and the associated notion of neutrality have interested many researchers in Evolutionary Computation. The hope is that the presence of neutrality can aid evolution. However, despite the vast number of publica
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8883730600986677c4840a9be37f84a7
https://doi.org/10.1007/978-3-540-78671-9_27
https://doi.org/10.1007/978-3-540-78671-9_27
Autor:
Stephen Dignum, Riccardo Poli
Publikováno v:
Parallel Problem Solving from Nature – PPSN X ISBN: 9783540876991
PPSN
PPSN
We provide strong evidence that sub-tree swapping crossover when applied to tree-based representations will cause alleles node labels to diffuse within length classes. For a-ary trees we provide further confirmation that all programs are equally like
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::e9f6acbd30a6c701e14107e53d973654
https://doi.org/10.1007/978-3-540-87700-4_37
https://doi.org/10.1007/978-3-540-87700-4_37
Autor:
Stephen Dignum, Riccardo Poli
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540786702
EuroGP
EuroGP
Research has shown that beyond a certain minimum program length the distributions of program functionality and fitness converge to a limit. Before that limit, however, there may be program-length classes with a higher or lower average fitness than th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::63ff001ebacf13fe0311e66fe9859bef
https://doi.org/10.1007/978-3-540-78671-9_10
https://doi.org/10.1007/978-3-540-78671-9_10
Autor:
Stephen Dignum, Riccardo Poli
Publikováno v:
Lecture Notes in Computer Science ISBN: 9783540786702
EuroGP
EuroGP
Recent research [9,2] has enabled the accurate prediction of the limiting distribution of tree sizes for Genetic Programming with standard sub-tree swapping crossover when GP is applied to a flat fitness landscape. In that work, however, tree sizes a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0981def280493258c88bec656a4dc504
https://doi.org/10.1007/978-3-540-78671-9_14
https://doi.org/10.1007/978-3-540-78671-9_14