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

Quantifying and Rejecting Outliers: The Grubbs Test01:02

Quantifying and Rejecting Outliers: The Grubbs Test

3.3K
Sometimes, a data set can have a recorded numerical observation that greatly  deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier.  To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...
3.3K
Survival Tree01:19

Survival Tree

295
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...
295
Truncation in Survival Analysis01:09

Truncation in Survival Analysis

451
Truncation in survival analysis refers to the exclusion of individuals or events from the dataset based on specific criteria related to the time of the event. This exclusion can happen in two primary forms: left truncation and right truncation.
Left truncation occurs when individuals who experienced the event of interest before a certain time are not included in the study. This is often due to a "delayed entry" into the study where only those who survive until a certain entry point are...
451
Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

6.0K
A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n)  to the number of categories (k).
6.0K
Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

458
Survival analysis is a cornerstone of medical research, used to evaluate the time until an event of interest occurs, such as death, disease recurrence, or recovery. Unlike standard statistical methods, survival analysis is particularly adept at handling censored data—instances where the event has not occurred for some participants by the end of the study or remains unobserved. To address these unique challenges, specialized techniques like the Kaplan-Meier estimator, log-rank test, and...
458
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

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

You might also read

Related Articles

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

Sort by
Same journal

A comprehensive estimator for the Fréchet distribution: asymptotical efficiency, and practical applications to health studies.

Journal of the Korean Statistical Society·2025
Same journal

Monitoring parameter change for bivariate time series models of counts.

Journal of the Korean Statistical Society·2023
Same journal

A novel high-order multivariate Markov model for spatiotemporal analysis with application to COVID-19 outbreak.

Journal of the Korean Statistical Society·2023
Same journal

Goodness of fit test for uniform distribution with censored observation.

Journal of the Korean Statistical Society·2023
Same journal

Empirical likelihood for spatial dynamic panel data models.

Journal of the Korean Statistical Society·2021
Same journal

Rejoinder: A comparison of Monte Carlo methods for computing marginal likelihoods of item response theory models.

Journal of the Korean Statistical Society·2021

Related Experiment Video

Updated: Dec 8, 2025

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.6K

Detecting possibly frequent change-points: Wild Binary Segmentation 2 and steepest-drop model selection-rejoinder.

Piotr Fryzlewicz1

  • 1Department of Statistics, London School of Economics, Houghton Street, London, WC2A 2AE UK.

Journal of the Korean Statistical Society
|September 21, 2020
PubMed
Summary

A novel method for detecting multiple change-points in data, Wild Binary Segmentation 2 with Steepest Drop to Low Levels (WBS2.SDLL), excels in frequent change-point scenarios. This approach is fast, accurate, and outperforms existing methods.

Keywords:
Adaptive algorithmsBreak detectionJump detectionMultiscale methodsSegmentationrandomized algorithms

More Related Videos

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.6K
Single Droplet Digital Polymerase Chain Reaction for Comprehensive and Simultaneous Detection of Mutations in Hotspot Regions
08:23

Single Droplet Digital Polymerase Chain Reaction for Comprehensive and Simultaneous Detection of Mutations in Hotspot Regions

Published on: September 25, 2018

13.8K

Related Experiment Videos

Last Updated: Dec 8, 2025

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types
12:39

A Novel Bayesian Change-point Algorithm for Genome-wide Analysis of Diverse ChIPseq Data Types

Published on: December 10, 2012

11.6K
Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER
14:06

Detection of Rare Genomic Variants from Pooled Sequencing Using SPLINTER

Published on: June 23, 2012

15.6K
Single Droplet Digital Polymerase Chain Reaction for Comprehensive and Simultaneous Detection of Mutations in Hotspot Regions
08:23

Single Droplet Digital Polymerase Chain Reaction for Comprehensive and Simultaneous Detection of Mutations in Hotspot Regions

Published on: September 25, 2018

13.8K

Area of Science:

  • Statistics
  • Data Science
  • Time Series Analysis

Background:

  • Existing multiple change-point detection methods often struggle with frequent change-point scenarios.
  • Accurate identification of change-points is crucial for analyzing sequential data.

Purpose of the Study:

  • To introduce a new change-point detection methodology, WBS2.SDLL, effective in both infrequent and frequent change-point settings.
  • To address the limitations of current procedures in high-frequency change-point detection.

Main Methods:

  • The proposed method combines Wild Binary Segmentation 2 (WBS2), a recursive algorithm generating a complete solution path.
  • It integrates a novel, non-penalty-based model selection criterion, Steepest Drop to Low Levels (SDLL), utilizing thresholding.

Main Results:

  • The WBS2.SDLL procedure demonstrates consistency in change-point detection.
  • It significantly outperforms competing methods, particularly in frequent change-point scenarios.

Conclusions:

  • WBS2.SDLL offers a robust and efficient solution for multiple change-point detection.
  • The method is fast, easy to implement, and does not require window or span parameter selection.