Complexity Analysis of Neural Network Based on Rational Spline Weight Functions

Article Preview

Abstract:

This paper aims to obtain the time complexity for a new kind of neural network using rational spline weight functions. In this paper, we introduce the architecture of the neural network, and analyze the time complexity in detail. Finally, some examples are also given to verify the theoretical analysis. The results show that the time complexity depends on the number of patterns, the input and out dimensions of the neural networks.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

1658-1661

Citation:

Online since:

September 2014

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2014 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

* - Corresponding Author

[1] Daiyuan Zhang. New Theories and Methods on Neural Networks[M]. Beijing: Tsinghua University Press, (2006).

Google Scholar

[2] Daiyuan Zhang. New Algorithm for Training Feed forward Neural Networks with Cubic Spline weight functions [J]. Beijing: Systems Engineering and Electronics, 2006(9): 1434-1437.

Google Scholar

[3] Serge Dubuc, Bin Han, Jean-Louis Merrien, QunMo. Dyadic C2 Hermite interpolation on a square mesh[J]. Computer Aided Geometric Design, 22 (2005) 727-752.

DOI: 10.1016/j.cagd.2005.03.001

Google Scholar

[4] Daiyuan Zhang. Computer Organization (Second Edition) [M]. Beijing: Tsinghua University Press, (2009).

Google Scholar