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

12.4K
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...
12.4K
Kendall's Coefficient of Concordance01:20

Kendall's Coefficient of Concordance

497
Kendall's Coefficient of Concordance (W), also known as Kendall's W, is a non-parametric statistical measure used to assess the agreement or concordance between multiple raters or judges when they rank a set of items. It is often used when you have ordinal data (ranks) and you want to see if there is consistency or consensus among the raters. It is widely applied in research areas such as psychology, medicine, and social sciences, where multiple judges are asked to rank or rate subjects...
497
Coefficient of Correlation01:12

Coefficient of Correlation

6.3K
The correlation coefficient, r, developed by Karl Pearson in the early 1900s, is numerical and provides a measure of strength and direction of the linear association between the independent variable x and the dependent variable y.
If you suspect a linear relationship between x and y, then r can measure how strong the linear relationship is.
What the VALUE of r tells us:
The value of r is always between –1 and +1: –1 ≤ r ≤ 1.
The size of the correlation r indicates the...
6.3K
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

283
Friedman's Two-Way Analysis of Variance by Ranks is a nonparametric test designed to identify differences across multiple test attempts when traditional assumptions of normality and equal variances do not apply. Unlike conventional ANOVA, which requires normally distributed data with equal variances, Friedman's test is ideal for ordinal or non-normally distributed data, making it particularly useful for analyzing dependent samples, such as matched subjects over time or repeated measures...
283
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

676
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...
676
Wilcoxon Signed-Ranks Test for Matched Pairs01:09

Wilcoxon Signed-Ranks Test for Matched Pairs

203
The Wilcoxon signed-rank test for matched pairs evaluates the null hypothesis by combining the ranks of differences with their signs. It essentially tests whether the median of the differences in a population of matched pairs is zero. Since the test incorporates more information than the sign test, it generally yields more trustable conclusions. This test also does not require the data to follow a normal distribution, but two conditions must be met for it to be applicable: (1) the data must...
203

You might also read

Related Articles

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

Sort by
Same author

RAPSN/rapsyn aggregation-induced HSPA/HSP70-BAG3 aggrephagy maintains CHRN integrity in myasthenia gravis.

Autophagy·2026
Same author

Targeting the Cerebellar Circuit: How Exercise Intervention Reshapes White Matter Networks to Alleviate Autism Symptoms.

Biology·2026
Same author

A Radial-Linear π-Conjugated Polymer by Integrating Poly(Para-phenylene Vinylene) and Cycloparaphenylene for Enhanced Optoelectronic and Electrochemical Performance.

Angewandte Chemie (International ed. in English)·2026
Same author

Learning to Super-Resolve Face Images via Dual-Domain Multi-scale Feature Interaction.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Selection, Aggregation, and Enhancement: Trajectory Consistent Diffusion Model for Image Super-Resolution.

IEEE transactions on image processing : a publication of the IEEE Signal Processing Society·2026
Same author

Uniportal robotic-assisted left upper lobectomy with pulmonary artery reconstruction for a central lung cancer: a step-by-step surgical technique.

Journal of visualized surgery·2026
Same journal

Intervention Feasible Region and Driver Risk Capacity Aware Human-Machine Collaborative Safe Trajectory Planning.

IEEE transactions on neural networks and learning systems·2026
Same journal

A Unified Differential Denoising Learning Framework With a Pre-Trained Model and Fuzzy Graph Networks for Drug-Drug Interaction Prediction.

IEEE transactions on neural networks and learning systems·2026
Same journal

Self-Supervised Continuous Dynamic Graph Representation Learning via Hawkes Processes.

IEEE transactions on neural networks and learning systems·2026
Same journal

cPU: Consistent Risk Estimator for Positive-Unlabeled Learning.

IEEE transactions on neural networks and learning systems·2026
Same journal

Tuning-Free Latent Diffusion Models for Ultrahigh-Resolution Image Editing.

IEEE transactions on neural networks and learning systems·2026
Same journal

Hidden Data Recovery and Forecasting via Next-Generation Reservoir Computing With Multiscale Delay Selection.

IEEE transactions on neural networks and learning systems·2026
See all related articles

Related Experiment Video

Updated: Aug 29, 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.3K

Consensus Clustering With Co-Association Matrix Optimization.

Yifan Shi, Zhiwen Yu, C L Philip Chen

    IEEE Transactions on Neural Networks and Learning Systems
    |September 9, 2022
    PubMed
    Summary
    This summary is machine-generated.

    This study introduces a new consensus clustering method (CC-CMO) that optimizes the co-association matrix by integrating label and feature space information. CC-CMO demonstrates superior performance over existing methods on real-world datasets.

    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

    7.0K
    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
    09:49

    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

    Published on: September 25, 2021

    4.4K

    Related Experiment Videos

    Last Updated: Aug 29, 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.3K
    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.0K
    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks
    09:49

    Divergence of Root Microbiota in Different Habitats based on Weighted Correlation Networks

    Published on: September 25, 2021

    4.4K

    Area of Science:

    • Computational Biology
    • Data Science
    • Machine Learning

    Background:

    • Consensus clustering integrates multiple data partitions for robust results.
    • Existing methods often lack optimization, ignore original data, and overlook noise.

    Purpose of the Study:

    • To propose a novel consensus clustering method (CC-CMO) for improved co-association matrix optimization.
    • To address limitations of existing methods by incorporating label and feature space information and noise reduction.

    Main Methods:

    • CC-CMO utilizes a weighted partition matrix and least squares regression (LSR) in label space.
    • In feature space, it minimizes reconstruction error via doubly stochastic normalization for noise elimination and local affinity learning.
    • A unified optimization framework with an alternating optimization algorithm is employed.

    Main Results:

    • CC-CMO effectively integrates subspace representation, global structure, and local affinity.
    • The method demonstrates superior performance compared to state-of-the-art consensus clustering approaches.
    • Extensive experiments on diverse real-world datasets validate the proposed method's effectiveness.

    Conclusions:

    • CC-CMO offers a robust and optimized approach to consensus clustering.
    • The method enhances clustering accuracy by strategically leveraging data from both label and feature spaces.
    • CC-CMO represents a significant advancement in consensus clustering techniques.