메뉴 건너뛰기




Volumn 9, Issue 1, 1999, Pages 1-12

A Constructive Approach to Calculating Lower Entropy Bounds

Author keywords

Classification problems; Complexity; Constructive algorithms; Limited and integer weights; N dimensional volumes; Number of bits

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; COMPUTER ARCHITECTURE; COMPUTER NETWORKS; COMPUTER SYSTEMS PROGRAMMING; INFORMATION THEORY; PROBLEM SOLVING; VLSI CIRCUITS;

EID: 0033075190     PISSN: 13704621     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1018659009494     Document Type: Article
Times cited : (2)

References (29)
  • 2
    • 0004259250 scopus 로고    scopus 로고
    • Oxford Univ. Press and the Inst. of Physics Publ: New York, NY
    • E. Fiesler and R. Beale (eds), Handbook of Neural Computation, Oxford Univ. Press and the Inst. of Physics Publ: New York, NY, 1996.
    • (1996) Handbook of Neural Computation
    • Fiesler, E.1    Beale, R.2
  • 3
    • 0029696220 scopus 로고    scopus 로고
    • Entropy bounds for classification algorithms
    • V. Beiu, "Entropy bounds for classification algorithms", Neural Network World, Vol. 6, pp. 497-505, 1996.
    • (1996) Neural Network World , vol.6 , pp. 497-505
    • Beiu, V.1
  • 4
    • 84902205190 scopus 로고    scopus 로고
    • On the possibilities of the limited precision weights neural networks in classification problems
    • J. Mira, R. Moreno-Díaz and J. Cabestany (eds) Biological and Artificial Computation: From Neuroscience to Technology, Springer-Verlag: Berlin, June
    • S. Draghici and I.K. Sethi, "On the possibilities of the limited precision weights neural networks in classification problems", in J. Mira, R. Moreno-Díaz and J. Cabestany (eds) Biological and Artificial Computation: From Neuroscience to Technology, Lecture Notes in Computer Science 1240, pp. 753-762, Springer-Verlag: Berlin, June 1997.
    • (1997) Lecture Notes in Computer Science , vol.1240 , pp. 753-762
    • Draghici, S.1    Sethi, I.K.2
  • 5
    • 84902189013 scopus 로고    scopus 로고
    • Tight bounds on the size of neural networks for classification problems
    • J. Mira, R. Moreno-Díaz and J. Cabestany (eds) Biological and Artificial Computation: From Neuroscience to Technology, Springer-Verlag: Berlin, June
    • V. Beiu and T. De Pauw, "Tight bounds on the size of neural networks for classification problems", in J. Mira, R. Moreno-Díaz and J. Cabestany (eds) Biological and Artificial Computation: From Neuroscience to Technology, Lecture Notes in Computer Science 1240, pp. 743-752, Springer-Verlag: Berlin, June 1997.
    • (1997) Lecture Notes in Computer Science , vol.1240 , pp. 743-752
    • Beiu, V.1    De Pauw, T.2
  • 8
    • 0000702737 scopus 로고
    • The synthesis of networks from threshold elements
    • E.I. Neciporuk, "The synthesis of networks from threshold elements", Soviet Mathematics - Doklady, Vol. 5, pp. 163-166, 1964 (English transl. in Automation Express, Vol. 7, pp. 27-32 and pp. 35-39, 1964).
    • (1964) Soviet Mathematics - Doklady , vol.5 , pp. 163-166
    • Neciporuk, E.I.1
  • 9
    • 0011967238 scopus 로고
    • English transl.
    • E.I. Neciporuk, "The synthesis of networks from threshold elements", Soviet Mathematics - Doklady, Vol. 5, pp. 163-166, 1964 (English transl. in Automation Express, Vol. 7, pp. 27-32 and pp. 35-39, 1964).
    • (1964) Automation Express , vol.7 , pp. 27-32
  • 10
    • 0001687394 scopus 로고
    • The synthesis of circuits from threshold elements
    • O.B. Lupanov, "The synthesis of circuits from threshold elements", Problemy Kibernetiki, Vol. 20, pp. 109-140, 1973.
    • (1973) Problemy Kibernetiki , vol.20 , pp. 109-140
    • Lupanov, O.B.1
  • 12
    • 0026367608 scopus 로고
    • Depth-size tradeoffs for neural computations
    • K.-Y. Siu, V. Roychowdhury and T. Kailath, "Depth-size tradeoffs for neural computations", IEEE Trans. on Comp., Vol. C-40, pp. 1402-1412, 1991.
    • (1991) IEEE Trans. on Comp. , vol.C-40 , pp. 1402-1412
    • Siu, K.-Y.1    Roychowdhury, V.2    Kailath, T.3
  • 13
    • 0001632845 scopus 로고
    • On the capabilities of multilayer perceptrons
    • E.B. Baum, "On the capabilities of multilayer perceptrons", J. Complexity, Vol. 4, pp. 193-215, 1988.
    • (1988) J. Complexity , vol.4 , pp. 193-215
    • Baum, E.B.1
  • 14
    • 0025792215 scopus 로고
    • Bounds on the number of hidden neurons of multilayer perceptrons in classification and recognition
    • S.-C. Huang and Y.-F. Huang, "Bounds on the number of hidden neurons of multilayer perceptrons in classification and recognition", IEEE Trans. on Neural Networks, Vol. NN-2, pp. 47-55, 1991.
    • (1991) IEEE Trans. on Neural Networks , vol.NN-2 , pp. 47-55
    • Huang, S.-C.1    Huang, Y.-F.2
  • 15
    • 0027290318 scopus 로고
    • Bounds on the number of hidden units in binary-valued three-layer neural networks
    • M. Arai, "Bounds on the number of hidden units in binary-valued three-layer neural networks", Neural Networks, Vol. 6, pp. 855-860, 1993.
    • (1993) Neural Networks , vol.6 , pp. 855-860
    • Arai, M.1
  • 17
    • 2342481497 scopus 로고
    • PhD dissertation, Laboratoire de l'Informatique du Parallélisme LIP-IMAG École Normale Supérieure de Lyon, 46 Allée d'Italie, 69364 Lyon, France
    • H. Paugam-Moisy, "Optimisation des réseaux des neurones artificiels", PhD dissertation, Laboratoire de l'Informatique du Parallélisme LIP-IMAG (http://www.ens-lyon.fr/LIP/publis.us.html), École Normale Supérieure de Lyon, 46 Allée d'Italie, 69364 Lyon, France, 1992.
    • (1992) Optimisation des Réseaux des Neurones Artificiels
    • Paugam-Moisy, H.1
  • 18
    • 0344828792 scopus 로고
    • Connectivity versus entropy
    • D.Z. Anderson (ed.) Inst. of Physics Publ.: New York, NY
    • Y.S. Abu-Mostafa, "Connectivity versus entropy", in D.Z. Anderson (ed.) Neural Information Processing Systems, pp. 1-8, Inst. of Physics Publ.: New York, NY, 1988.
    • (1988) Neural Information Processing Systems , pp. 1-8
    • Abu-Mostafa, Y.S.1
  • 19
    • 0012010299 scopus 로고
    • ε-entropy and the complexity of feedforward neural networks
    • R.P. Lippmann, J.E. Moody and D.S. Touretzky (eds) Morgan Kaufmann: San Mateo, Calif.
    • R.C. Williamson, "ε-entropy and the complexity of feedforward neural networks", in R.P. Lippmann, J.E. Moody and D.S. Touretzky (eds) Advances in Neural Information Processing Systems 3, pp. 946-952, Morgan Kaufmann: San Mateo, Calif., 1991.
    • (1991) Advances in Neural Information Processing Systems , vol.3 , pp. 946-952
    • Williamson, R.C.1
  • 20
    • 0344828788 scopus 로고
    • VLSI-optimal neural network learning algorithm
    • D.W. Pearson, N.C. Steele and R.F. Albrecht (eds) Springer-Verlag: Vienna, April
    • V. Beiu and J.G. Taylor, "VLSI-optimal neural network learning algorithm", in D.W. Pearson, N.C. Steele and R.F. Albrecht (eds) Artificial Neural Nets and Genetic Algorithms, pp. 61-64, Springer-Verlag: Vienna, April 1995.
    • (1995) Artificial Neural Nets and Genetic Algorithms , pp. 61-64
    • Beiu, V.1    Taylor, J.G.2
  • 22
    • 0000354247 scopus 로고
    • Integer-weight neural networks
    • A.H. Khan and E.L. Hines, "Integer-weight neural networks", Electronic Lett., Vol. 30, pp. 1237-1238, 1994; see also: A.H. Khan, Feedforward neural networks with constrained weights, PhD dissertation, Intelligent Sys. Lab., Dept. of Eng., Warwick Univ., Coventry CV4 7AL, UK, 1996 (http://www.eng.warwick.ac.uk/~es2029).
    • (1994) Electronic Lett. , vol.30 , pp. 1237-1238
    • Khan, A.H.1    Hines, E.L.2
  • 23
    • 2342654562 scopus 로고    scopus 로고
    • PhD dissertation, Intelligent Sys. Lab., Dept. of Eng., Warwick Univ., Coventry CV4 7AL, UK
    • A.H. Khan and E.L. Hines, "Integer-weight neural networks", Electronic Lett., Vol. 30, pp. 1237-1238, 1994; see also: A.H. Khan, Feedforward neural networks with constrained weights, PhD dissertation, Intelligent Sys. Lab., Dept. of Eng., Warwick Univ., Coventry CV4 7AL, UK, 1996 (http://www.eng.warwick.ac.uk/~es2029).
    • (1996) Feedforward Neural Networks with Constrained Weights
    • Khan, A.H.1
  • 25
    • 85060602697 scopus 로고
    • Learning in threshold networks: A computational model and applications
    • P. Raghavan, "Learning in threshold networks: a computational model and applications", IBM Research Center, Tech. Rep. RC 13859, 1988; also in Proc. of the 1st Workshop on Computational Learning Theory, pp. 19-27, ACM Press: New York, NY, 1988.
    • (1988) IBM Research Center, Tech. Rep. RC 13859
    • Raghavan, P.1
  • 26
    • 85060602697 scopus 로고
    • ACM Press: New York, NY
    • P. Raghavan, "Learning in threshold networks: a computational model and applications", IBM Research Center, Tech. Rep. RC 13859, 1988; also in Proc. of the 1st Workshop on Computational Learning Theory, pp. 19-27, ACM Press: New York, NY, 1988.
    • (1988) Proc. of the 1st Workshop on Computational Learning Theory , pp. 19-27
  • 28
    • 0031674944 scopus 로고    scopus 로고
    • Reduced complexity constructive learning algorithm
    • V. Beiu, "Reduced complexity constructive learning algorithm", Neural Networks World, Vol. 8, pp. 1-38, 1998.
    • (1998) Neural Networks World , vol.8 , pp. 1-38
    • Beiu, V.1
  • 29
    • 0031295420 scopus 로고    scopus 로고
    • A VLSI optimal constructive algorithm for classification problems
    • C.H. Dagli, M. Akay, O. Ersoy, B.R. Fernández and A.E Smith (eds) ASME Press: Fairfield, N.J., November
    • S. Draghici, V. Beiu and I.K. Sethi, "A VLSI optimal constructive algorithm for classification problems", in C.H. Dagli, M. Akay, O. Ersoy, B.R. Fernández and A.E Smith (eds) Smart Engineering Systems: Neural Networks, Fuzzy Logic, Data Mining and Evolutionary Programming, pp. 145-151, ASME Press: Fairfield, N.J., November 1997.
    • (1997) Smart Engineering Systems: Neural Networks, Fuzzy Logic, Data Mining and Evolutionary Programming , pp. 145-151
    • Draghici, S.1    Beiu, V.2    Sethi, I.K.3


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