This study proposes a modified version of cultural algorithms (CAs) which benefits from rule-based system for influence function. This rule-based system selects and applies the suitable knowledge source according to the distribution of the solutions. This is important to use appropriate influence function to apply to a specific individual, regarding to its role in the search process. This rule based system is optimized using Genetic Algorithm (GA). The proposed modified CA algorithm is compared with several other optimization algorithms including GA, particle swarm optimization (PSO), especially standard version of cultural algorithm. The obtained results demonstrate that the proposed modification enhances the performance of the CA in terms of global optimality.Optimization is an important issue in different scientific applications. Many researches dedicated to algorithms that can be used to find an optimal solution for different applications. Intelligence optimizations which are generally classified as, evolutionary computations techniques like Genetic Algorithm, evolutionary strategy, and evolutionary programming, and swarm intelligence algorithms like particle swarm intelligence algorithm and ant colony optimization, etc are powerful tools for solving optimization problems پرونده مقاله

Neural networks are applicable in identification systems from input-output data. In this report, we analyze theHammerstein-Wiener models and identify them. TheHammerstein-Wiener systems are the simplest type of block orientednonlinear systems where the linear dynamic block issandwiched in between two static nonlinear blocks, whichappear in many engineering applications; the aim of nonlinearsystem identification by Hammerstein-Wiener neural networkis finding model order, state matrices and system matrices. Wepropose a robust approach for identifying the nonlinear systemby neural network and subspace algorithms. The subspacealgorithms are mathematically well-established and noniterativeidentification process. The use of subspace algorithmmakes it possible to directly obtain the state space model.Moreover the order of state space model is achieved usingsubspace algorithm. Consequently, by applying the proposedalgorithm, the mean squared error decreases to 0.01 which isless than the results obtained using most approaches in theliterature. پرونده مقاله

Cerebellar Model Articulation Controller Neural Network is a computational model of cerebellum which acts as a lookup table. The advantages of CMAC are fast learning convergence, and capability of mapping nonlinear functions due to its local generalization of weight updating, single structure and easy processing. In the training phase, the disadvantage of some CMAC models is unstable phenomenon or slower convergence speed due to larger fixed or smaller fixed learning rate respectively. The present research deals with offering two solutions for this problem. The original idea of the present research is using changeable learning rate at each state of training phase in the CMAC model. The first algorithm deals with a new learning rate based on reviation of learning rate. The second algorithm deals with number of training iteration and performance learning, with respect to this fact that error is compatible with inverse training time. Simulation results show that this algorithms have faster convergence and better performance in comparison to conventional CMAC model in all training cycles. پرونده مقاله

تطبیق دامنه می تواند دانش را از یک مجموعه آموزشی (دامنه منبع) به یک مجموعه آزمایشی (دامنه هدف) انتقال دهد تا بازدهی مدل یادگرفته شده از داده های آموزش، افزایش یابد. در حیطه تطبیق دامنه مسائل به دو بخشِ با نظارت و بدون نظارت تقسیم بندی می شود. در این پژوهش دامنه های بدون نظارت مورد بررسی قرارمی‌گیرد. یکی از چالش‌ها در تطبیق دامنه که به آن کمتر توجه شده است، عدم توجه به زیرفضا دامنه (فشردگی درون کلاسی) و همچنین تاثیر مخرب داده‌های نویزی و خارج از محدوه است، که موجب انتقال منفی و در نهایت موجب کاهش دقت طبقه‌بندی می‌شود. در این مقاله با استفاده از شبکه‌ تخاصمی مولد جهت استخراج ویژگی‌ها با درنظرگرفتن فشردگی درون-کلاسی دامنه‌ها بر مبنای تخمین اولیه برچسب‌ها با کمک الگوریتم خوشه‌بندی فازی c-means در گام اول و در گام دوم با کمک شبکه‌های عصبی پیچشی و متریک WMMD جهت طبقه‌بندی تصاویر با خطای کمتر ارائه شده است. ارزیابی‌ و نتایج به دست آمده در 5 مجموعه داده محک استاندارد و مقایسه آن با روش‌های پیشین نشان دهنده عملکرد بهتر نسبت به رهیافت‌های مشابه می‌باشد. پرونده مقاله

This paper introduces a novel multi-objective evolutionary algorithm based on cat swarm optimizationalgorithm (EMCSO) and its application to solve a multi-objective knapsack problem. The multi-objective optimizers try to find the closest solutions to true Pareto front (POF) where it will be achieved by finding the less-crowded non-dominated solutions. The proposed method applies cat swarm optimization (CSO), a swarm-based algorithm with ability of exploration and exploitation, to produce offspring solutions and uses thenon-dominated sorting method to findthe solutionsas close as to POFand crowding distance technique toobtain a uniform distribution among thenon-dominated solutions. Also, the algorithm is allowedto keep the elites of population in reproduction processand use an opposition-based learning method for population initialization to enhance the convergence speed.The proposed algorithm is tested on standard test functions (zitzler’ functions: ZDT) and its performance is compared with traditional algorithms and is analyzed based onperformance measures of generational distance (GD), inverted GD, spread,and spacing. The simulation results indicate that the proposed method gets the quite satisfactory results in comparison with other optimization algorithms for functions of ZDT1 and ZDT2. Moreover, the proposed algorithm is applied to solve multi-objective knapsack problem. پرونده مقاله