Dear guest, welcome to this publication database. As an anonymous user, you will probably not have edit rights. Also, the collapse status of the topic tree will not be persistent. If you like to have these and other options enabled, you might ask Pascal Held for a login account.
| This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit www.aigaion.nl. |
|
Finding Ensembles of Neurons in Spike Trains by Non-linear Mapping and Statistical Testing
| Type of publication: | Incollection |
| Citation: | |
| Booktitle: | Advances in Intelligent Data Analysis X |
| Edition: | Gama, João and Bradley, Elizabeth and Hollmén, Jaakko |
| Series: | Lecture Notes in Computer Science |
| Volume: | 7014 |
| Year: | 2011 |
| Pages: | 55-66 |
| Publisher: | Springer Berlin / Heidelberg |
| ISBN: | 978-3-642-24799-6 |
| URL: | http://dx.doi.org/10.1007/978-... |
| DOI: | 10.1007/978-3-642-24800-9_8 |
| Abstract: | Finding ensembles in neural spike trains has been a vital task in neurobiology ever since D.O. Hebb’s work on synaptic plasticity. However, with recent advancements in multi-electrode technology, which provides means to record 100 and more spike trains simultaneously, classical ensemble detection methods became infeasible due to a combinatorial explosion and a lack of reliable statistics. To overcome this problem we developed an approach that reorders the spike trains (neurons) based on pairwise distances and Sammon’s mapping to one dimension. Thus, potential ensemble neurons are placed close to each other. As a consequence we can reduce the number of statistical tests considerably over enumeration-based approaches, since linear traversals of the neurons suffice, and thus can achieve much lower rates of false-positives. This approach is superior to classical frequent item set mining algorithms, especially if the data itself is imperfect, e.g. if only a fraction of the items in a considered set is part of a transaction. |
| Keywords: | |
| Authors | |
| Added by: | [] |
| Total mark: | 0 |
|
Attachments
|
|
|
Notes
|
|
|
|
|
|
Topics
|
|
