首页    期刊浏览 2024年07月06日 星期六
登录注册

文章基本信息

  • 标题:Kernel Analysis for Estimating the Connectivity of a Network with Event Sequences
  • 本地全文:下载
  • 作者:Taro Tezuka ; Christophe Claramunt
  • 期刊名称:Journal of Artificial Intelligence and Soft Computing Research
  • 电子版ISSN:2083-2567
  • 出版年度:2017
  • 卷号:7
  • 期号:1
  • 页码:17-31
  • DOI:10.1515/jaiscr-2017-0002
  • 出版社:Walter de Gruyter GmbH
  • 摘要:Estimating the connectivity of a network from events observed at each node has many applications. One prominent example is found in neuroscience, where spike trains (sequences of action potentials) are observed at each neuron, but the way in which these neurons are connected is unknown. This paper introduces a novel method for estimating connections between nodes using a similarity measure between sequences of event times. Specifically, a normalized positive definite kernel defined on spike trains was used. The proposed method was evaluated using synthetic and real data, by comparing with methods using transfer entropy and the Victor-Purpura distance. Synthetic data was generated using CERM (Coupled Escape-Rate Model), a model that generates various spike trains. Real data recorded from the visual cortex of an anaesthetized cat was analyzed as well. The results showed that the proposed method provides an effective way of estimating the connectivity of a network when the time sequences of events are the only available information.
  • 关键词:connectivity estimation ; neural network ; kernel methods ; spike train
国家哲学社会科学文献中心版权所有