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

468
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...
468
Methods of Medium Optimization01:28

Methods of Medium Optimization

19
Optimizing growth media enhances microbial proliferation and maximizes product yield. Statistical experimental design methodologies provide structured and reproducible approaches, offering progressively higher levels of robustness and efficiency.The One-Factor-at-a-Time (OFAT) MethodThe One-Factor-at-a-Time (OFAT) method involves adjusting a single variable while keeping all others constant. However, it cannot detect interactions between variables, often leading to suboptimal outcomes when...
19
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

394
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...
394
Phylogenetic Trees03:21

Phylogenetic Trees

51.8K
Phylogenetic trees come in many forms. It matters in which sequence the organisms are arranged from the bottom to the top of the tree, but the branches can rotate at their nodes without altering the information. The lines connecting individual nodes can be straight, angled, or even curved.
51.8K
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

1.4K
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...
1.4K
Compacting Factor test01:22

Compacting Factor test

689
The compacting factor test is a method used to assess the workability of concrete. It is  especially suitable for concrete mixes containing aggregates up to one and a half inches in size. This test involves specialized equipment consisting of two truncated cone-shaped hoppers and a cylinder, all with polished interior surfaces to minimize friction.
The procedure begins by placing concrete into the upper hopper without any compaction. Once filled, the bottom door of this hopper is opened,...
689

You might also read

Related Articles

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

Sort by
Same author

Similarity, confusability, and the density hypothesis.

Journal of experimental psychology. General·1987
See all related articles

Related Experiment Video

Updated: Mar 27, 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

An Efficient Metric Combinatorial Algorithm for Fitting Additive Trees.

J E Corter

    Multivariate Behavioral Research
    |January 16, 2016
    PubMed
    Summary

    A novel generalized triples (GT) algorithm efficiently fits additive trees to proximity data. This method offers comparable or better performance than existing algorithms, especially with noisy data.

    Area of Science:

    • Computational Statistics
    • Data Mining
    • Machine Learning

    Background:

    • Additive trees are a valuable model for representing hierarchical relationships in proximity data.
    • Existing algorithms for fitting additive trees can be computationally intensive, particularly for large datasets.

    Purpose of the Study:

    • To introduce a new combinatorial algorithm, the generalized triples (GT) method, for fitting additive trees.
    • To evaluate the computational efficiency and accuracy of the GT algorithm compared to existing methods.

    Main Methods:

    • The GT algorithm examines all triples of objects to determine nearest neighbors based on distance estimates.
    • It employs a sequential agglomerative approach, joining mutual nearest neighbors.
    • Computational complexity is approximately O(n^3).

    More Related Videos

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
    12:18

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

    Published on: January 11, 2020

    8.2K
    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.8K

    Related Experiment Videos

    Last Updated: Mar 27, 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
    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment
    12:18

    A Machine Learning Approach to Design an Efficient Selective Screening of Mild Cognitive Impairment

    Published on: January 11, 2020

    8.2K
    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis
    06:56

    Author Spotlight: Advancements in X-ray CT Tool Chain for Tree Core Analysis

    Published on: September 22, 2023

    1.8K

    Main Results:

    • The GT algorithm can accurately recover the additive tree structure when data perfectly fits the metric.
    • It demonstrates robust performance on data with errors or noise.
    • Simulations show GT is as effective as Sattath and Tversky, and De Soete algorithms in solution fit, while being computationally faster.

    Conclusions:

    • The generalized triples (GT) algorithm provides an efficient and effective method for fitting additive trees.
    • GT is particularly advantageous for moderate to large datasets and data containing errors.
    • This algorithm represents a significant improvement in computational efficiency for additive tree fitting.