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

Survival Tree01:19

Survival Tree

497
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...
497
Application of Nonlinear Inequalities01:29

Application of Nonlinear Inequalities

314
A nonlinear inequality describes a comparison involving an expression that curves or behaves more complexly than a straight line. These inequalities often appear in forms that include squares, products, or variables in the denominator.To solve such an inequality, one starts by rewriting it so that zero appears on one side. For example, the inequality:  can be factored as: This form makes it easier to identify the values that cause the expression to equal zero. In this case, the...
314
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

407
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...
407
Calibration Curves: Linear Least Squares01:20

Calibration Curves: Linear Least Squares

5.3K
A calibration curve is a plot of the instrument's response against a series of known concentrations of a substance. This curve is used to set the instrument response levels, using the substance and its concentrations as standards. Alternatively, or additionally, an equation is fitted to the calibration curve plot and subsequently used to calculate the unknown concentrations of other samples reliably.
For data that follow a straight line, the standard method for fitting is the linear...
5.3K
Residuals and Least-Squares Property01:11

Residuals and Least-Squares Property

9.8K
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...
9.8K
Linearization and Approximation01:26

Linearization and Approximation

195
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...
195

You might also read

Related Articles

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

Sort by
Same author

A Framework of Composite Functional Gradient Methods for Generative Adversarial Models.

IEEE transactions on pattern analysis and machine intelligence·2019
Same author

Semi-supervised Convolutional Neural Networks for Text Categorization via Region Embedding.

Advances in neural information processing systems·2016
Same author

Sequence-based antigenic change prediction by a sparse learning method incorporating co-evolutionary information.

PloS one·2014
Same author

Longitudinal changes in total, 2-LTR circular, and integrated HIV-1 DNA during the first year of HIV-1 infection in CD4Low and CD4High patient groups with HIV-1 subtype AE.

Viral immunology·2014
Same author

Bacterial assembly and temporal dynamics in activated sludge of a full-scale municipal wastewater treatment plant.

The ISME journal·2014
Same author

Experimental evidence for s-wave pairing symmetry in superconducting Cu(x)Bi2Se3 single crystals using a scanning tunneling microscope.

Physical review letters·2014

Related Experiment Video

Updated: Apr 4, 2026

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
04:35

Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

Published on: July 3, 2020

3.8K

Learning Nonlinear Functions Using Regularized Greedy Forest.

Rie Johnson, Tong Zhang

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |September 10, 2015
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new method for learning decision forests, outperforming gradient boosting in accuracy and model size. The novel approach directly learns forest structures for improved nonlinear decision rule performance.

    Related Experiment Videos

    Last Updated: Apr 4, 2026

    Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach
    04:35

    Development of an Individual-Tree Basal Area Increment Model using a Linear Mixed-Effects Approach

    Published on: July 3, 2020

    3.8K

    Area of Science:

    • Machine Learning
    • Data Mining
    • Computer Science

    Background:

    • Standard methods for learning decision rules use boosted decision trees like Adaboost and gradient boosting.
    • These traditional algorithms often treat tree learners as black boxes, limiting direct optimization of the forest structure.

    Purpose of the Study:

    • To develop a novel method for learning forests of nonlinear decision rules with general loss functions.
    • To directly optimize the underlying forest structure rather than treating tree learners as black boxes.

    Main Methods:

    • The proposed method employs a fully-corrective regularized greedy search algorithm.
    • This approach directly learns decision forests by utilizing the forest's inherent structure.

    Main Results:

    • The new method achieved higher accuracy compared to gradient boosting on multiple datasets.
    • The proposed approach also resulted in smaller model sizes than traditional gradient boosting.

    Conclusions:

    • Directly learning decision forests via fully-corrective regularized greedy search offers advantages over standard boosting methods.
    • This technique provides a more effective way to build accurate and compact nonlinear decision rule models.