High-dimensional cluster analysis with the masked EM algorithm

Shabnam N. Kadir, Dan F.M. Goodman, Kenneth D. Harris

Research output: Contribution to journalArticlepeer-review

158 Citations (Scopus)
42 Downloads (Pure)

Abstract

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.

Original languageEnglish
Pages (from-to)2379-2394
Number of pages16
JournalNeural Computation
Volume26
Issue number11
Early online date10 Oct 2014
DOIs
Publication statusPublished - 20 Nov 2014

Fingerprint

Dive into the research topics of 'High-dimensional cluster analysis with the masked EM algorithm'. Together they form a unique fingerprint.

Cite this