دانلود مقاله ISI انگلیسی شماره 79485
عنوان فارسی مقاله

برنامه نویسی ژنتیک جانشین: یک جستجوی تکاملی آگاه معنایی

کد مقاله سال انتشار مقاله انگلیسی ترجمه فارسی تعداد کلمات
79485 2015 15 صفحه PDF سفارش دهید محاسبه نشده
خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.
عنوان انگلیسی
Surrogate Genetic Programming: A semantic aware evolutionary search
منبع

Publisher : Elsevier - Science Direct (الزویر - ساینس دایرکت)

Journal : Information Sciences, Volume 296, 1 March 2015, Pages 345–359

کلمات کلیدی
فضای معنایی؛ مدل جایگزین؛ مدل معنایی؛ مدل تناسب اندام؛ SGP
پیش نمایش مقاله
پیش نمایش مقاله برنامه نویسی ژنتیک جانشین: یک جستجوی تکاملی آگاه معنایی

چکیده انگلیسی

Many semantic search based on Genetic Programming (GP) use a trial-and-error scheme to attain semantically diverse offspring in the evolutionary search. This results in significant impediments on the success of semantic-based GP in solving real world problems, due to the additional computational overheads incurred. This paper proposes a surrogate Genetic Programming (or sGP in short) to retain the appeal of semantic-based evolutionary search for handling challenging problems with enhanced efficiency. The proposed sGP divides the population into two parts (μ and λ) then it evolves μ percentage of the population using standard GP search operators, while the remaining λ percentage of the population are evolved with the aid of meta-models (or approximation models) that serve as surrogate to the original objective function evaluation (which is computationally intensive). In contrast to previous works, two forms of meta-models are introduced in this study to make the idea of using surrogate in GP search feasible and successful. The first denotes a “Semantic-model” for prototyping the semantic representation space of the GP trees (genotype/syntactic-space). The second is a “Fitness-model”, which maps solutions in the semantic space to the objective or fitness space. By exploiting the two meta-models collectively in serving as a surrogate that replaces the original problem landscape of the GP search process, more cost-effective generation of offspring that guides the search in exploring regions where high quality solutions resides can then be attained. Experimental studies covering three separate GP domains, namely, (1) Symbolic regression, (2) Even n-parity bit, and (3) a real-world Time-series forecasting problem domain involving three datasets, demonstrate that sGP is capable of attaining reliable, high quality, and efficient performance under a limited computational budget. Results also showed that sGP outperformed the standard GP, GP based on random training-set technique, and GP based on conventional data-centric objectives as surrogate.

خرید مقاله
پس از پرداخت، فوراً می توانید مقاله را دانلود فرمایید.