Automated spike sorting algorithm based on Laplacian eigenmaps and k-means clustering
Citation:Chah, E, Hok, V, Della-Chiesa, V, Miller, JJH, O'Mara SM & Reilly, RB., Automated spike sorting algorithm based on Laplacian eigenmaps and k-means clustering, Journal of Neural Engineering, 8, 2011, 016006
Automated spike sorting algorithm based on laplacian eigenmaps and k-means clustering.pdf (Published (publisher's copy) - Peer Reviewed) 580.3Kb
This study presents a new automatic spike sorting method based on feature extraction by Laplacian eigenmaps combined with k-means clustering. The performance of the proposed method was compared against previously reported algorithms such as principal component analysis (PCA) and amplitude-based feature extraction. Two types of classifier (namely k-means and classification expectation-maximization) were incorporated within the spike sorting algorithms, in order to find a suitable classifier for the feature sets. Simulated data sets and in-vivo tetrode multichannel recordings were employed to assess the performance of the spike sorting algorithms. The results show that the proposed algorithm yields significantly improved performance with mean sorting accuracy of 73% and sorting error of 10% compared to PCA which combined with k-means had a sorting accuracy of 58% and sorting error of 10%.
Type of material:Journal Article
Series/Report no:Journal of Neural Engineering
Availability:Full text available