Neural Comp. NEW Faster Access
HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
 QUICK SEARCH:   [advanced]


     


This Article
Right arrow Full Text
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Download to citation manager
Right arrow reprints & permissions
Citing Articles
Right arrow Citing Articles via HighWire
Right arrow Citing Articles via Google Scholar
Google Scholar
Right arrow Articles by Ikeda, K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ikeda, K.
(Neural Computation. 2005;17:2719-2735.)
© 2005 The MIT Press


Letter

Information Geometry of Interspike Intervals in Spiking Neurons

Kazushi Ikeda

kazushi{at}i.kyoto-u.ac.jp., Graduate School of Informatics, Kyoto University, Sakyo, Kyoto 606-8501 Japan

An information geometrical method is developed for characterizing or classifying neurons in cortical areas, whose spike rates fluctuate in time. Under the assumption that the interspike intervals of a spike sequence of a neuron obey a gamma process with a time-variant spike rate and a fixed shape parameter, we formulate the problem of characterization as a semiparametric statistical estimation, where the spike rate is a nuisance parameter. We derive optimal criteria from the information geometrical viewpoint when certain assumptions are added to the formulation, and we show that some existing measures, such as the coefficient of variation and the local variation, are expressed as estimators of certain functions under the same assumptions.




This article has been cited by other articles:


Home page
Neural Comput.Home page
K. Miura, M. Okada, and S.-i. Amari
Estimating Spiking Irregularities Under Changing Environments.
Neural Comput., October 1, 2006; 18(10): 2359 - 2386.
[Abstract] [Full Text] [PDF]


Home page
IEICE Trans FundamentalsHome page
K. IKEDA
Geometric Properties of Quasi-Additive Learning Algorithms
IEICE Trans A: Fundamentals, October 1, 2006; E89-A(10): 2812 - 2817.
[Abstract] [PDF]




HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS
J COGNITIVE NEUROSCIENCE NEURAL COMPUTATION MIT PRESS JOURNALS
Copyright © 2005 by The MIT Press.