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

Ranks01:02

Ranks

572
Unlike parametric methods, nonparametric statistics are ideal for nominal and ordinal data, requiring fewer assumptions about the population's nature or distribution. This makes nonparametric methods easier to apply and interpret, as they do not depend on parameters like mean or standard deviation. One common approach in nonparametric analysis is to sort data according to a specific criterion. For instance, we might arrange weather data from hottest to coldest days in a month or rank cities...
572
Friedman Two-way Analysis of Variance by Ranks01:21

Friedman Two-way Analysis of Variance by Ranks

561
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...
561
Cluster Sampling Method01:20

Cluster Sampling Method

15.5K
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.5K
Introduction to Nonparametric Statistics01:28

Introduction to Nonparametric Statistics

1.6K
Nonparametric statistics offer a powerful alternative to traditional parametric methods, useful when assumptions about the population distribution cannot be made. Unlike parametric tests, which require data to follow a specific distribution with well-defined parameters (such as the mean and standard deviation), nonparametric tests do not require such constraints. This makes them particularly valuable when dealing with small sample sizes, skewed data, or ordinal and categorical variables.
One of...
1.6K
Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data01:16

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

581
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,...
581
Spearman's Rank Correlation Test01:20

Spearman's Rank Correlation Test

1.6K
Spearman's rank correlation test, also known as Spearman's rho, is a nonparametric method for assessing the strength and direction of association between two variables. This test is particularly valuable when the data distribution is unknown or when the assumption of normality does not hold. Named after the English psychologist and statistician Dr. Charles Edward Spearman, it serves as the nonparametric counterpart to Pearson's correlation coefficient.
Spearman's test calculates correlation by...
1.6K

You might also read

Related Articles

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

Sort by
Same author

Interactive visualization of metric distortion in nonlinear data embeddings using the distortions package.

Briefings in bioinformatics·2026
Same author

Piikun: an information theoretic toolkit for analysis and visualization of species delimitation metric space.

BMC bioinformatics·2024
Same author

Modeling the cell-type-specific mesoscale murine connectome with anterograde tracing experiments.

Network neuroscience (Cambridge, Mass.)·2023
Same author

Water-Accelerated Photooxidation of CH<sub>3</sub>NH<sub>3</sub>PbI<sub>3</sub> Perovskite.

Journal of the American Chemical Society·2022
Same author

Refinement: Measuring informativeness of ratings in the absence of a gold standard.

The British journal of mathematical and statistical psychology·2022
Same author

An overview of clustering applied to molecular biology.

Methods in molecular biology (Clifton, N.J.)·2010

Related Experiment Video

Updated: Mar 27, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
08:12

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

3.0K

Bayesian Non-Parametric Clustering of Ranking Data.

Marina Meila, Harr Chen

    IEEE Transactions on Pattern Analysis and Machine Intelligence
    |January 14, 2016
    PubMed
    Summary

    This study introduces new algorithms for analyzing incomplete rankings using Dirichlet process mixtures and the generalized Mallows model. The developed methods efficiently handle complex ranking data, improving clustering accuracy and speed.

    Area of Science:

    • Statistics
    • Machine Learning
    • Computational Statistics

    Background:

    • Dirichlet process mixtures are powerful tools for non-parametric Bayesian clustering.
    • Analyzing discrete incomplete rankings presents significant computational challenges.
    • The generalized Mallows model offers a tractable approach to modeling permutations and top-t rankings.

    Purpose of the Study:

    • To develop efficient algorithms for estimating Dirichlet process mixtures over discrete incomplete rankings.
    • To address the lack of a conjugate prior for the generalized Mallows model.
    • To provide a flexible and accurate framework for analyzing complex ranking data.

    Main Methods:

    • Derivation of sampling theory for posterior distributions under Dirichlet process mixtures with generalized Mallows components.

    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.4K

    Related Experiment Videos

    Last Updated: Mar 27, 2026

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments
    08:12

    A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

    Published on: March 1, 2022

    3.0K
    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
  • Introduction of a family of partially collapsed Gibbs samplers.
  • Development of an exact slice-sampling algorithm and a fast, accurate approximate sampler.
  • Main Results:

    • The proposed Gibbs samplers effectively handle posterior inference for incomplete rankings.
    • The approximate sampler demonstrates superior mixing and accuracy, significantly reducing computation time.
    • Empirical results validate the effectiveness of the Dirichlet process approach over alternatives.

    Conclusions:

    • The developed algorithms provide a robust and efficient method for analyzing discrete incomplete rankings.
    • The approach offers significant advantages in terms of computational speed and clustering performance.
    • This work enables the exploration of large-scale real-world ranking datasets.