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

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

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

Aggregates Classification

Aggregates Classification

Aggregate classification is generally based on its size, petrographic characteristics, weight, and source. Size classification ranges from coarse to fine aggregates, defined by the size of the particles. Coarse aggregates are particles that do not pass through ASTM sieve No. 4, and aggregates that pass through the sieve are fine aggregates.
Petrographic classification groups aggregates based on common mineralogical characteristics. Some of the common mineral groups found in aggregates are...

Midrange

Midrange

A somewhat easy to compute quantitative estimate of a data set’s central tendency is its midrange, which is defined as the mean of the minimum and maximum values of an ordered data set.
Simply put, the midrange is half of the data set’s range. Similar to the mean, the midrange is sensitive to the extreme values and hence the prospective outliers. However, unlike the mean, the midrange is not sensitive to all the values of the data set that lie in the middle. Thus, it is prone to outliers and...

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

Chebyshev's Theorem to Interpret Standard Deviation

Chebyshev's Theorem to Interpret Standard Deviation

Chebyshev’s theorem, also known as Chebyshev’s Inequality, states that the proportion of values of a dataset for K standard deviation is calculated using the equation:

You might also read

Related Articles

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

Sort by

Same author

Rough annealing by two-step clustering, with application to neuronal signals.

Journal of neuroscience methods·1999

See all related articles

Search research articles

Related Experiment Video

Updated: Jul 7, 2026

Using the Race Model Inequality to Quantify Behavioral Multisensory Integration Effects

Using the Race Model Inequality to Quantify Behavioral Multisensory Integration Effects

Published on: May 10, 2019

Quantizing for minimum average misclassification risk.

C Diamantini¹, A Spalvieri

¹Istituto di Informatica, Dipartimento di Elettronica, Universitá di Ancona, I-60131 Ancona, Italy.

IEEE Transactions on Neural Networks

|February 7, 2008

Summary

This study introduces a new learning algorithm for optimizing labeled vector quantizers (VQ) in pattern classification. The algorithm enhances classification performance by minimizing average misclassification risk.

Related Experiment Videos

Last Updated: Jul 7, 2026

Using the Race Model Inequality to Quantify Behavioral Multisensory Integration Effects

Using the Race Model Inequality to Quantify Behavioral Multisensory Integration Effects

Published on: May 10, 2019

Area of Science:

Machine Learning
Pattern Recognition
Data Science

Background:

Pattern classification relies on decision rules, which partition the observation space into classes.
Vector quantizers (VQ) can be used to establish decision rules by labeling code vectors.

Purpose of the Study:

To propose a learning algorithm for optimizing labeled VQ classifiers.
To improve classification performance with a fixed number of code vectors.

Main Methods:

Developed a learning algorithm to optimize the positions of labeled code vectors.
The optimization criterion is the minimum average misclassification risk.

Main Results:

The proposed algorithm effectively optimizes code vector positions.
Demonstrated improved classification performance under the specified criterion.

Conclusions:

The learning algorithm offers an effective method for designing high-performance VQ classifiers.
Optimizing code vector placement is crucial for minimizing misclassification risk.