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

11.6K
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...
11.6K
Sign Test for Median of Single Population01:20

Sign Test for Median of Single Population

84
In general, the sign test serves as a nonparametric method to test hypotheses about the median of a single population when the data does not follow a known distribution. This simplicity makes it particularly useful for small sample sizes or when the assumptions of parametric tests cannot be met. The process begins with identifying a null hypothesis, typically stating that the population median equals a specific value. The alternative hypothesis could be that the median is either not equal to,...
84
Wilcoxon Signed-Ranks Test for Median of Single Population01:14

Wilcoxon Signed-Ranks Test for Median of Single Population

91
The Wilcoxon signed-rank test for the median of a single population is a nonparametric test used to evaluate whether the median of a population differs from a specified value. Unlike parametric tests, it does not require data to follow a normal distribution, making it suitable for non-normal or small samples. The test begins by calculating the difference (d) between each observation and the hypothesized median. The absolute values of these differences are ranked in ascending order, with ties...
91
Median01:08

Median

17.9K
Besides mean, the median is a widely used measure of central tendency. Typically, median is defined as the central or middle value of a data set, measured by arranging the data elements in an increasing or decreasing order. Since this middle value is not affected by the precise numerical values of the outliers or fluctuations, it is insensitive to them. Hence, in cases where a data set may have outliers or the extreme values are not known, the median is a better measure of the central tendency...
17.9K
Model Approaches for Pharmacokinetic Data: Distributed Parameter Models01:06

Model Approaches for Pharmacokinetic Data: Distributed Parameter Models

56
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...
56
Protein Networks02:26

Protein Networks

3.9K
An organism can have thousands of different proteins, and these proteins must cooperate to ensure the health of an organism. Proteins bind to other proteins and form complexes to carry out their functions. Many proteins interact with multiple other proteins creating a complex network of protein interactions.
These interactions can be represented through maps depicting protein-protein interaction networks, represented as nodes and edges. Nodes are circles that are representative of a protein,...
3.9K

You might also read

Related Articles

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

Sort by
Same author

Network clustering algorithms and preprocessing pipelines for robust cell type identification in single-cell RNA sequencing data.

Scientific reports·2026
Same author

Scale invariance and statistical significance in complex weighted networks.

Physical review. E·2026
Same author

Unlocking the potential of computational phenotypic drug discovery: methods, challenges, and future directions.

NPJ systems biology and applications·2026
Same author

Detectability threshold in weighted modular networks.

Physical review. E·2026
Same author

Shortest-path percolation on scale-free networks.

Physical review. E·2026
Same author

Triadic percolation on multilayer networks.

Physical review. E·2026
Same journal

Turbulent flow in a vortex separator with a directed pipe inlet.

Scientific reports·2026
Same journal

Systematic characteristic evaluation of clay-based cementitious material derived from calcium carbide residue and waste tile powder.

Scientific reports·2026
Same journal

Retraction Note: Improvement of a rapid diagnostic application of monoclonal antibodies against avian influenza H7 subtype virus using Europium nanoparticles.

Scientific reports·2026
Same journal

Applying large language models to spam detection in the Kazakh low-resource language setting.

Scientific reports·2026
Same journal

An open-source 3D printing system enabling in-situ freeze-thaw processing of hydrogels.

Scientific reports·2026
Same journal

An enhanced EfficientNet framework for automated waste classification using cosine annealing and label smoothing.

Scientific reports·2026
See all related articles

Related Experiment Video

Updated: May 30, 2025

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.1K

Parallel median consensus clustering in complex networks.

Md Taufique Hussain1, Mahantesh Halappanavar2, Samrat Chatterjee2

  • 1Department of Intelligent Systems Engineering, Indiana University, Bloomington, IN, USA. mth@iu.edu.

Scientific Reports
|January 30, 2025
PubMed
Summary
This summary is machine-generated.

This study introduces a faster algorithm for graph clustering consensus, improving accuracy in identifying community structures. The parallel algorithm significantly speeds up analysis for large datasets, like those from single-cell experiments.

More Related Videos

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

6.9K
Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

982

Related Experiment Videos

Last Updated: May 30, 2025

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics
07:28

JUMPn: A Streamlined Application for Protein Co-Expression Clustering and Network Analysis in Proteomics

Published on: October 19, 2021

3.1K
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

6.9K
Modeling the Functional Network for Spatial Navigation in the Human Brain
05:55

Modeling the Functional Network for Spatial Navigation in the Human Brain

Published on: October 13, 2023

982

Area of Science:

  • Graph theory
  • Computational biology
  • Data science

Background:

  • Clustering algorithms are essential for analyzing complex data structures.
  • Existing methods for graph clustering consensus often overlook graph topology and can be computationally intensive.
  • Accurate community detection is crucial in fields like single-cell biology.

Purpose of the Study:

  • To develop a novel algorithm for finding consensus in graph clustering solutions.
  • To improve the speed and accuracy of graph partitioning compared to existing methods.
  • To create a parallelizable algorithm for analyzing large-scale real-world graphs.

Main Methods:

  • Formulated the consensus problem as a median set partitioning problem.
  • Proposed a greedy optimization technique incorporating graph structure.
  • Developed a parallel algorithm by removing sequential dependencies.

Main Results:

  • The algorithm achieves comparable solution quality significantly faster than other median set partition approaches.
  • The consensus partition accurately captures community structure in graphs with known communities.
  • The parallel algorithm demonstrates a 35x speedup on large graphs using 64 cores.

Conclusions:

  • The developed algorithm offers an efficient and accurate method for graph clustering consensus.
  • The parallel implementation makes it suitable for analyzing large, complex datasets, including mass cytometry data.
  • This approach enhances community detection in graph-based data analysis.