Shuffled Frog-Leaping Programming for Solving Regression Problems | ||
| Journal of AI and Data Mining | ||
| مقاله 3، دوره 8، شماره 3، مهر 2020، صفحه 331-341 اصل مقاله (1.23 M) | ||
| نوع مقاله: Original/Review Paper | ||
| شناسه دیجیتال (DOI): 10.22044/jadm.2020.7847.1924 | ||
| نویسندگان | ||
| M. Abdollahi* 1؛ M. Aliyari Shoorehdeli2 | ||
| 1Department of Computer Engineering, K.N. Toosi University of Technology, Tehran, Iran. | ||
| 2Department of Electrical Engineering, K.N. Toosi University of Technology, Tehran, Iran. | ||
| چکیده | ||
| There are various automatic programming models inspired by evolutionary computation techniques. Due to the importance of devising an automatic mechanism to explore the complicated search space of mathematical problems where numerical methods fails, evolutionary computations are widely studied and applied to solve real world problems. One of the famous algorithm in optimization problem is shuffled frog leaping algorithm (SFLA) which is inspired by behaviour of frogs to find the highest quantity of available food by searching their environment both locally and globally. The results of SFLA prove that it is competitively effective to solve problems. In this paper, Shuffled Frog Leaping Programming (SFLP) inspired by SFLA is proposed as a novel type of automatic programming model to solve symbolic regression problems based on tree representation. Also, in SFLP, a new mechanism for improving constant numbers in the tree structure is proposed. In this way, different domains of mathematical problems can be addressed with the use of proposed method. To find out about the performance of generated solutions by SFLP, various experiments were conducted using a number of benchmark functions. The results were also compared with other evolutionary programming algorithms like BBP, GSP, GP and many variants of GP. | ||
| کلیدواژهها | ||
| Genetic Programming؛ Shuffled Frog Leaping Algorithm؛ Shuffled Frog Leaping Programming؛ Regression Problems | ||
|
آمار تعداد مشاهده مقاله: 661 تعداد دریافت فایل اصل مقاله: 685 |
||