These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

144 related articles for article (PubMed ID: 27171269)

  • 1. A Single Hidden Layer Feedforward Network with Only One Neuron in the Hidden Layer Can Approximate Any Univariate Function.
    Guliyev NJ; Ismailov VE
    Neural Comput; 2016 Jul; 28(7):1289-304. PubMed ID: 27171269
    [TBL] [Abstract][Full Text] [Related]  

  • 2. On the approximation by single hidden layer feedforward neural networks with fixed weights.
    Guliyev NJ; Ismailov VE
    Neural Netw; 2018 Feb; 98():296-304. PubMed ID: 29301110
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Constructive approximation to multivariate function by decay RBF neural network.
    Hou M; Han X
    IEEE Trans Neural Netw; 2010 Sep; 21(9):1517-23. PubMed ID: 20693108
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Neural network approximation of continuous functionals and continuous functions on compactifications.
    Stinchcombe MB
    Neural Netw; 1999 Apr; 12(3):467-477. PubMed ID: 12662689
    [TBL] [Abstract][Full Text] [Related]  

  • 5. An analytical framework for local feedforward networks.
    Weaver S; Baird L; Polycarpou M
    IEEE Trans Neural Netw; 1998; 9(3):473-82. PubMed ID: 18252471
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Constructive function-approximation by three-layer artificial neural networks.
    Suzuki S
    Neural Netw; 1998 Aug; 11(6):1049-1058. PubMed ID: 12662774
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Universal Approximation Using Feedforward Neural Networks: A Survey of Some Existing Methods, and Some New Results.
    Chung Tsoi A; Scarselli F
    Neural Netw; 1998 Jan; 11(1):15-37. PubMed ID: 12662846
    [TBL] [Abstract][Full Text] [Related]  

  • 8. A constructive method for multivariate function approximation by multilayer perceptrons.
    Geva S; Sitte J
    IEEE Trans Neural Netw; 1992; 3(4):621-4. PubMed ID: 18276462
    [TBL] [Abstract][Full Text] [Related]  

  • 9. Existence and uniqueness results for neural network approximations.
    Williamson RC; Helmke U
    IEEE Trans Neural Netw; 1995; 6(1):2-13. PubMed ID: 18263280
    [TBL] [Abstract][Full Text] [Related]  

  • 10. Universal approximation to nonlinear operators by neural networks with arbitrary activation functions and its application to dynamical systems.
    Chen T; Chen H
    IEEE Trans Neural Netw; 1995; 6(4):911-7. PubMed ID: 18263379
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Classification ability of single hidden layer feedforward neural networks.
    Huang GB; Chen YQ; Babri HA
    IEEE Trans Neural Netw; 2000; 11(3):799-801. PubMed ID: 18249806
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Upper bounds on the number of hidden neurons in feedforward networks with arbitrary bounded nonlinear activation functions.
    Huang GB; Babri HA
    IEEE Trans Neural Netw; 1998; 9(1):224-9. PubMed ID: 18252445
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Universal approximation of extreme learning machine with adaptive growth of hidden nodes.
    Zhang R; Lan Y; Huang GB; Xu ZB
    IEEE Trans Neural Netw Learn Syst; 2012 Feb; 23(2):365-71. PubMed ID: 24808516
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Universal Approximation Using Radial-Basis-Function Networks.
    Park J; Sandberg IW
    Neural Comput; 1991; 3(2):246-257. PubMed ID: 31167308
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Neural network approximation: Three hidden layers are enough.
    Shen Z; Yang H; Zhang S
    Neural Netw; 2021 Sep; 141():160-173. PubMed ID: 33906082
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Synthesis of feedforward networks in supremum error bound.
    Ciesielski K; Sacha JP; Cios KJ
    IEEE Trans Neural Netw; 2000; 11(6):1213-27. PubMed ID: 18249848
    [TBL] [Abstract][Full Text] [Related]  

  • 17. Estimating the number of hidden neurons in a feedforward network using the singular value decomposition.
    Teoh EJ; Tan KC; Xiang C
    IEEE Trans Neural Netw; 2006 Nov; 17(6):1623-9. PubMed ID: 17131674
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Constructive feedforward neural networks using hermite polynomial activation functions.
    Ma L; Khorasani K
    IEEE Trans Neural Netw; 2005 Jul; 16(4):821-33. PubMed ID: 16121724
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Approximation capability in C(R (n)) by multilayer feedforward networks and related problems.
    Chen T; Chen H; Liu RW
    IEEE Trans Neural Netw; 1995; 6(1):25-30. PubMed ID: 18263282
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Universal approximation using incremental constructive feedforward networks with random hidden nodes.
    Huang GB; Chen L; Siew CK
    IEEE Trans Neural Netw; 2006 Jul; 17(4):879-892. PubMed ID: 16856652
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 8.