Neural spike classification using parallel selection of all algorithm parameters.
The Forster-Handwerker template-matching algorithm (J. Neurosci. Methods 31 (1990) 109) classifies neuronal spikes according to three parameters selected by the experimenter prior to running the algorithm. Thousands of different combinations of these parameter values are possible producing hundreds of different classifications for each input file. Using a 40-processor Linux-based parallel computing cluster, we ran their algorithm with an effective sampling of all combinations of parameter values in order to generate a list of the classifications that can be generated by the algorithm. A distance measure was used to quantify the similarity between classifications and then to create a distance table containing entries for the distances between all pairs of classifications. Using a self-organizing neural network (SON) and the distance table we group the classifications by similarity and select the best representative classifications that the Forster-Handwerker algorithm can produce.
Turnquist
Brian
B
Mathematics and Computer Science Department, Bethel College, Arden Hills, MN 55112, USA. turnquist@bethel.edu
Leverentz
Mark
M
Swanson
Erin
E
D000200:Action Potentials / Q000502:physiology*; D000465:Algorithms; D000818:Animals; D016247:Information Storage and Retrieval; D016571:Neural Networks, Computer; D009474:Neurons / Q000145:classification* / Q000502:physiology