메뉴 건너뛰기




Volumn 18, Issue 3, 2003, Pages 213-218

A solution for the N-bit parity problem using a single translated multiplicative neuron

Author keywords

Multiplicative neurons; N bit parity problem; Neural networks

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; LEARNING ALGORITHMS; LEARNING SYSTEMS; THEOREM PROVING;

EID: 0842343634     PISSN: 13704621     EISSN: None     Source Type: Journal    
DOI: 10.1023/b:nepl.0000011147.74207.8c     Document Type: Article
Times cited : (30)

References (13)
  • 2
    • 0343002493 scopus 로고
    • N-bit parity networks
    • Brown, D. A.: N-bit parity networks, Neural Networks 6 (1993), 607-608.
    • (1993) Neural Networks , vol.6 , pp. 607-608
    • Brown, D.A.1
  • 3
    • 0023513717 scopus 로고
    • Learning, invariance, and generalization in high-order neural networks
    • Giles, C. L. and Maxwell, T.: Learning, invariance, and generalization in high-order neural networks, Applied Optics 26(23) (1987), 4972-4978.
    • (1987) Applied Optics , vol.26 , Issue.23 , pp. 4972-4978
    • Giles, C.L.1    Maxwell, T.2
  • 6
    • 0034233399 scopus 로고    scopus 로고
    • On the exact solution of the parity-N problem using ordered neural networks
    • Lavretsky, E.: On the exact solution of the Parity-N problem using ordered neural networks, Neural Networks 13(6) (2000), 643-649.
    • (2000) Neural Networks , vol.13 , Issue.6 , pp. 643-649
    • Lavretsky, E.1
  • 7
    • 0036825833 scopus 로고    scopus 로고
    • N-bit parity neural networks: New solutions based on linear programming
    • Liu, D., Hohil, M. E. and Smith, S. H.: N-bit parity neural networks: new solutions based on linear programming, Neurocomputing 48 (2002), 477-488.
    • (2002) Neurocomputing , vol.48 , pp. 477-488
    • Liu, D.1    Hohil, M.E.2    Smith, S.H.3
  • 8
    • 0027268953 scopus 로고
    • Parity with two layer feedforward nets
    • Minor, J. M.: Parity with two layer feedforward nets, Neural Networks 6(5) (1993), 705-707.
    • (1993) Neural Networks , vol.6 , Issue.5 , pp. 705-707
    • Minor, J.M.1
  • 9
    • 0036482614 scopus 로고    scopus 로고
    • On the complexity of computing and learning with multiplicative neurons
    • Schmitt, M.: On the complexity of computing and learning with multiplicative neurons, Neural Computating 14(2) (2002), 241-301.
    • (2002) Neural Computating , vol.14 , Issue.2 , pp. 241-301
    • Schmitt, M.1
  • 10
    • 0031240054 scopus 로고    scopus 로고
    • On the solution of the parity problem by a single hidden layer feedforward neural network
    • Setiono, R.: On the solution of the parity problem by a single hidden layer feedforward neural network, Neurocomputing 16(3) (1997), 225-235.
    • (1997) Neurocomputing , vol.16 , Issue.3 , pp. 225-235
    • Setiono, R.1
  • 11
    • 0026953152 scopus 로고
    • How to solve the N-bit parity problem with two hidden units
    • Stork, D. G. and Allen, J. D.: How to solve the N-bit parity problem with two hidden units, Neural Networks 5(2) (1992), 923-926.
    • (1992) Neural Networks , vol.5 , Issue.2 , pp. 923-926
    • Stork, D.G.1    Allen, J.D.2
  • 12
    • 0036970554 scopus 로고    scopus 로고
    • The minimum number of errors in the N-parity and its solution with an incremental neural network
    • Torres-Moreno, J. M., Aguilar, J. C. and Gordon, M. B.: The minimum number of errors in the N-parity and its solution with an incremental neural network, Neural Processing Letters 16(3) (2002), 201-210.
    • (2002) Neural Processing Letters , vol.16 , Issue.3 , pp. 201-210
    • Torres-Moreno, J.M.1    Aguilar, J.C.2    Gordon, M.B.3
  • 13
    • 0036141237 scopus 로고    scopus 로고
    • A Bayesian evolutionary approach to the design and learning of heterogeneous neural trees
    • Zhang, B.-T.: A Bayesian evolutionary approach to the design and learning of heterogeneous neural trees, Integrated Computer-Aided Engineering 9(1) (2002), 73-86.
    • (2002) Integrated Computer-Aided Engineering , vol.9 , Issue.1 , pp. 73-86
    • Zhang, B.-T.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.