Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Newton’s Method

Newton’s Method

Newton’s Method is a powerful iterative technique for approximating the roots of real-valued, differentiable functions, particularly when analytical solutions are impractical. This approach is widely used in scientific computing, engineering, and finance, where equations may be too complex for traditional algebraic methods to handle. The method relies on an iterative process that refines an initial estimate using the function’s derivative to approach the true solution progressively.

Neuroplasticity

Neuroplasticity

Neuroplasticity reflects the brain's remarkable capacity to adapt and evolve, responding dynamically to learning, experiences, or injury by reorganizing its neural circuitry. This reorganization involves creating new neural connections and refining old ones through a series of biological processes that contribute to the brain's lifelong development and adaptability.

Neural Circuits

Neural Circuits

Neural circuits and neuronal pools are two of the main structures found in the nervous system. Neural circuits are networks of neurons that work together to carry out a specific task or process. They consist of interconnected neurons and glial cells, which provide structural and metabolic support.
Neuronal pools are collections of nerve cells with similar functions and interact through chemical and electrical signals. These pools include both interneurons (the central neural circuit nodes that...

Survival Tree

Survival Tree

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 survival tree begins...

You might also read

Related Articles

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

Sort by

Same author

Exploring the utility and limitations of ChatGPT in scientific literature searches.

ESMO real world data and digital oncology·2026

Same author

Germline BRCA pathogenic variants in patients with ovarian cancer and post-poly (ADP-ribose) polymerase inhibitor myeloid neoplasms.

ESMO open·2024

Same author

Interstitial lung disease in patients enrolled in early-phase clinical trials: the ILDE study.

ESMO open·2024

Same author

Clinical efficacy of sequential treatments in KRASG12C-mutant metastatic colorectal cancer: findings from a real-life multicenter Italian study (CRC-KR GOIM).

ESMO open·2022

Same author

Modeling functional network topology following stroke through graph theory: functional reorganization and motor recovery prediction.

Brazilian journal of medical and biological research = Revista brasileira de pesquisas medicas e biologicas·2022

Same author

L-shell ionization of Cd: Structure of the x-ray emission spectrum.

Ultramicroscopy·2021

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Feeder-free Derivation of Neural Crest Progenitor Cells from Human Pluripotent Stem Cells

Feeder-free Derivation of Neural Crest Progenitor Cells from Human Pluripotent Stem Cells

Published on: May 22, 2014

An iterative pruning algorithm for feedforward neural networks.

G Castellano¹, A M Fanelli, M Pelillo

¹CNR, Bari.

IEEE Transactions on Neural Networks

|January 1, 1997

Summary

This summary is machine-generated.

This study introduces a novel artificial neural network pruning method. It iteratively removes units while maintaining performance, offering an efficient solution for optimizing network size.

Related Experiment Videos

Last Updated: Jul 7, 2026

Feeder-free Derivation of Neural Crest Progenitor Cells from Human Pluripotent Stem Cells

Feeder-free Derivation of Neural Crest Progenitor Cells from Human Pluripotent Stem Cells

Published on: May 22, 2014

Area of Science:

Computer Science
Artificial Intelligence
Machine Learning

Background:

Determining optimal artificial neural network (ANN) size is critical for effective learning and generalization.
Network pruning, a common technique, involves training an oversized network and subsequently removing redundant components.

Purpose of the Study:

To develop a new, efficient pruning method for ANNs.
To ensure network performance is not compromised during the pruning process.

Main Methods:

A novel pruning approach based on iterative unit elimination and weight adjustment.
Formulating the pruning problem as a system of linear equations.
Utilizing an efficient conjugate gradient algorithm for least-squares solutions.

Main Results:

The proposed method effectively prunes ANNs without performance degradation.
A simple criterion for unit selection was developed and validated.
Demonstrated effectiveness across various test problems.

Conclusions:

The developed pruning method offers an effective and efficient solution for ANN size optimization.
The conjugate gradient-based approach provides a practical criterion for unit removal.
The technique shows promise for improving ANN learning and generalization capabilities.