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.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 International Federation for Medical and Biological Engineering
About this paper
Cite this paper
Adamos, D.A., Laskaris, N.A., Kosmidis, E.K., Theophilidis, G. (2010). Spike Sorting based on Dominant-Sets clustering. In: Bamidis, P.D., Pallikarakis, N. (eds) XII Mediterranean Conference on Medical and Biological Engineering and Computing 2010. IFMBE Proceedings, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13039-7_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-13039-7_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13038-0
Online ISBN: 978-3-642-13039-7
eBook Packages: EngineeringEngineering (R0)