Skip to Main Content

Advertisement

MIT Press Direct, home
header search
Search
Advanced Search
Skip Nav Destination

A Polynomial Time Algorithm for Generating Neural Networks for Pattern Classification: Its Stability Properties and Some Test Results

Neural Computation (1993) 5 (2): 317–330.
This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.
Principled deep neural network training through linear programming
  • Daniel Bienstock
  • Gonzalo Muñoz
  • Sebastian Pokutta
Discrete Optimization (2023) 49: 100795.
Taking advantage of improved resource allocating network and latent semantic feature selection approach for automated text categorization
  • Wei Song
  • Jiu Zhen Liang
  • Xiao Liang He
  • Peng Chen
Applied Soft Computing (2014) 21: 210.
Methods for pattern selection, class-specific feature selection and classification for automated learning
  • Asim Roy
  • Patrick D. Mackin
  • Somnath Mukhopadhyay
Neural Networks (2013) 41: 113.
A fast learning algorithm for training feedforward neural networks
  • Ashok Kumar Goel
  • Suresh C. Saxena
  • Surekha Bhanot
International Journal of Systems Science (2006) 37 (10): 709.
A mathematical solution to a network construction problem
  • Y. Takahashi
IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (2000) 47 (2): 166.
A geometrical representation of McCulloch-Pitts neural model and its applications
IEEE Transactions on Neural Networks (1999) 10 (4): 925.
Function approximation-fast-convergence neural approach based on spectral analysis
  • C. Citterio
  • A. Pelagotti
  • V. Piuri
  • L. Rocca
IEEE Transactions on Neural Networks (1999) 10 (4): 725.
Feature Selection via Mathematical Programming
  • P. S. Bradley
  • O. L. Mangasarian
  • W. N. Street
INFORMS Journal on Computing (1998) 10 (2): 209.
Efficient Adaptive Learning for Classification Tasks with Binary Units
  • J. Manuel Torres Moreno
  • Mirta B. Gordon
Neural Computation (1998) 10 (4): 1007.
Simulating human generalization-and-approximation capability by minimal layer networks loaded with minimal samples
  • Yoshikane Takahashi
Neurocomputing (1997) 16 (2): 149.
A neural-network learning theory and a polynomial time RBF algorithm
  • A. Roy
  • S. Govil
  • R. Miranda
IEEE Transactions on Neural Networks (1997) 8 (6): 1301.
Iterative generation of higher-order nets in polynomial time using linear programming
  • A. Roy
  • S. Mukhopadhyay
IEEE Transactions on Neural Networks (1997) 8 (2): 402.
A mathematical solution to a Network Designing Problem
  • Yoshikane Takahashi
Neurocomputing (1997) 15 (2): 107.
A Mathematical Solution to a Network Designing Problem
  • YOSHIKANE TAKAHASHI
Journal of Computational Biology (1996) 3 (1): 97.
A comparison of nonlinear optimization methods for supervised learning in multilayer feedforward neural networks
  • James W. Denton
  • Ming S. Hung
European Journal of Operational Research (1996) 93 (2): 358.
An algorithm to generate radial basis function (RBF)-like nets for classification problems
  • Asim Roy
  • Sandeep Govil
  • Raymond Miranda
Neural Networks (1995) 8 (2): 179.

Advertisement

  • Online ISSN 1530-888X
  • Print ISSN 0899-7667
A product of The MIT Press
Newsletter sign up

MIT Press Direct

Information

MIT Press

Contact Us

© 2024 The MIT Press
Close Modal
This Feature Is Available To Subscribers Only

or Create an Account

Close Modal
Close Modal
This site uses cookies. By continuing to use our website, you are agreeing to our privacy policy. No content on this site may be used to train artificial intelligence systems without permission in writing from the MIT Press.
Accept