Spike sorting based on dominant-sets clustering

1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Spike sorting algorithms aim at decomposing complex extracellularly recorded electrical signals to independent events from single neurons in the vicinity of electrode. The decision about the actual number of active neurons in a neural recording is still an open issue, with sparsely firing neurons and background activity the most influencing factors. We introduce a graph-theoretical algorithmic procedure that successfully resolves this issue. Dimensionality reduction coupled with a modern, efficient and progressively-executable clustering routine proved to achieve higher performance standards than popular spike sorting methods. Our method is validated extensively using simulated data for different levels of SNR. © 2010 International Federation for Medical and Biological Engineering.

Cite

CITATION STYLE

APA

Adamos, D. A., Laskaris, N. A., Kosmidis, E. K., & Theophilidis, G. (2010). Spike sorting based on dominant-sets clustering. In IFMBE Proceedings (Vol. 29, pp. 5–8). https://doi.org/10.1007/978-3-642-13039-7_2

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free