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

Cluster Sampling Method01:20

Cluster Sampling Method

15.2K
Appropriate sampling methods ensure that samples are drawn without bias and accurately represent the population. Because measuring the entire population in a study is not practical, researchers use samples to represent the population of interest.
To choose a cluster sample, divide the population into clusters (groups) and then randomly select some of the clusters. All the members from these clusters are in the cluster sample. For example, if you randomly sample four departments from your...
15.2K
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

299
Pharmacokinetic models are mathematical constructs that represent and predict the time course of drug concentrations in the body, providing meaningful pharmacokinetic parameters. These models are categorized into compartment, physiological, and distributed parameter models.
The distributed parameter models are specifically designed to account for variations and differences in some drug classes. This model is particularly useful for assessing regional concentrations of anticancer or...
299
Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data01:16

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

548
Statistical inference techniques, paramount in hypothesis testing, differentiate into two broad categories: parametric and nonparametric statistics.
Parametric statistics, as the name suggests, assumes that data follow a specific distribution, often a normal distribution. This assumption enables robust hypothesis testing and estimation. Parametric methods, like the Student's t-test or Goodness-of-fit test, are frequently employed in biostatistics due to their robustness. For instance,...
548
Estimating Population Mean with Unknown Standard Deviation01:22

Estimating Population Mean with Unknown Standard Deviation

8.9K
In practice, we rarely know the population standard deviation. In the past, when the sample size was large, this did not present a problem to statisticians. They used the sample standard deviation s as an estimate for σ and proceeded as before to calculate a confidence interval with close enough results. However, statisticians ran into problems when the sample size was small. A small sample size caused inaccuracies in the confidence interval.
William S. Gosset (1876–1937) of the...
8.9K
Sampling Distribution01:12

Sampling Distribution

18.5K
Given simple random samples of size n from a given population with a measured characteristic such as mean, proportion, or standard deviation for each sample, the probability distribution of all the measured characteristics is called a sampling distribution. How much the statistic varies from one sample to another is known as the sampling variability of a statistic. You typically measure the sampling variability of a statistic by its standard error. The standard error of the mean is an example...
18.5K
One-Way ANOVA: Equal Sample Sizes01:15

One-Way ANOVA: Equal Sample Sizes

4.2K
One-Way ANOVA can be performed on three or more samples with equal or unequal sample sizes. When one-way ANOVA is performed on two datasets with samples of equal sizes, it can be easily observed that the computed F statistic is highly sensitive to the sample mean.
Different sample means can result in different values for the variance estimate: variance between samples. This is because the variance between samples is calculated as the product of the sample size and the variance between the...
4.2K

You might also read

Related Articles

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

Sort by
Same author

Triggering of viral and bacterial respiratory infection hospitalizations by traffic pollution exposure in a cohort of hospitalized adults.

PloS one·2026
Same author

Bispecific 10E8.4/iMab broadly neutralizing antibody in people with or without HIV-1: a partially randomized phase 1 trial.

Nature medicine·2026
Same author

Time to chemotherapy and oncofertility counseling in pediatric hematology/oncology patients: a single-center retrospective review.

Frontiers in oncology·2026
Same author

Priming of Multiple HIV Neutralizing B Cell Precursors in Humans.

medRxiv : the preprint server for health sciences·2026
Same author

Coordinated immune response distinguishes duration of SARS-CoV-2 viral particle shedding in humans.

iScience·2026
Same author

Viral variant but not host factors associate with SARS-CoV-2 viral kinetics.

Communications medicine·2026

Related Experiment Video

Updated: Mar 2, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.4K

Fast Nonparametric Density-Based Clustering of Large Data Sets Using a Stochastic Approximation Mean-Shift Algorithm.

Ollivier Hyrien1, Andrea Baran1

  • 1Department of Biostatistics and Computational Biology, University of Rochester, 14642, Rochester, New York, U.S.A.

Journal of Computational and Graphical Statistics : a Joint Publication of American Statistical Association, Institute of Mathematical Statistics, Interface Foundation of North America
|May 9, 2017
PubMed
Summary

A new density-based clustering algorithm significantly speeds up the mean-shift procedure. This novel approach achieves near-identical results with much lower computational complexity, making it suitable for large datasets.

Keywords:
Image segmentationLarge data setsRobbins-Monro procedure

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K
Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

14.3K

Related Experiment Videos

Last Updated: Mar 2, 2026

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations
12:27

Large-scale Reconstructions and Independent, Unbiased Clustering Based on Morphological Metrics to Classify Neurons in Selective Populations

Published on: February 15, 2017

7.4K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

12.0K
Trajectory Data Analyses for Pedestrian Space-time Activity Study
16:14

Trajectory Data Analyses for Pedestrian Space-time Activity Study

Published on: February 25, 2013

14.3K

Area of Science:

  • Computer Science
  • Data Science
  • Machine Learning

Background:

  • Mean-shift is a nonparametric clustering algorithm based on density estimation.
  • It identifies clusters by finding modes in data density.
  • Mean-shift's O(n^2) complexity limits its scalability for large datasets.

Purpose of the Study:

  • To develop a faster density-based clustering algorithm.
  • To overcome the scalability limitations of the mean-shift algorithm.
  • To achieve comparable clustering accuracy with improved efficiency.

Main Methods:

  • A novel algorithm combining subsampling and stochastic approximation.
  • Achieves a potential complexity of O(n) per iteration.
  • Convergence properties are theoretically established.

Main Results:

  • The proposed algorithm demonstrates significantly faster performance than mean-shift.
  • Achieved tens to hundreds of times speedup in image segmentation tasks.
  • Negligible clustering errors were observed compared to mean-shift.
  • Results are virtually identical to the traditional mean-shift algorithm.

Conclusions:

  • The novel algorithm offers a scalable and efficient alternative for density-based clustering.
  • It effectively addresses the computational challenges of mean-shift for large-scale data.
  • Potential for integration with existing acceleration techniques for further performance gains.