Imperial College London

Dr Dan Goodman

Faculty of EngineeringDepartment of Electrical and Electronic Engineering




+44 (0)20 7594 6264d.goodman Website




1001Electrical EngineeringSouth Kensington Campus






BibTex format

author = {Kadir, SN and Goodman, DFM and Harris, KD},
doi = {10.1162/NECO_a_00661},
journal = {Neural Computation},
pages = {2379--2394},
title = {High-Dimensional Cluster Analysis with the Masked EM Algorithm},
url = {},
volume = {26},
year = {2014}

RIS format (EndNote, RefMan)

AB - Cluster analysis faces two problems in high dimensions: the "curse of dimensionality" that can lead to overfitting and poor generalization performance and the sheer time taken for conventional algorithms to process large amounts of high-dimensional data. We describe a solution to these problems, designed for the application of spike sorting for nextgeneration, high-channel-count neural probes. In this problem, only a small subset of features provides information about the cluster membership of any one data vector, but this informative feature subset is not the same for all data points, rendering classical feature selection ineffective.We introduce a "masked EM" algorithm that allows accurate and time-efficient clustering of up to millions of points in thousands of dimensions. We demonstrate its applicability to synthetic data and to real-world high-channel-count spike sorting data.
AU - Kadir,SN
AU - Goodman,DFM
AU - Harris,KD
DO - 10.1162/NECO_a_00661
EP - 2394
PY - 2014///
SN - 0899-7667
SP - 2379
TI - High-Dimensional Cluster Analysis with the Masked EM Algorithm
T2 - Neural Computation
UR -
UR -
VL - 26
ER -