bioRxivNeurosciencePreprint
Heuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm
David A. BjånesiD, Lee E. FisheriD, Robert A. GauntiD, Douglas J. WeberiD
Abstract
Bj[a]nes DA, Fisher LE, Gaunt RA, Weber DJHeuristic Spike Sorting Tuner (HSST), a framework to determine optimal parameter selection for a generic spike sorting algorithm. bioRxiv First published May 21, 2020. Extracellular microelectrodes frequently record neural activity from more than one neuron in the vicinity of the electrode. The process of labeling each recorded spike waveform with the identity of its source neuron is called spike sorting and is often approached from an abstracted statistical perspective. However, these approaches do not consider neurophysiological realities and may ignore important features that could improve the accuracy of these methods. Further, standard algorithms typically require selection of at least one free parameter, which can have significant effects on the quality of the output. We describe a Heuristic Spike Sorting Tuner (HSST) that determines the optimal choice of the free parameters for a given spike sorting algorithm based on the neurophysiological qualification of unit isolation and signal discrimination. A set of heuristic metrics are used to score the output of a spike sorting algorithm over a range of free parameters resulting in optimal sorting quality. We demonstrate that these metrics can be used to tune parameters in several spike sorting algorithms. The HSST algorithm shows robustness to variations in signal to noise ratio, number and relative size of units per channel. Moreover, the HSST algorithm is computationally efficient, operates unsupervised, and is parallelizable for batch processing. NEW & NOTEWORTHYHSST incorporates known neurophysiological priors of extracellular neural recordings while simultaneously taking advantage of powerful abstract mathematical tools. Rather than simply selecting free parameters prior to running a sorting algorithm, HSST executes a sorting algorithm across a range of input parameters, using heuristic metrics to detect which spike-sorting output is most physiologically plausible. This novel approach enables unsupervised spike-sorting exceeding the performance of previous methods, thereby enabling the processing of large data sets with confidence.
- Citations
- 1
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
- Fast and accurate spike sorting in vitro and in vivo for up to thousands of electrodes
Pierre Yger, Giulia L. B. Spampinato, … Olivier Marre·bioRxiv·Aug 4, 2016
- Recent progress in multi-electrode spike sorting methods
Baptiste Lefebvre, Pierre Yger, Olivier Marre·Journal of Physiology-ParisPeer-reviewed·Nov 1, 2016
- Solving the spike sorting problem with Kilosort
Marius Pachitariu, Shashwat Sridhar, Carsen Stringer·bioRxiv·Jan 7, 2023
- D.sort: template based automatic spike sorting tool
Madeny Belkhiri, Duda Kvitsiani·bioRxiv·Sep 23, 2018
- WaveLimit: An optimal spike sorting inclusion boundary
Xavier Scherschligt, Wei-Hsien Lee, … Adam G. Rouse·bioRxiv·Jul 1, 2025
- 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