Spike sorting is a prerequisite technique for neural coding and decoding research. So far many manual and automatic spike sorting approaches have been proposed, however this issue is still a challenge due to high time consumption of human or unreliability of machine. In this study, a semi-supervised spike sorting framework was proposed, in which three clustering or learning components, i.e. self-organizing map (SOM), manifold learning and affinity propagation clustering (APC) work cooperatively. The SOM serves as the technique for data reduction, as well as the visualization of cluster structure, which enabled the operator's "supervised" intervention. The manifold learning technique describes the intrinsic structure underlain by SOM grid, and yields the similarity matrix as output. The affinity propagation clustering takes as input the yielded similarity matrix, followed by the human's guidance, and outputs the reasonable clustering result. The advantage of our framework is the efficient combination of traditional and novel approaches, wherein the semi-supervised intervention is embedded appropriately to guide the clustering process. The practical experiments' results show that the proposed approach performed very well. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Wen, G. Z., & Huang, D. S. (2008). A novel spike sorting method based on semi-supervised learning. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5227 LNAI, pp. 605–615). https://doi.org/10.1007/978-3-540-85984-0_73
Mendeley helps you to discover research relevant for your work.