Optimal feature subset selection for neuron spike sorting using the genetic algorithm


Autoria(s): Khan, Burhan; Bhatti, Asim; Johnstone, Michael; Hanoun, Samer; Creighton, Douglas; Nahavandi, Saeid
Data(s)

01/01/2015

Resumo

It is crucial for a neuron spike sorting algorithm to cluster data from different neurons efficiently. In this study, the search capability of the Genetic Algorithm (GA) is exploited for identifying the optimal feature subset for neuron spike sorting with a clustering algorithm. Two important objectives of the optimization process are considered: to reduce the number of features and increase the clustering performance. Specifically, we employ a binary GA with the silhouette evaluation criterion as the fitness function for neuron spike sorting using the Super-Paramagnetic Clustering (SPC) algorithm. The clustering results of SPC with and without the GA-based feature selector are evaluated using benchmark synthetic neuron spike data sets. The outcome indicates the usefulness of the GA in identifying a smaller feature set with improved clustering performance.

Identificador

http://hdl.handle.net/10536/DRO/DU:30080687

Idioma(s)

eng

Publicador

Spring

Relação

http://dro.deakin.edu.au/eserv/DU:30080687/khan-optimalfeaturesubset-2015.pdf

http://dro.deakin.edu.au/eserv/DU:30080687/khan-optimalfeaturesubset-evid1-2015.pdf

http://dro.deakin.edu.au/eserv/DU:30080687/khan-optimalfeaturesubset-evid2-2015.pdf

http://www.dx.doi.org/10.1007/978-3-319-26535-3_42

Direitos

2015, Springer

Palavras-Chave #Science & Technology #Technology #Computer Science, Artificial Intelligence #Computer Science, Theory & Methods #Computer Science #Genetic algorithm #Super-Paramagnetic clustering #Neuron spike sorting #Features selection #Optimization #INFORMATION
Tipo

Conference Paper