Edwards B W, Wakefield G H
Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor 48109-2122.
J Neurosci Methods. 1992 Oct-Nov;45(1-2):1-14. doi: 10.1016/0165-0270(92)90038-f.
Modern technology is allowing researchers to collect data from neural ensembles with a large number of units, and the analysis of interaction between these units can be very time consuming. Estimation of pairwise connectivity is the most common method of determining the neural 'network' but usually necessitates the production of numerous histograms for each pair considered. We present a method which will indicate which pairs in a network represent potential connections and thereby simplify the postexperimental analysis. The technique uses cross-interval information to create an n x n matrix which represents all possible connections in an n neuron ensemble and can be calculated recursively on-line. The performance of this technique is analyzed with respect to data size and strength of the connections. It is compared to 2 similar techniques that are also presented here, one in which perfect knowledge of the timing of the excitation is known, and one in which the timing can be bounded.
现代技术使研究人员能够从包含大量神经元的神经集合中收集数据,而分析这些神经元之间的相互作用可能非常耗时。成对连接性估计是确定神经“网络”最常用的方法,但通常需要为每一对考虑的神经元生成大量直方图。我们提出了一种方法,该方法将指出网络中的哪些对代表潜在连接,从而简化实验后的分析。该技术利用交叉间隔信息创建一个n×n矩阵,该矩阵表示n个神经元集合中的所有可能连接,并且可以在线递归计算。针对数据大小和连接强度分析了该技术的性能。它与这里也介绍的另外两种类似技术进行了比较,一种是已知激发时间的完美知识,另一种是激发时间可以界定的情况。