Metaheuristic Algorithms for Convolution Neural Networks

نویسندگان

  • L. M. Rasdi Rere
  • Mohamad Ivan Fanany
  • Aniati Murni Arymurthy
چکیده

A typical modern optimization technique is usually either heuristic or metaheuristic. This technique has managed to solve some optimization problems in the research area of science, engineering, and industry. However, implementation strategy of metaheuristic for accuracy improvement on convolution neural networks (CNN), a famous deep learning method, is still rarely investigated. Deep learning relates to a type of machine learning technique, where its aim is to move closer to the goal of artificial intelligence of creating a machine that could successfully perform any intellectual tasks that can be carried out by a human. In this paper, we propose the implementation strategy of three popular metaheuristic approaches, i.e. simulated annealing, differential evolution and harmony search, to optimize CNN. The performance of these metaheuristic methods in optimizing CNN on classifying MNIST and CIFAR dataset were evaluated and compared. Furthermore, the proposed methods are also compared with the original CNN. Although the proposed methods show an increase in the computation time, their accuracy has also been improved (up to 5.73 percent). Keywords— metaheuristic, convolution neural network, deep learning, simulated annealing, differential evolution, harmony search

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Metaheuristic Algorithms for Convolution Neural Network

A typical modern optimization technique is usually either heuristic or metaheuristic. This technique has managed to solve some optimization problems in the research area of science, engineering, and industry. However, implementation strategy of metaheuristic for accuracy improvement on convolution neural networks (CNN), a famous deep learning method, is still rarely investigated. Deep learning ...

متن کامل

A METAHEURISTIC-BASED ARTIFICIAL NEURAL NETWORK FOR PLASTIC LIMIT ANALYSIS OF FRAMES

Despite the advantages of the plastic limit analysis of structures, this robust method suffers from some drawbacks such as intense computational cost. Through two recent decades, metaheuristic algorithms have improved the performance of plastic limit analysis, especially in structural problems. Additionally, graph theoretical algorithms have decreased the computational time of the process impre...

متن کامل

Comparing Evolutionary Strategy Algorithms for Training Spiking Neural Networks

Spiking Neural Networks are considered as the third generation of Artificial Neural Networks, these neural networks naturally process spatio-temporal information. Spiking Neural Networks have been used in several fields and application areas; pattern recognition among them. For dealing with supervised pattern recognition task a gradientdescent based learning rule (Spike-prop) has been developed...

متن کامل

Comparison of Genetic and Hill Climbing Algorithms to Improve an Artificial Neural Networks Model for Water Consumption Prediction

No unique method has been so far specified for determining the number of neurons in hidden layers of Multi-Layer Perceptron (MLP) neural networks used for prediction. The present research is intended to optimize the number of neurons using two meta-heuristic procedures namely genetic and hill climbing algorithms. The data used in the present research for prediction are consumption data of water...

متن کامل

A Comparison of BA, GA, PSO, BP and LM for Training Feed forward Neural Networks in e-Learning Context

Training neural networks is a complex task of great importance in the supervised learning field of research. We intend to show the superiority (time performance and quality of solution) of the new metaheuristic bat algorithm (BA) over other more ―standard‖ algorithms in neural network training. In this work we tackle this problem with five algorithms, and try to over a set of results that could...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016