A graph-Laplacian-based feature extraction algorithm for neural spike sorting.
Analysis of extracellular neural spike recordings is highly dependent upon the accuracy of neural waveform classification, commonly referred to as spike sorting. Feature extraction is an important stage of this process because it can limit the quality of clustering which is performed in the feature space. This paper proposes a new feature extraction method (which we call Graph Laplacian Features, GLF) based on minimizing the graph Laplacian and maximizing the weighted variance. The algorithm is compared with Principal Components Analysis (PCA, the most commonly-used feature extraction method) using simulated neural data. The results show that the proposed algorithm produces more compact and well-separated clusters compared to PCA. As an added benefit, tentative cluster centers are output which can be used to initialize a subsequent clustering stage.
Ghanbari
Yasser
Y
Department of Electrical Engineering, Southern Methodist University, Dallas, TX 75275, USA. yghanbari@smu.edu
Spence
Larry
L
Papamichalis
Panos
P
D000200:Action Potentials; D000465:Algorithms; D016000:Cluster Analysis; D003198:Computer Simulation; D003201:Computers; D003627:Data Interpretation, Statistical; D006801:Humans; D015233:Models, Statistical; D009415:Nerve Net; D009474:Neurons / Q000473:pathology*; D010363:Pattern Recognition, Automated / Q000379:methods; D025341:Principal Component Analysis; D011381:Programming Languages; D015203:Reproducibility of Results; D012815:Signal Processing, Computer-Assisted