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 Concept Videos

Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

7.1K
The vertical distance between the actual value of y and the estimated value of y. In other words, it measures the vertical distance between the actual data point and the predicted point on the line
If the observed data point lies above the line, the residual is positive, and the line underestimates the actual data value for y. If the observed data point lies below the line, the residual is negative, and the line overestimates the actual data value for y.
The process of fitting the best-fit...
7.1K
Gaussian Elimination: Problem Solving01:30

Gaussian Elimination: Problem Solving

321
Systems of linear equations in several variables are pivotal in modeling complex scenarios involving multiple unknowns and constraints. Such systems are widely used in various fields to represent relationships where several conditions must be simultaneously satisfied. Each variable in the system corresponds to an unknown quantity, while each equation imposes a linear constraint, leading to a structured approach for analyzing and solving real-world problems.A system of three equations with three...
321
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

438
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
438
Vector Algebra: Method of Components01:08

Vector Algebra: Method of Components

15.5K
It is cumbersome to find the magnitudes of vectors using the parallelogram rule or using the graphical method to perform mathematical operations like addition, subtraction, and multiplication. There are two ways to circumvent this algebraic complexity. One way is to draw the vectors to scale, as in navigation, and read approximate vector lengths and angles (directions) from the graphs. The other way is to use the method of components.
In many applications, the magnitudes and directions of...
15.5K
Quadratic Models01:23

Quadratic Models

370
Quadratic models are mathematical representations used to describe relationships in which the rate of change changes at a constant rate. These models appear in a wide variety of natural and engineered systems, especially those involving motion, forces, and optimization. One common application is analyzing the vertical motion of objects influenced by gravity, such as a ball thrown into the air.In such scenarios, the object's height changes over time in a curved pattern, rising to a maximum point...
370
Linearization and Approximation01:26

Linearization and Approximation

233
Linearization is a mathematical technique used to approximate complex, nonlinear functions with simpler linear models in the vicinity of a chosen reference point. The method is based on the idea that, although a function may be difficult to evaluate exactly, its behavior near a specific input value can often be closely approximated by the tangent line at that point. This approach is particularly useful when small deviations from a known value are involved.Consider the square root function, for...
233

You might also read

Related Articles

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

Sort by
Same author

Low-Temperature Triggered Shape Transformation of Liquid Metal Microdroplets.

ACS applied materials & interfacesยท2020
Same author

Survival Benefit of Metformin Use for Pancreatic Cancer Patients Who Underwent Pancreatectomy: Results From a Meta-Analysis.

Frontiers in medicineยท2020
Same author

Organohalogen compounds of emerging concern in Baltic Sea biota: Levels, biomagnification potential and comparisons with legacy contaminants.

Environment internationalยท2020
Same author

Water-Soluble Anthraquinone Photocatalysts Enable Methanol-Driven Enzymatic Halogenation and Hydroxylation Reactions.

ACS catalysisยท2020
Same author

Integrated sequencing and array comparative genomic hybridization in familial Parkinson disease.

Neurology. Geneticsยท2020
Same author

Treatment for tuberculosis of the subaxial cervical spine: a systematic review.

Archives of orthopaedic and trauma surgeryยท2020
Same journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

IEEE transactions on neural networks and learning systemsยท2026
Same journal

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

IEEE transactions on neural networks and learning systemsยท2026
Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

IEEE transactions on neural networks and learning systemsยท2026
Same journal

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

IEEE transactions on neural networks and learning systemsยท2026
Same journal

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systemsยท2026
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systemsยท2026
See all related articles

Related Experiment Video

Updated: Apr 30, 2026

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
08:27

Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

Published on: January 5, 2024

1.8K

Online nonnegative matrix factorization with robust stochastic approximation.

Naiyang Guan, Dacheng Tao, Zhigang Luo

    IEEE Transactions on Neural Networks and Learning Systems
    |May 9, 2014
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces an efficient online RSA-NMF algorithm (OR-NMF) for large-scale datasets. OR-NMF incrementally updates bases, offering faster convergence and better efficiency than existing online NMF methods.

    More Related Videos

    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    11.0K

    Related Experiment Videos

    Last Updated: Apr 30, 2026

    Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines
    08:27

    Author Spotlight: Efficient Image Recognition Using Directional Gradient Histogram Technique and Support Vector Machines

    Published on: January 5, 2024

    1.8K
    Deep Neural Networks for Image-Based Dietary Assessment
    13:19

    Deep Neural Networks for Image-Based Dietary Assessment

    Published on: March 13, 2021

    11.0K

    Area of Science:

    • Machine Learning
    • Data Science
    • Computer Vision

    Background:

    • Nonnegative matrix factorization (NMF) is a key dimension-reduction technique.
    • Conventional NMF methods struggle with large-scale and streaming datasets due to memory constraints.

    Purpose of the Study:

    • To develop an efficient online NMF algorithm suitable for large-scale and streaming data.
    • To address the limitations of conventional NMF in terms of memory and computational efficiency.

    Main Methods:

    • Proposed an online Robust Stochastic Approximation NMF (OR-NMF) algorithm.
    • OR-NMF processes data incrementally (sample or chunk per step) using robust stochastic approximation.
    • Implemented a buffering strategy to maintain constant time and space complexity per step.

    Main Results:

    • OR-NMF demonstrates faster convergence rates per update.
    • The algorithm is proven to converge almost surely to a local optimal solution.
    • Experimental results show OR-NMF outperforms existing online NMF (ONMF) algorithms in efficiency.

    Conclusions:

    • OR-NMF effectively handles large-scale and streaming datasets.
    • The proposed algorithm offers superior efficiency compared to existing ONMF methods.
    • OR-NMF proves effective for applications like face recognition and image annotation.