计算脉冲序列Kendall相关的O(n)方法
An O(n) method of calculating Kendall correlations of spike trains
摘要:
记录越来越多的神经元的能力,以及对大规模神经网络模拟的越来越多的关注,需要计算上快速的算法来计算相关的统计测量。我们提出了一个O(n)的算法来计算肯德尔相关的脉冲序列,相关措施,特别是成为公认的神经科学中的一个重要工具。我们表明,我们的方法是大约50倍的速度比O(nln n)的方法,这是一个快速计算肯德尔相关性的当前标准。除了提供一个更快的算法,我们强调的作用,采取特定性质的脉冲序列上减少运行时间。我们可以想象,考虑到这一点,还有许多其他有用的算法可以更显着地加速。一个执行这里描述的方法的MATLAB函数已经在线免费提供。
英文摘要:
The ability to record from increasingly large numbers of neurons, and the increasing attention being paid to large scale neural network simulations, demands computationally fast algorithms to compute relevant statistical measures. We present an O(n) algorithm for calculating the Kendall correlation of spike trains, a correlation measure that is becoming especially recognized as an important tool in neuroscience. We show that our method is around 50 times faster than the O (n ln n) method which is a current standard for quickly computing the Kendall correlation. In addition to providing a faster algorithm, we emphasize the role that taking the specific nature of spike trains had on reducing the run time. We imagine that there are many other useful algorithms that can be even more significantly sped up when taking this into consideration. A MATLAB function executing the method described here has been made freely available on-line.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。