Javascript must be enabled to continue!
Optimizing Time Histograms for Non-Poissonian Spike Trains
View through CrossRef
The time histogram is a fundamental tool for representing the inhomogeneous density of event occurrences such as neuronal firings. The shape of a histogram critically depends on the size of the bins that partition the time axis. In most neurophysiological studies, however, researchers have arbitrarily selected the bin size when analyzing fluctuations in neuronal activity. A rigorous method for selecting the appropriate bin size was recently derived so that the mean integrated squared error between the time histogram and the unknown underlying rate is minimized (Shimazaki & Shinomoto, 2007 ). This derivation assumes that spikes are independently drawn from a given rate. However, in practice, biological neurons express non-Poissonian features in their firing patterns, such that the spike occurrence depends on the preceding spikes, which inevitably deteriorate the optimization. In this letter, we revise the method for selecting the bin size by considering the possible non-Poissonian features. Improvement in the goodness of fit of the time histogram is assessed and confirmed by numerically simulated non-Poissonian spike trains derived from the given fluctuating rate. For some experimental data, the revised algorithm transforms the shape of the time histogram from the Poissonian optimization method.
Title: Optimizing Time Histograms for Non-Poissonian Spike Trains
Description:
The time histogram is a fundamental tool for representing the inhomogeneous density of event occurrences such as neuronal firings.
The shape of a histogram critically depends on the size of the bins that partition the time axis.
In most neurophysiological studies, however, researchers have arbitrarily selected the bin size when analyzing fluctuations in neuronal activity.
A rigorous method for selecting the appropriate bin size was recently derived so that the mean integrated squared error between the time histogram and the unknown underlying rate is minimized (Shimazaki & Shinomoto, 2007 ).
This derivation assumes that spikes are independently drawn from a given rate.
However, in practice, biological neurons express non-Poissonian features in their firing patterns, such that the spike occurrence depends on the preceding spikes, which inevitably deteriorate the optimization.
In this letter, we revise the method for selecting the bin size by considering the possible non-Poissonian features.
Improvement in the goodness of fit of the time histogram is assessed and confirmed by numerically simulated non-Poissonian spike trains derived from the given fluctuating rate.
For some experimental data, the revised algorithm transforms the shape of the time histogram from the Poissonian optimization method.
Related Results
Rescheduling Urban Rail Transit Trains to Serve Passengers from Uncertain Delayed High-Speed Railway Trains
Rescheduling Urban Rail Transit Trains to Serve Passengers from Uncertain Delayed High-Speed Railway Trains
This paper develops a multi-objective mixed-integer linear programming model for the problem of robust rescheduling for capacitated urban rail transit (URT) trains to serve passeng...
Rate Coding Versus Temporal Order Coding: What the Retinal Ganglion Cells Tell the Visual Cortex
Rate Coding Versus Temporal Order Coding: What the Retinal Ganglion Cells Tell the Visual Cortex
It is often supposed that the messages sent to the visual cortex by the retinal ganglion cells are encoded by the mean firing rates observed on spike trains generated with a Poisso...
A New Multineuron Spike Train Metric
A New Multineuron Spike Train Metric
The Victor-Purpura spike train metric has recently been extended to a family of multineuron metrics and used to analyze spike trains recorded simultaneously from pairs of proximate...
Optimizing Random Forests: Spark Implementations of Random Genetic Forests
Optimizing Random Forests: Spark Implementations of Random Genetic Forests
The Random Forest (RF) algorithm, originally proposed by Breiman [7], is a widely used machine learning algorithm that gains its merit from its fast learning speed as well as high ...
Machine learning-based life cycle assessment for environmental sustainability optimization of a food supply chain
Machine learning-based life cycle assessment for environmental sustainability optimization of a food supply chain
Abstract
Effective resource allocation in the agri-food sector is essential in mitigating environmental impacts and moving toward circular food supply chains. The po...
TIME GARDENS, TIME FIGURES, AND TIME REGIMES
TIME GARDENS, TIME FIGURES, AND TIME REGIMES
ABSTRACTIn Zeitgärten: Zeitfiguren in der Geschichte der Neuzeit, Lucian Hölscher distinguishes between an embodied time and an empty time. Simply put, an embodied time includes hi...
“Excused from time”: Time and Consciousness in John Wray’s The Lost Time Accidents and Adam Roberts’s The Thing Itself
“Excused from time”: Time and Consciousness in John Wray’s The Lost Time Accidents and Adam Roberts’s The Thing Itself
ABSTRACT
Western culture tends to separate the notion of phenomenological time (subjective time experienced in individual consciousness) from cosmological time (obje...
HIGH-SPEED TRAINS – MAGLEV TRAINS
HIGH-SPEED TRAINS – MAGLEV TRAINS
The development of megacities, with a large population, imposes increasing mobility in order tomaintain the economic and social development. There is a great necessity for a contem...