Title :
The complexity of learning algorithm in PLN network
Author :
Zhang, Boming ; Zhang, Ling ; Zhang, Haijun
Author_Institution :
Dept. of Comput. Sci., Tsinghua Univ., Beijing, China
Abstract :
The complexity of the learning algorithm in the PLN (probabilistic logic neuron) network is investigated by using Markov chain theory. A computer simulation of a parity-checking problem has been implemented on a SUN-3 workstation using the C language. The results are given to show the correctness of the theoretical analysis
Keywords :
Markov processes; computational complexity; learning systems; neural nets; probabilistic logic; Markov chain; PLN network; SUN-3 workstation; computational complexity; computer simulation; learning algorithm; parity-checking problem; probabilistic logic neural network; Computer science; Computer simulation; Degradation; Educational institutions; Intelligent networks; Markov processes; Mathematics; Neurons; Output feedback; Probabilistic logic;
Conference_Titel :
Neural Networks, 1991. 1991 IEEE International Joint Conference on
Print_ISBN :
0-7803-0227-3
DOI :
10.1109/IJCNN.1991.170347
