binsdfc is a command line implementation of the algorithm described in Endres,Oram,Schindelin,Foldiak:Bayesian binning beats approximate alternatives: estimating peri-stimulus time histograms, Advances in NIPS, 2007. It computes spike density functions (SDF) or peri-stimulus time histograms (PSTH). Given that it performs exact Bayesian averaging, the result is somewhere in the middle between the two: while the underlying model is comprised of bins like a PSTH, the averaging process gives rise to a more "continuous" prediction like a SDF. binsdfc accepts input from stdin or a supplied file, and computes the expected SDF, its variance, latencies (as described in Endres, Schindelin, Foldiak, Oram (2007): Examining the joint neural code of latency and firing rate by Bayesian binning, paper will follow soon), and various other averages such as marginal likelihoods and model complexity posteriors. This work is supported by a MRC training fellowship.
- Changes to previous version:
Changed build system from automake to cmake. Moved download page to www.compsens.uni-tuebingen.de
No one has posted any comments yet. Perhaps you'd like to be the first?
Leave a comment
You must be logged in to post comments.