Effectiveness of scale-free properties in genetic programming
Created by W.Langdon from
gp-bibliography.bib Revision:1.8010
- @InProceedings{Araseki:2012:SCIS,
-
author = "Hitoshi Araseki",
-
booktitle = "Soft Computing and Intelligent Systems (SCIS) and 13th
International Symposium on Advanced Intelligent Systems
(ISIS), 2012 Joint 6th International Conference on",
-
title = "Effectiveness of scale-free properties in genetic
programming",
-
year = "2012",
-
pages = "285--289",
-
address = "Kobe",
-
month = "20-24 " # nov,
-
keywords = "genetic algorithms, genetic programming",
-
DOI = "doi:10.1109/SCIS-ISIS.2012.6505204",
-
abstract = "In this paper, we propose a new selection method,
named scale-free selection, which is based on a
scale-free network. Through study of the complex
network, scale-free networks have been found in various
fields. In recent years, it has been proposed that a
scale-free property be applied to some optimisation
problems. We investigate if the new selection method is
an effective selection method to apply to genetic
programming. Our experimental results on three
benchmark problems show that performance of the
scale-free selection model is similar to the usual
selection methods in spite of different optimisations
and may be able to resolve the bloating problem in
genetic programming. Further, we show that the
optimisation problem is relevant to complex network
study.",
-
notes = "Also known as \cite{6505204}",
- }
Genetic Programming entries for
Hitoshi Araseki
Citations