International Journal on Advanced Science, Engineering and Information Technology, Vol. 7 (2017) No. 4-2: Special Issue on the Emerging Trends in Software Engineering and Soft Computing Applications, pages: 1528-1534, Chief Editor: Shahreen Kasim Editorial Boards: Rohayanti Hassan, Hairulnizam Mahdin, Mohd Farhan Md Fudzee & Azizul Azhar Ramli, DOI:10.18517/ijaseit.7.4-2.3387

Optimal Parameter Selection Using Three-term Back Propagation Algorithm for Data Classification

Nazri Mohd Nawi, Nurmahiran Muhammad Zaidi, Noorhamreeza Abdul Hamid, Muhammad Zubair Rehman, Azizul Azhar Ramli, Shahreen Kasim

Abstract

The back propagation (BP) algorithm is the most popular supervised learning method for multi-layered feed forward Neural Network. It has been successfully deployed in numerous practical problems and disciplines. Regardless of its popularity, BP is still known for some major drawbacks such as easily getting stuck in local minima and slow convergence; since, it uses Gradient Descent (GD) method to learn the network. Over the years, many improved modifications of the BP learning algorithm have been made by researchers but the local minima problem remains unresolved. Therefore, to resolve the inherent problems of BP algorithm, this paper proposed BPGD-A3T algorithm where the approach introduces three adaptive parameters which are gain, momentum and learning rate in BP. The performance of the proposed BPGD-A3T algorithm is then compared with BPGD two term parameters (BPGD-2T), BP with adaptive gain (BPGD-AG) and conventional BP algorithm (BPGD) by means of simulations on classification datasets. The simulation results show that the proposed BPGD-A3T shows better performance and performed highest accuracy for all dataset as compared to other.

Keywords:

back propagation; local minima; three-term; gradient descent; local minima; search direction; classification

Viewed: 479 times (since Sept 4, 2017)

cite this paper     download