Abstract

We analyze the spike train data by means of the $k$-mean alignment algorithm in a double perspective: data as non periodic and data as periodic. In the first analysis, we show that alignment is not needed to identify paths. Indeed, without allowing for warping, we detect four clusters strongly associated to the four possible paths. In the second analysis, by exploiting the circular nature of data and allowing for shifts, we detect two clusters distinguishing between spike trains presenting higher or lower neuronal activity during the bottom-left/bottom-right movement respectively. In this latter case, the alignment procedure is able to match the four movements across paths.

Highlights

  • We here analyze the spike train data presented in Wu, Hatsopoulos and Srivastava (2014) with the aim of detecting spike trains associated to different paths or movements

  • This manuscript is divided in two sections: in the first one we analyze the 240 spike trains as functions defined on a common domain along the real axis; in the second section, given the circularity of the four possible paths, we analyze the 240 spike trains as periodic functions

  • Since the trajectories of the monkey right hand should be ideally close curves, always the same across paths, and with just the starting points differing across paths, we here analyze the 240 spike trains as periodic functions and apply the k-mean alignment with a similarity measure similar to that used in the previous section: ρ(fi, fj) =

Read more

Summary

Introduction

We here analyze the spike train data presented in Wu, Hatsopoulos and Srivastava (2014) with the aim of detecting spike trains associated to different paths or movements. All analyses have been performed using the fdakma R package downloadable from CRAN (Parodi et al (2014))

Non-periodic data analysis
Periodic data analysis
Discussion
Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.