%Aigaion2 BibTeX export from Bibliography Database of the Working Group on Computational Intelligence
%Tuesday 16 July 2024 09:57:20 AM

@INCOLLECTION{,
     author = {Braune, Christian and Borgelt, Christian and Gr{\"{u}}n, Sonja},
      title = {Finding Ensembles of Neurons in Spike Trains by Non-linear Mapping and Statistical Testing},
  booktitle = {Advances in Intelligent Data Analysis X},
    edition = {Gama, Jo{\~{a}}o and Bradley, Elizabeth and Hollm{\'{e}}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-3-642-24800-9_8},
        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.}
}