Jove
Visualize
Contact Us

Related Concept Videos

Survival Tree01:19

Survival Tree

466
Survival trees are a non-parametric method used in survival analysis to model the relationship between a set of covariates and the time until an event of interest occurs, often referred to as the "time-to-event" or "survival time." This method is particularly useful when dealing with censored data, where the event has not occurred for some individuals by the end of the study period, or when the exact time of the event is unknown.
 Building a Survival Tree
Constructing a...
466

You might also read

Related Articles

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

Sort by
Same author

Lung mTOR activation leads to lung fibrosis or emphysema via senescence of specific lung cells.

Scientific reports·2026
Same author

Detection of Enterobacteriaceae in cerebrospinal fluid fluid of neonates with meningitis from tertiary care hospitals.

European review for medical and pharmacological sciences·2023
Same author

Revolutionizing the effect of Azadirachta indica extracts on edema induced changes in C-reactive protein and interleukin-6 in albino rats: in silico and in vivo approach.

European review for medical and pharmacological sciences·2023
Same author

[Morsicatio related white lesions of the tongue borders and lower lip: a case report].

Nederlands tijdschrift voor tandheelkunde·2022
Same author

Structure, optical and magnetic properties of a novel homometallic coordination polymers: Experimental and Computational studies.

Scientific reports·2020
Same author

A survey of antenatal and peripartum provision of information on analgesia and anaesthesia.

Anaesthesia·2019
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
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 Video

Updated: Mar 25, 2026

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
06:45

Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

Published on: October 28, 2022

2.2K

A fast feedforward training algorithm using a modified form of the standard backpropagation algorithm.

S Abid, F Fnaiech, M Najim

    IEEE Transactions on Neural Networks
    |February 5, 2008
    PubMed
    Summary
    This summary is machine-generated.

    A novel modified standard backpropagation (MBP) algorithm enhances neural network learning by minimizing a combined linear and nonlinear error. This approach significantly reduces iterations and learning time compared to standard backpropagation (SBP).

    More Related Videos

    A Protocol for the Administration of Real-Time fMRI Neurofeedback Training
    07:05

    A Protocol for the Administration of Real-Time fMRI Neurofeedback Training

    Published on: August 24, 2017

    11.6K
    Movement Retraining using Real-time Feedback of Performance
    08:16

    Movement Retraining using Real-time Feedback of Performance

    Published on: January 17, 2013

    13.9K

    Related Experiment Videos

    Last Updated: Mar 25, 2026

    Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator
    06:45

    Design and Application of a Fault Detection Method Based on Adaptive Filters and Rotational Speed Estimation for an Electro-Hydrostatic Actuator

    Published on: October 28, 2022

    2.2K
    A Protocol for the Administration of Real-Time fMRI Neurofeedback Training
    07:05

    A Protocol for the Administration of Real-Time fMRI Neurofeedback Training

    Published on: August 24, 2017

    11.6K
    Movement Retraining using Real-time Feedback of Performance
    08:16

    Movement Retraining using Real-time Feedback of Performance

    Published on: January 17, 2013

    13.9K

    Area of Science:

    • Artificial Intelligence
    • Machine Learning
    • Computational Neuroscience

    Background:

    • Standard backpropagation (SBP) is a widely used algorithm for training multilayer feedforward neural networks.
    • The learning process in SBP relies on minimizing an error criterion, typically the sum of squared errors.
    • Limitations of SBP include slow convergence and susceptibility to local minima.

    Discussion:

    • This study introduces a modified standard backpropagation (MBP) algorithm that minimizes a novel error criterion.
    • The MBP criterion incorporates both linear and nonlinear quadratic errors of the output neuron, with the quadratic error signal being weighted.
    • The selection of the weighting parameter is analyzed using rank convergence series and asymptotic constant error values.

    Key Insights:

    • The MBP algorithm demonstrates superior performance over SBP in reducing the total number of iterations required for learning.
    • MBP significantly decreases the overall learning time for neural networks.
    • Simulations on benchmark problems like the 4-bit parity checker and circle-in-the-square validate the effectiveness of MBP.

    Outlook:

    • The MBP algorithm offers a promising alternative for efficient neural network training.
    • Further research could explore the application of MBP to more complex network architectures and diverse machine learning tasks.
    • Investigating adaptive weighting strategies for the quadratic error could further enhance MBP's robustness and convergence speed.