A Method for Building Partially Connected Neural Network
Abstract
Keywords
References
[1] Changchien, S.W.&Lu T. Mining association rules procedure to support on-line recommendation by customer and products fragmentation. Expert Systems with Applications, 20, 2001,pp:325-335.
http://dx.doi.org/10.1016/S0957-4174(01)00017-3
[2] D. Rumelhart, G. Hinton, and R. Williams, Parallel Distributed Processing. MIT Press,Cambridge, MA, 1986.
[3] D. Sarkar, “Methods to speed up error back propagation learning algorithm,” ACM Computing Surveys, vol. 27, no. 4, pp. 519–542, 1995.
http://dx.doi.org/10.1145/234782.234785
[4] Sanggil Kang, Can Isik. Patially Connected Feedforward Neural Network Structured by Input Types. IEEE Transactions on Neural Networks, Vol.16, No.1, January 2005.
http://dx.doi.org/10.1109/TNN.2004.839353
PMid:15732397
[5] D. E. Duckro, D. W. Quinn, and S. J. Gardner, “Neural network pruning with Tuckey Kramer multiple comparison procedure,” Neural Computat., vol. 14, pp. 1149–1168, 2002.
http://dx.doi.org/10.1162/089976602753633420
PMid:11972911
[6] Lang K.J and Witbrock M.J. Learning to tell two spirals apart. In proc. of the 1988 Connectionist Summer School, pp:52-59. Morgan Kaufmann, San Mateo, CA.
[7] A.Van Ooyen. Improving the Covergence of the Back-Propagation Algorithm. Neural Networks, Vol.5, 1992, pp:465-471.
http://dx.doi.org/10.1016/0893-6080(92)90008-7
Full Text: PDF


