@article {Dumitras2000Feedforward-neu,
title = {Feedforward neural network design with tridiagonal symmetry constraints},
journal = {Signal Processing, IEEE Transactions on},
volume = {48},
number = {5},
year = {2000},
month = {may.},
pages = {1446 -1454},
abstract = {This paper introduces a pruning algorithm with tridiagonal symmetry constraints for feedforward neural network (FANN) design. The algorithm uses a reflection transform applied to the input-hidden weight matrix in order to reduce it to its tridiagonal form. The designed FANN structures obtained by applying the proposed algorithm are compact and symmetrical. Therefore, they are well suited for efficient hardware and software implementations. Moreover, the number of the FANN parameters is reduced without a significant loss in performance. We illustrate the complexity and performance of the proposed algorithm by applying it as a solution to a nonlinear regression problem. We also compare the results of our proposed algorithm with those of the optimal brain damage algorithm},
keywords = {complexity, computational complexity, FANN design, feedforward neural nets, feedforward neural network design, input-hidden weight matrix, matrix algebra, nonlinear regression problem, performance, pruning algorithm, reflection transform, statistical analysis, transforms, tridiagonal symmetry constraints},
issn = {1053-587X},
doi = {10.1109/78.839989},
url = {http://dx.doi.org/10.1109/78.839989},
author = {Dumitras, A. and Kossentini, F.}
}