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

Improving Translational Accuracy02:07

Improving Translational Accuracy

11.4K
Base complementarity between the three base pairs of mRNA codon and the tRNA anticodon is not a failsafe mechanism. Inaccuracies can range from a single mismatch to no correct base pairing at all. The free energy difference between the correct and nearly correct base pairs can be as small as 3 kcal/ mol. With complementarity being the only proofreading step, the estimated error frequency would be one wrong amino acid in every 100 amino acids incorporated. However, error frequencies observed in...
11.4K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

57
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...
57
Survival Tree01:19

Survival Tree

88
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...
88
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

208
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
208
Regression Toward the Mean01:52

Regression Toward the Mean

6.3K
Regression toward the mean (“RTM”) is a phenomenon in which extremely high or low values—for example, and individual’s blood pressure at a particular moment—appear closer to a group’s average upon remeasuring. Although this statistical peculiarity is the result of random error and chance, it has been problematic across various medical, scientific, financial and psychological applications. In particular, RTM, if not taken into account, can interfere when...
6.3K
One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation01:24

One-Compartment Open Model: Wagner-Nelson and Loo Riegelman Method for ka Estimation

531
This lesson introduces two critical methods in pharmacokinetics, the Wagner-Nelson and Loo-Riegelman methods, used for estimating the absorption rate constant (ka) for drugs administered via non-intravenous routes. The Wagner-Nelson method relates ka to the plasma concentration derived from the slope of a semilog percent unabsorbed time plot. However, it is limited to drugs with one-compartment kinetics and can be impacted by factors like gastrointestinal motility or enzymatic degradation.
On...
531

You might also read

Related Articles

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

Sort by
Same author

A Case of Familial Chylomicronemia Syndrome Caused by a Novel Homozygous GPIHBP1 Mutation Successfully Treated with the Selective PPARα Modulator Pemafibrate.

Journal of atherosclerosis and thrombosis·2026
Same author

Efficacy of Automated Urinalysis in Detecting Low-Level Bacteriuria and Discriminating Bacterial Gram Status.

Clinical laboratory·2026
Same author

Defining a Cardiogenic Shock Center and Its Relationship to Outcomes Among Patients With Cardiogenic Shock - A Scoping Review.

Circulation reports·2026
Same author

Effectiveness of the Shock Team on Short-Term Outcomes in Patients With Cardiogenic Shock - Systematic Review and Meta-Analysis.

Circulation reports·2026
Same author

Comparative Efficacy of Noradrenaline vs. Other Vasopressors on Outcomes in Patients With Cardiogenic Shock - A Systematic Review and Meta-Analysis.

Circulation reports·2025
Same author

The Association Between Body Mass Index and In-hospital Mortality in Patients with Acute Myocardial Infarction Undergoing Percutaneous Coronary Intervention.

International heart journal·2025

Related Experiment Video

Updated: Jul 13, 2025

Author Spotlight: Analgesic Effect of Tuina on Rat Models with Compression of the Dorsal Root Ganglion Pain
05:49

Author Spotlight: Analgesic Effect of Tuina on Rat Models with Compression of the Dorsal Root Ganglion Pain

Published on: July 14, 2023

1.5K

Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modifications.

Hiroyuki Hanada1, Noriaki Hashimoto2, Kouichi Taji3

  • 1Center for Advanced Intelligence Project, RIKEN, Tokyo 103-0027, Japan hiroyuki.hanada@riken.jp.

Neural Computation
|October 16, 2023
PubMed
Summary
This summary is machine-generated.

This study introduces a generalized low-rank update (GLRU) method for incremental machine learning (ML). GLRU efficiently updates models when data changes, benefiting cross-validation and feature selection.

More Related Videos

Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

8.6K
Author Spotlight: Advancing Early Detection and Treatment of Gastrointestinal Tumors
03:05

Author Spotlight: Advancing Early Detection and Treatment of Gastrointestinal Tumors

Published on: February 16, 2024

1.1K

Related Experiment Videos

Last Updated: Jul 13, 2025

Author Spotlight: Analgesic Effect of Tuina on Rat Models with Compression of the Dorsal Root Ganglion Pain
05:49

Author Spotlight: Analgesic Effect of Tuina on Rat Models with Compression of the Dorsal Root Ganglion Pain

Published on: July 14, 2023

1.5K
Setting Limits on Supersymmetry Using Simplified Models
07:46

Setting Limits on Supersymmetry Using Simplified Models

Published on: November 15, 2013

8.6K
Author Spotlight: Advancing Early Detection and Treatment of Gastrointestinal Tumors
03:05

Author Spotlight: Advancing Early Detection and Treatment of Gastrointestinal Tumors

Published on: February 16, 2024

1.1K

Area of Science:

  • Machine Learning
  • Computational Statistics

Background:

  • Incremental machine learning (ML) is crucial for dynamic datasets.
  • Existing low-rank update methods are limited to linear estimators.
  • Updating ML models efficiently after data changes is computationally challenging.

Purpose of the Study:

  • To develop a generalized low-rank update (GLRU) method for ML.
  • To extend efficient model updating beyond linear estimators.
  • To enable efficient cross-validation and feature selection.

Main Methods:

  • Developed the generalized low-rank update (GLRU) method.
  • Formulated ML methods as regularized empirical risk minimization.
  • Extended low-rank update framework to support vector machines and logistic regression.

Main Results:

  • The GLRU method efficiently updates ML models with incremental data changes.
  • Achieved computational complexity proportional to the number of data changes.
  • Demonstrated efficiency in cross-validation and feature selection tasks.

Conclusions:

  • GLRU significantly enhances the efficiency of incremental ML.
  • The method is applicable to a broader range of ML algorithms.
  • GLRU offers a practical solution for model selection in dynamic environments.