Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Experiment Videos

Iterative generation of higher-order nets in polynomial time using linear programming.

A Roy1, S Mukhopadhyay

  • 1Dept. of Decision and Inf. Syst., Arizona State Univ., Tempe, AZ.

IEEE Transactions on Neural Networks
|January 1, 1997
PubMed
Summary
This summary is machine-generated.

Related Concept Videos

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Relation of family history of suicide to suicide attempts in alcoholics.

The American journal of psychiatry·2000
Same author

[Autoimmune hepatitis in children. Initial presentation as fulminant hepatic failure].

Acta gastroenterologica Latinoamericana·2000
Same author

Malnutrition and hypernatraemia in breastfed babies.

Annals of tropical paediatrics·2000
Same author

Somatosensory evoked potentials associated with thermal activation of type II Adelta mechanoheat nociceptive afferents.

The International journal of neuroscience·2000
Same author

Coronary artery bypass grafting without cardiopulmonary bypass in pheochromocytoma.

The Journal of thoracic and cardiovascular surgery·2000
Same author

Rate limitations of unitary event analysis.

Neural computation·2000
Same journal

Universal perceptron and DNA-like learning algorithm for binary neural networks: LSBF and PBF implementations.

IEEE transactions on neural networks·2013
Same journal

Guest editorial: special section on white box nonlinear prediction models.

IEEE transactions on neural networks·2011
Same journal

Data-based fault-tolerant control of high-speed trains with traction/braking notch nonlinearities and actuator failures.

IEEE transactions on neural networks·2011
Same journal

Guest editorial: special section on data-based control, modeling, and optimization.

IEEE transactions on neural networks·2011
Same journal

Neural network-based multiple robot simultaneous localization and mapping.

IEEE transactions on neural networks·2011
Same journal

Data-driven model-free adaptive control for a class of MIMO nonlinear discrete-time systems.

IEEE transactions on neural networks·2011
See all related articles

This study introduces a new algorithm for higher-order perceptrons, utilizing linear programming for efficient construction and training. The method yields significantly smaller neural networks for classification tasks compared to existing approaches.

Area of Science:

  • Artificial Intelligence
  • Machine Learning
  • Computational Neuroscience

Background:

  • Higher-order perceptrons offer enhanced pattern recognition capabilities.
  • Training higher-order perceptrons can be computationally intensive.
  • Existing methods may result in large network architectures.

Purpose of the Study:

  • To present a novel algorithm for constructing and training higher-order perceptrons.
  • To leverage linear programming for efficient neural network design.
  • To demonstrate the effectiveness of the proposed method for classification problems.

Main Methods:

  • Developed an algorithm based on linear programming models.
  • Applied the algorithm to construct and train higher-order perceptrons.

Related Experiment Videos

  • Proved polynomial time complexity for the algorithm.

    • Main Results:

    • Successfully constructed and trained higher-order perceptrons for classification.
    • Achieved polynomial time complexity, indicating computational efficiency.
    • Generated significantly smaller neural networks compared to prior studies.

    Conclusions:

    • The proposed linear programming-based algorithm offers an efficient approach for higher-order perceptron construction.
    • This method leads to more compact and potentially more generalizable neural network models.
    • The algorithm demonstrates practical utility in solving well-known classification problems.