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.0K
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.0K
Masking and Demasking Agents01:19

Masking and Demasking Agents

4.0K
EDTA titrations may necessitate masking and demasking agents to temporarily protect a particular metal ion in a mixture from the EDTA reaction. These agents facilitate the sequential analysis of the metal ions by forming stable complexes with some—but not all—metal ions during certain steps.
There are many masking agents, such as cyanide, fluoride, triethanolamine, thiourea, and 2,3-bis(sulfanyl)propan-1-ol (formerly 2,3-dimercapto-1-propanol), with the masking agent chosen based on...
4.0K
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

1.5K
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...
1.5K
Expected Frequencies in Goodness-of-Fit Tests01:19

Expected Frequencies in Goodness-of-Fit Tests

7.0K
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).
7.0K
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving01:29

Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving

437
Mechanistic models play a crucial role in algorithms for numerical problem-solving, particularly in nonlinear mixed effects modeling (NMEM). These models aim to minimize specific objective functions by evaluating various parameter estimates, leading to the development of systematic algorithms. In some cases, linearization techniques approximate the model using linear equations.
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
437

You might also read

Related Articles

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

Sort by
Same author

Algorithm-hardware co-design of neuromorphic networks with dual memory pathways.

Nature machine intelligence·2026
Same author

Art's hidden topology: A window into human perception.

PLoS computational biology·2026
Same author

Microfluidic patch integrated with cobalt oxide/cobalt phosphate nanozyme for electrochemical lactate sensing at neutral pH.

Talanta·2026
Same author

Brainwide blood volume reflects opposing neural populations.

Nature·2026
Same author

Mapping the visual cortex with Zebra noise and wavelets.

Journal of vision·2026
Same author

Learning spatial hearing via innate mechanisms.

PLoS computational biology·2025
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

Related Experiment Video

Updated: Apr 25, 2026

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

High-dimensional cluster analysis with the masked EM algorithm.

Shabnam N Kadir1, Dan F M Goodman, Kenneth D Harris

  • 1UCL Institute of Neurology and UCL Department of Neuroscience, Physiology, and Pharmacology, University College London, London WC1E 6DE, U.K. s.kadir@ucl.ac.uk.

Neural Computation
|August 24, 2014
PubMed
Summary
This summary is machine-generated.

We developed a masked EM algorithm to efficiently cluster millions of high-dimensional data points. This method addresses the curse of dimensionality and speeds up analysis for applications like neural spike sorting.

More Related Videos

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.2K
Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
08:45

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

14.2K

Related Experiment Videos

Last Updated: Apr 25, 2026

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.2K
ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data
05:12

ExCYT: A Graphical User Interface for Streamlining Analysis of High-Dimensional Cytometry Data

Published on: January 16, 2019

11.2K
Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example
08:45

Mapping Cortical Dynamics Using Simultaneous MEG/EEG and Anatomically-constrained Minimum-norm Estimates: an Auditory Attention Example

Published on: October 24, 2012

14.2K

Area of Science:

  • Computational neuroscience
  • Machine learning
  • Data science

Background:

  • High-dimensional data presents challenges like the curse of dimensionality, leading to overfitting and slow processing.
  • Traditional clustering methods struggle with large datasets in thousands of dimensions.
  • Spike sorting for neural probes requires efficient analysis of high-channel-count data.

Purpose of the Study:

  • To introduce a novel algorithm for accurate and time-efficient clustering in high dimensions.
  • To address the limitations of classical feature selection in scenarios with varying informative feature subsets.
  • To provide a scalable solution for analyzing large, high-dimensional datasets, particularly in neuroscience.

Main Methods:

  • Developed a "masked EM" algorithm, a variation of the Expectation-Maximization algorithm.
  • Designed the algorithm to handle datasets with millions of points and thousands of dimensions.
  • Focused on scenarios where informative features for clustering vary across data points.

Main Results:

  • The masked EM algorithm achieves accurate and time-efficient clustering of high-dimensional data.
  • Demonstrated effectiveness on both synthetic datasets and real-world spike sorting data.
  • Successfully addressed the curse of dimensionality and processing time issues.

Conclusions:

  • The masked EM algorithm offers a powerful solution for clustering large, high-dimensional datasets.
  • This method is particularly beneficial for next-generation spike sorting applications.
  • The algorithm enables efficient analysis where traditional methods fail.