title: Unsupervised spike sorting based on discriminative subspace learning.
abstract: Spike sorting is a fundamental preprocessing step for many neuroscience studies which rely on the analysis of spike trains. In this paper, we present two unsupervised spike sorting algorithms based on discriminative subspace learning. The first algorithm simultaneously learns the discriminative feature subspace and performs clustering. It uses histogram of features in the most discriminative projection to detect the number of neurons. The second algorithm performs hierarchical divisive clustering that learns a discriminative 1-dimensional subspace for clustering in each level of the hierarchy until achieving almost unimodal distribution in the subspace. The algorithms are tested on synthetic and in-vivo data, and are compared against two widely used spike sorting methods. The comparative results demonstrate that our spike sorting methods can achieve substantially higher accuracy in lower dimensional feature space, and they are highly robust to noise. Moreover, they provide significantly better cluster separability in the learned subspace than in the subspace obtained by principal component analysis or wavelet transform.
authors.forename: Mohammad Reza
authors.initials: MR
authors.lastname: Keshtkaran
authors.forename: Zhi
authors.initials: Z
authors.lastname: Yang
mesh_terms: D000200:Action Potentials; D000465:Algorithms; D016000:Cluster Analysis; D016002:Discriminant Analysis; D006801:Humans; D000069550:Machine Learning; D009474:Neurons / Q000502:physiology; D025341:Principal Component Analysis; D012815:Signal Processing, Computer-Assisted; D058067:Wavelet Analysis