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.
6. Comparison of universal approximators incorporating partial monotonicity by structure. Minin A; Velikova M; Lang B; Daniels H Neural Netw; 2010 May; 23(4):471-5. PubMed ID: 19796915 [TBL] [Abstract][Full Text] [Related]
7. Necessary conditions on minimal system configuration for general MISO Mamdani fuzzy systems as universal approximators. Ding Y; Ying H; Shao S IEEE Trans Syst Man Cybern B Cybern; 2000; 30(6):857-64. PubMed ID: 18252416 [TBL] [Abstract][Full Text] [Related]
8. Intelligent-Critic-Based Tracking Control of Discrete-Time Input-Affine Systems and Approximation Error Analysis With Application Verification. Wang D; Gao N; Ha M; Zhao M; Wu J; Qiao J IEEE Trans Cybern; 2023 Oct; PP():. PubMed ID: 37796676 [TBL] [Abstract][Full Text] [Related]
9. Neural networks with a continuous squashing function in the output are universal approximators. Castro JL; Mantas CJ; BenÃtez JM Neural Netw; 2000 Jul; 13(6):561-3. PubMed ID: 10987509 [TBL] [Abstract][Full Text] [Related]
10. Relaxed conditions for radial-basis function networks to be universal approximators. Liao Y; Fang SC; Nuttle HL Neural Netw; 2003 Sep; 16(7):1019-28. PubMed ID: 14692636 [TBL] [Abstract][Full Text] [Related]
11. The GroupMax Neural Network Approximation of Convex Functions. Warin X IEEE Trans Neural Netw Learn Syst; 2023 Feb; PP():. PubMed ID: 37022406 [TBL] [Abstract][Full Text] [Related]
12. Intelligent robust tracking control for a class of uncertain strict-feedback nonlinear systems. Chang YC IEEE Trans Syst Man Cybern B Cybern; 2009 Feb; 39(1):142-55. PubMed ID: 19150764 [TBL] [Abstract][Full Text] [Related]
13. 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]
14. A learning rule for very simple universal approximators consisting of a single layer of perceptrons. Auer P; Burgsteiner H; Maass W Neural Netw; 2008 Jun; 21(5):786-95. PubMed ID: 18249524 [TBL] [Abstract][Full Text] [Related]
15. Smoothing neural network for L Li W; Bian W Neural Netw; 2021 Nov; 143():678-689. PubMed ID: 34403868 [TBL] [Abstract][Full Text] [Related]
16. Feedforward sigmoidal networks--equicontinuity and fault-tolerance properties. Chandra P; Singh Y IEEE Trans Neural Netw; 2004 Nov; 15(6):1350-66. PubMed ID: 15565765 [TBL] [Abstract][Full Text] [Related]
17. A one-layer recurrent neural network for nonsmooth pseudoconvex optimization with quasiconvex inequality and affine equality constraints. Liu N; Wang J; Qin S Neural Netw; 2022 Mar; 147():1-9. PubMed ID: 34953297 [TBL] [Abstract][Full Text] [Related]
18. Reinforcement learning controller design for affine nonlinear discrete-time systems using online approximators. Yang Q; Jagannathan S IEEE Trans Syst Man Cybern B Cybern; 2012 Apr; 42(2):377-90. PubMed ID: 21947529 [TBL] [Abstract][Full Text] [Related]
19. ReLU Networks Are Universal Approximators via Piecewise Linear or Constant Functions. Huang C Neural Comput; 2020 Nov; 32(11):2249-2278. PubMed ID: 32946706 [TBL] [Abstract][Full Text] [Related]
20. 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] [Next] [New Search]