Scientific ReportsNeurosciencePeer-reviewed journal article
A Robust Spike Sorting Method based on the Joint Optimization of Linear Discrimination Analysis and Density Peaks
Yiwei ZhangiD, Jiawei HaniD, Tengjun LiuiD, Zelan Yang, Weidong CheniD, Shaomin ZhangiD
Abstract
ObjectiveSpike sorting is a fundamental step in extracting single-unit activity from neural ensemble recordings, which play an important role in basic neuroscience and neurotechnologies. A few algorithms have been applied in spike sorting. However, when noise level or waveform similarity becomes relatively high, their robustness still faces a big challenge. ApproachIn this study, we propose a spike sorting method combining Linear Discriminant Analysis (LDA) and Density Peaks (DP) for feature extraction and clustering. Relying on the joint optimization of LDA and DP: DP provides more accurate classification labels for LDA, LDA extracts more discriminative features to cluster for DP, and the algorithm achieves high performance after iteration. We first compared the proposed LDA-DP algorithm with several algorithms on one publicly available simulated dataset and one real rodent neural dataset with different noise levels. We further demonstrated the performance of the LDA-DP method on a real neural dataset from non-human primates with more complex distribution characteristics. Main resultsThe results show that our LDA-DP algorithm extracts a more discriminative feature subspace and achieves better cluster quality than previously established methods in both simulated and real data. Especially in the neural recordings with high noise levels or waveform similarity, the LDA-DP still yields a robust performance with automatic detection of the number of clusters. SignificanceThe proposed LDA-DP algorithm achieved high sorting accuracy and robustness to noise, which offers a promising tool for spike sorting and facilitates the following analysis of neural population activity.
- organism: mouse
- organism: non-human primate
- assay: electronic health records
- research focus: clustering
- research focus: cell type annotation
- approach: statistical model
- approach: machine learning (classical)
- Citations
- 13
- FWCI
- 1.21
- Field percentile
- top 24%
Reproducibility ledger
Nobody has reported trying to reproduce this paper yet. Did you replicate an experiment or run the code? Your report saves the next lab a week.
Sign in to file a reproducibility report.
Related papers
- A fully automated spike sorting algorithm using t-distributed neighbor embedding and density based clustering
Mohammad Hossein Nadian, Saeed Karimimehr, … Reza Lashgari·bioRxiv·Sep 26, 2018
- Online spike sorting via deep contractive autoencoder
Mohammadreza Radmanesh, Ahmad Asgharian Rezaei, … Morteza Moazami Goudarzi·Neural NetworksPeer-reviewed·Aug 5, 2022
- WaveLimit: An optimal spike sorting inclusion boundary
Xavier Scherschligt, Wei-Hsien Lee, … Adam G. Rouse·bioRxiv·Jul 1, 2025
- Relevance of UMAP for efficient and robust spike sorting
Daniel Suárez-Barrera, Lucas Bayones, … Román Rossi-Pool·bioRxiv·Mar 27, 2025
- Unsupervised spike sorting for large scale, high density multielectrode arrays
Gerrit Hilgen, Martino Sorbaro, … Matthias H. Hennig·Cell ReportsPeer-reviewed·Mar 1, 2017
- YASS: Yet Another Spike Sorter
JinHyung Lee, David Carlson, … Liam Paninski·bioRxiv·Jun 19, 2017