Logarithmic learning for generalized classifier neural network

Buse Melis Özyıldırım

doi:10.1016/j.neunet.2014.08.004

2014-12-01

PRE

Buse Melis Özyıldırım *

Mutlu Avcı

DOI：10.1016/j.neunet.2014.08.004

原文链接

原文求助

摘要

En 中文

Generalized classifier neural network is introduced as an efficient classifier among the others. Unless the initial smoothing parameter value is close to the optimal one, generalized classifier neural network suffers from convergence problem and requires quite a long time to converge. In this work, to overcome this problem, a logarithmic learning approach is proposed. The proposed method uses logarithmic cost function instead of squared error. Minimization of this cost function reduces the number of iterations used for reaching the minima. The proposed method is tested on 15 different data sets and performance of logarithmic learning generalized classifier neural network is compared with that of standard one. Thanks to operation range of radial basis function included by generalized classifier neural network, proposed logarithmic approach and its derivative has continuous values. This makes it possible to adopt the advantage of logarithmic fast convergence by the proposed learning method. Due to fast convergence ability of logarithmic cost function, training time is maximally decreased to 99.2%. In addition to decrease in training time, classification performance may also be improved till 60%. According to the test results, while the proposed method provides a solution for time requirement problem of generalized classifier neural network, it may also improve the classification accuracy. The proposed method can be considered as an efficient way for reducing the time requirement problem of generalized classifier neural network. (C) 2014 Elsevier Ltd. All rights reserved.

Keyword:

GCNN

Logarithmic cost function

Classification neural networks

Gradient descent learning