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

Comparing the Survival Analysis of Two or More Groups01:20

Comparing the Survival Analysis of Two or More Groups

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 Cox...
Kruskal-Wallis Test01:19

Kruskal-Wallis Test

The Kruskal-Wallis test, also known as the Kruskal-Wallis H test, serves as a nonparametric alternative to the one-way ANOVA, offering a solution for analyzing the differences across three or more independent groups based on a single, ordinal-dependent variable. This statistical test is particularly valuable in scenarios where the data does not meet the normal distribution assumption required by its parametric counterparts. Kruskal-Wallis test is designed typically to handle ordinal data or...
Cluster Sampling Method01:20

Cluster Sampling Method

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...
Multiple Comparison Tests01:13

Multiple Comparison Tests

Multiple comparison test, abbreviated as MCT, is a post hoc analysis generally performed after comparing multiple samples with one or more tests. An MCT will help identify a significantly different sample among multiple samples or a factor among multiple factors.
It would be easy to compare two samples using a significance alpha level of 0.05. In other words, there is only one sample pair to be compared. However, it would be difficult to identify a significantly different sample if the number...
Causes of Similarity-Dissimilarity Effect01:26

Causes of Similarity-Dissimilarity Effect

The similarity-dissimilarity effect, a fundamental concept in social psychology, explains how interpersonal similarities and differences influence attraction and social interactions. This effect is supported by three key psychological perspectives: balance theory, social comparison theory, and consensual validation.Balance Theory and Cognitive ConsistencyBalance theory, developed by Fritz Heider, posits that individuals seek cognitive consistency in their relationships. When two people share...
Kendall's Tau Test01:16

Kendall's Tau Test

Kendall's tau test, also known as the Kendall rank coefficient test, is a nonparametric method for assessing association between two variables. This test is particularly useful for identifying significant correlations when the distributions of the sample and population are unknown. Developed in 1938 by the British statistician Sir Maurice George Kendall, the tau coefficient (denoted as τ) serves as a rank correlation coefficient, with values ranging from -1 to +1.
A τ value of +1 indicates that...

You might also read

Related Articles

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

Sort by
Same author

Complex Deep Neural Networks for Denoising Ultra-Fast Submillimeter T2*-weighted Imaging and Quantitative Susceptibility Mapping.

European journal of radiology artificial intelligence·2026
Same author

Correction: CiCLoDS: Joint cell clustering and gene selection for single-cell spatial transcriptomics.

Scientific reports·2026
Same author

Genetic recording of pancreatic beta cell proliferation.

Proceedings of the National Academy of Sciences of the United States of America·2026
Same author

CiCLoDS: Joint cell clustering and gene selection for single-cell spatial transcriptomics.

Scientific reports·2026
Same author

Benchmarking large language models for identifying transcription factor regulatory interactions.

Bioinformatics (Oxford, England)·2025
Same author

Contribution of Gli1<sup>+</sup> Adventitial Stem Cells to Smooth Muscle Cells in Atherosclerosis and Vascular Injury.

Advanced science (Weinheim, Baden-Wurttemberg, Germany)·2025

Related Experiment Video

Updated: Jul 4, 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

A practical comparison of two K-Means clustering algorithms.

Gregory A Wilkin1, Xiuzhen Huang

  • 1Department of Computer Science, Arkansas State University, Arkansas 72467, USA. awilkin@csm.astate.edu

BMC Bioinformatics
|June 27, 2008
PubMed
Summary

Lloyd's K-means Clustering is more efficient than Progressive Greedy K-means Clustering in both processing time and distance efficiency. This finding holds true for gene expression data and random datasets.

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

Related Experiment Videos

Last Updated: Jul 4, 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

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

Area of Science:

  • Computer Science
  • Bioinformatics
  • Data Mining

Background:

  • Data clustering identifies similar data, crucial for analyzing gene expression patterns.
  • Different clustering algorithm implementations can lead to varied performance and results.
  • K-means clustering is a widely used data clustering technique.

Purpose of the Study:

  • To compare the performance of two k-means clustering implementations: Lloyd's K-means Clustering and Progressive Greedy K-means Clustering.
  • To evaluate running times and distance efficiency between the two algorithms.

Main Methods:

  • Implementation and comparison of Lloyd's K-means Clustering algorithm.
  • Implementation and comparison of Progressive Greedy K-means Clustering algorithm.
  • Performance evaluation using gene expression datasets and randomly generated 3D datasets.

Main Results:

  • Lloyd's K-means Clustering demonstrated superior efficiency in terms of processing time.
  • Lloyd's K-means Clustering exhibited better distance efficiency, measured by mean squared-difference (MSD).
  • Both algorithms were tested on gene expression and random datasets.

Conclusions:

  • Lloyd's K-means Clustering is generally more efficient than Progressive Greedy K-means Clustering based on the implemented metrics.
  • The choice of algorithm may depend on specific situational requirements.
  • The study provides empirical evidence for the performance differences between k-means variants.