A goal programming based approach for hidden targets in layer-by-layer algorithm of multilayer perception classifiers

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Layer-by-layer (LBL) algorithm is one of the famous training algorithms for multilayer perceptrons. It converges fast with less computation complexity. Unfortunately, in LBL, when calculating the desired hidden targets, solving of a linear equation set is needed. If the determinant of the coefficient matrix turns to be zero, the solution will not be unique. That results in the stalling problem. Furthermore, a truncation error will be caused by the inversing process of sigmoid function. Based on the idea of goal programming technique, this paper proposes a new method to calculate the hidden targets. A satisfied solution of hidden targets is provided through a goal programming model, Furthermore, the truncation error can be avoided efficiently by means of assigning higher priority to the limitation of variable domain. The effectiveness of the proposed method is demonstrated by the computer simulation of a mushroom classification problem. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Li, Y., Wang, K., & Li, T. (2006). A goal programming based approach for hidden targets in layer-by-layer algorithm of multilayer perception classifiers. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3971 LNCS, pp. 889–894). Springer Verlag. https://doi.org/10.1007/11759966_130

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free