Excellence in Research and Innovation for Humanity

International Science Index


Select areas to restrict search in scientific publication database:
10005372
Continuous Functions Modeling with Artificial Neural Network: An Improvement Technique to Feed the Input-Output Mapping
Abstract:
The artificial neural network is one of the interesting techniques that have been advantageously used to deal with modeling problems. In this study, the computing with artificial neural network (CANN) is proposed. The model is applied to modulate the information processing of one-dimensional task. We aim to integrate a new method which is based on a new coding approach of generating the input-output mapping. The latter is based on increasing the neuron unit in the last layer. Accordingly, to show the efficiency of the approach under study, a comparison is made between the proposed method of generating the input-output set and the conventional method. The results illustrated that the increasing of the neuron units, in the last layer, allows to find the optimal network’s parameters that fit with the mapping data. Moreover, it permits to decrease the training time, during the computation process, which avoids the use of computers with high memory usage.
Digital Article Identifier (DAI):

References:

[1] A. Alessandri, L. Cassettari, R. Mosca, “Nonparametric nonlinear regression using polynomial, and neural approximators,” A numerical comparison. Comput Manag. Sci., 2009, vol. 6, pp. 5–24.
[2] H.K. Lam, U. Ekong, H. Liu, B. Xiao, H. Araujo, S.H. Ling, and K.Y. Chan, “A study of neural-network-based classifiers for material classification,” Neurocomputing., 2014, vol. 144, pp. 367–377.
[3] A. Nazemi, M. Dehghan, “A neural network method for solving support vector classification problems,” Neurocomputing., 2015, vol. 152, pp. 369–376.
[4] K. Hornik, M. Stinchcombe, and H. White, “Multilayer feedforward networks are universal approximators,” Neural Networks., 1989, vol. 2, pp. 359.
[5] G. Cybenko, “Approximation by superpositions of a sigmoidal function,” Mathematics of Control, Signals and Systems, 1989, vol. 2, pp. 303.
[6] V. Kurkova, “Kolmogorov's theorem and multilayer neural networks,” Neural Networks., 1992, vol. 5, pp. 501-506.
[7] R.S. Scalero, N. Tepedelenlioglu, “A fast new algorithm for training feedforward neural networks,” IEEE Trans. Signal Processing., 1992, vol. 40, pp. 202–210.
[8] M.T. Hagan, M.B. Menhaj, “Training feedforward networks with the Marquardt algorithm,” IEEE Trans. Neural Netw., 1994, vol. 5, pp. 989–993.
[9] Y. Liu, J.A. Starzyk, Z. Zhu, “Optimized approximation algorithm in neural networks without overfitting,” IEEE Trans. Neural Netws., 2008, vol. 19, pp. 983–995.
[10] M. Bogdan, M. Wilamowski, H. Yu, “ Improved computation for Levenberg–Marquardt training,” IEEE Trans. Neural Netw., 2010, vol. 21, pp. 930-937.
[11] Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, “Gradientbased learning applied to document recognition,” Intelligent Signal Processing, IEEE Press., 2001, pp. 306–351, 200.
[12] M. Ventresca, H.R. Tizhoosh, “Improving gradient based learning algorithms or large scale feedforward networks,” IJCNN’09: Proceedings of the International Joint Conference on Neural Networks. IEEE Press, Piscataway, NJ, USA, 2009, pp. 1529–1536.
[13] J.M. Wu, “Multilayer Potts perceptrons with Levenberg-Marquardt learning,” IEEE Trans. NeuralNetw., 2008, vol. 19, pp. 2032–2043.
[14] P. Chandra, Y. Singh, “An activation function adapting training algorithm for sigmoidal feedforward networks,” Neurocomputing., 2004, vol. 61, pp. 429–437.
[15] F.M. Ham, I. Kostanic, “Principles of neurocomputing for science and engineering,” 2nd edn. McGraw Hill, 2001, New York.
[16] L. Ait-Gougam, M. Tribeche, F. Mekideche-Chafa, “A systematic investigation of a neural network for function approximation” Neural Networks., 2008, vol. 21, pp. 1311_1317.
[17] M. Bogdan, F. Wilamowski, Y. Hao, “Improved computation for Levenberg Marquardt training” IEEE Trans. Neural Netw., 2010, vol. 21, pp. 930-93.
[18] S. Haykin, “Neural Networks: A Comprehensive Foundation,” Macmillan College Publishing, 1994, New-York.
[19] Y. Liu, J.A Starzyk, and Z. Zhu, “Optimized approximation algorithm in neural networks without overfitting,” IEEE Trans. Neural Netws., 2008, vol. 19, pp. 983–995.
[20] M. Bogdan, M. Wilamowski, and Yu. Hao, “Improved Computation for Levenberg–Marquardt Training,” IEEE Trans., 2010.
[21] N. Ampazis, and S.J. Perantonis, “Two highly efficient second-order algorithms for training feedforward networks,” IEEE Trans. Neural Netw., 2002, vol. 13, pp.1064–1074.
[22] D. Nguyen, B. Widrow, “Improving the learning speed of 2-layer neural networks by choosing initial values of the adaptive weights,” Proc. of the Int. Joint Conference on Neural Networks., 1990, vol. 3, pp. 21–26.
Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007