Search research articles

ABOUT JoVE

Overview Leadership Blog JoVE Help Center

AUTHORS

Publishing Process Editorial Board Scope & Policies Peer Review FAQ Submit

LIBRARIANS

Testimonials Subscriptions Access Resources Library Advisory Board FAQ

RESEARCH

JoVE Journal Methods Collections JoVE Encyclopedia of Experiments Archive

EDUCATION

JoVE Core JoVE Business JoVE Science Education JoVE Lab Manual Faculty Resource Center Faculty Site

Terms & Conditions of Use

Related Concept Videos

Cluster Sampling Method

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

Quantifying and Rejecting Outliers: The Grubbs Test

Quantifying and Rejecting Outliers: The Grubbs Test

Sometimes, a data set can have a recorded numerical observation that greatly deviates from the rest of the data. Assuming that the data is normally distributed, a statistical method called the Grubbs test can be used to determine whether the observation is truly an outlier. To perform a two-tailed Grubbs test, first, calculate the absolute difference between the outlier and the mean. Then, calculate the ratio between this difference and the standard deviation of the sample. This...

Distributions to Estimate Population Parameter

Distributions to Estimate Population Parameter

The accurate values of population parameters such as population proportion, population mean, and population standard deviation (or variance) are usually unknown. These are fixed values that can only be estimated from the data collected from the samples. The estimates of each of these parameters are sample proportion, the sample mean, and sample standard deviation (or variance). To obtain the values of these sample statistics, data are required that have particular distribution and central...

Detection of Gross Error: The Q Test

Detection of Gross Error: The Q Test

When one or more data points appear far from the rest of the data, there is a need to determine whether they are outliers and whether they should be eliminated from the data set to ensure an accurate representation of the measured value. In many cases, outliers arise from gross errors (or human errors) and do not accurately reflect the underlying phenomenon. In some cases, however, these apparent outliers reflect true phenomenological differences. In these cases, we can use statistical methods...

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

Statistical Inference Techniques in Hypothesis Testing: Parametric Versus Nonparametric Data

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,...

Expected Frequencies in Goodness-of-Fit Tests

Expected Frequencies in Goodness-of-Fit Tests

A goodness-of-fit test is conducted to determine whether the observed frequency values are statistically similar to the frequencies expected for the dataset. Suppose the expected frequencies for a dataset are equal such as when predicting the frequency of any number appearing when casting a die. In that case, the expected frequency is the ratio of the total number of observations (n) to the number of categories (k).

You might also read

Related Articles

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

Sort by

Same author

Domain Adaptation With Additional Features via Label-Aware and Graph-Based Fused Gromov-Wasserstein Optimal Transport.

Neural computation·2026

Same author

Sparse coding-based multiframe superresolution for efficient synchrotron radiation microspectroscopy.

Discover nano·2025

Same author

Gradual Domain Adaptation via Normalizing Flows.

Neural computation·2025

Same author

Rational partitioning of spectral feature space for effective clustering of massive spectral image data.

Scientific reports·2024

Same author

ATNAS: Automatic Termination for Neural Architecture Search.

Neural networks : the official journal of the International Neural Network Society·2023

Same author

Cost-effective framework for gradual domain adaptation with multifidelity.

Neural networks : the official journal of the International Neural Network Society·2023

Same journal

A Model-Free Reinforcement Learning Implementation of Decision Making Under Uncertainty by Sequential Sampling.

Neural computation·2026

Same journal

DROP: Distributional and Regular Optimism and Pessimism for Reinforcement Learning.

Neural computation·2026

Same journal

Hierarchical Active Inference Using Successor Representations.

Neural computation·2026

Same journal

W-Kernel and Its Principal Space for Frequentist Evaluation of Bayesian Estimators.

Neural computation·2026

Same journal

A Hidden Markov Model-Inspired Sequence Classification Method for Hyperdimensional Computing.

Neural computation·2026

Same journal

Sparse Graphical Modeling for Electrophysiological Phase-Based Connectivity Using Circular Statistics.

Neural computation·2026

See all related articles

Search research articles

Related Experiment Video

Updated: Apr 28, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

A nonparametric clustering algorithm with a quantile-based likelihood estimator.

Hideitsu Hino¹, Noboru Murata

¹Graduate School of Systems and Information Engineering, University of Tsukuba, Tsukuba, Ibaraki, Japan, 305-8573 hinohide@cs.tsukuba.ac.jp.

Neural Computation

|June 13, 2014

Summary

This summary is machine-generated.

This study introduces a new information-theoretic clustering algorithm for unsupervised learning. The proposed method optimizes conditional entropy and outperforms existing nonparametric clustering techniques without requiring tuning parameters.

More Related Videos

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

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

Published on: February 15, 2017

A Data-Driven Approach to Quantifying Immune States in Sepsis

A Data-Driven Approach to Quantifying Immune States in Sepsis

Published on: February 7, 2025

Related Experiment Videos

Last Updated: Apr 28, 2026

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

A Psychophysics Paradigm for the Collection and Analysis of Similarity Judgments

Published on: March 1, 2022

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

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

Published on: February 15, 2017

A Data-Driven Approach to Quantifying Immune States in Sepsis

A Data-Driven Approach to Quantifying Immune States in Sepsis

Published on: February 7, 2025

Area of Science:

Machine Learning
Data Mining
Information Theory

Background:

Clustering is a key unsupervised learning technique in exploratory data analysis.
Information-theoretic clustering methods offer flexibility by optimizing quantities like entropy and mutual information.
Nonparametric estimation allows for capturing diverse data structures without strong distributional assumptions.

Purpose of the Study:

To propose a novel, parameter-free iterative clustering algorithm.
To leverage information-theoretic principles for enhanced clustering performance.
To handle weighted data sets effectively in clustering.

Main Methods:

Developed a nonparametric estimator for the log-likelihood of weighted data.
Derived a clustering algorithm from conditional entropy minimization with maximum entropy regularization.
Utilized cluster-conditional information-theoretic quantities for weighted samples.

Main Results:

The proposed algorithm demonstrates comparable or superior performance to conventional nonparametric clustering methods.
The algorithm effectively captures intrinsic data structures.
Experimental results validate the efficacy of the information-theoretic approach.

Conclusions:

The novel iterative clustering algorithm is effective and requires no tuning parameters.
Information-theoretic clustering provides a robust framework for unsupervised learning.
The method offers a promising alternative for analyzing complex, weighted datasets.