<--- Back to Details
First PageDocument Content
Computational neuroscience / Statistics / Neuroscience / Statistical theory / Neural networks / Bioinformatics / Artificial neural network / Bayesian network / Neural coding / Variational Bayesian methods / Bayesian inference / Hidden Markov model
Date: 2016-08-04 15:02:45
Computational neuroscience
Statistics
Neuroscience
Statistical theory
Neural networks
Bioinformatics
Artificial neural network
Bayesian network
Neural coding
Variational Bayesian methods
Bayesian inference
Hidden Markov model

A Bayesian model for identifying hierarchically organised states in neural population activity Patrick Putzky1,2,3 , Florian Franzen1,2,3 , Giacomo Bassetto1,3 , Jakob H. Macke1,3 1 Max Planck Institute for Biological Cy

Add to Reading List

Source URL: www.mackelab.org

Download Document from Source Website

File Size: 1,58 MB

Share Document on Facebook

Similar Documents

Unfolding Crime Scenarios with Variations: A Method for Building a Bayesian Network for Legal Narratives Charlotte S. VLEK a,1 , Henry PRAKKEN b,c , Silja RENOOIJ b and Bart VERHEIJ a,d a Institute of Artificial Intellig

Unfolding Crime Scenarios with Variations: A Method for Building a Bayesian Network for Legal Narratives Charlotte S. VLEK a,1 , Henry PRAKKEN b,c , Silja RENOOIJ b and Bart VERHEIJ a,d a Institute of Artificial Intellig

DocID: 1uDKU - View Document

Network Theory III: Bayesian Networks, Information and Entropy John Baez, Brendan Fong, Tobias Fritz, Tom Leinster Given finite sets X and Y , a stochastic map f : X Y assigns a

Network Theory III: Bayesian Networks, Information and Entropy John Baez, Brendan Fong, Tobias Fritz, Tom Leinster Given finite sets X and Y , a stochastic map f : X Y assigns a

DocID: 1umlL - View Document

From Arguments to Constraints on a Bayesian Network a Floris BEX a , Silja RENOOIJ a Information and Computing Sciences, Utrecht University, The Netherlands

From Arguments to Constraints on a Bayesian Network a Floris BEX a , Silja RENOOIJ a Information and Computing Sciences, Utrecht University, The Netherlands

DocID: 1tDUV - View Document

3.3. Independencies in Graphs  Algorithm 3.1 Algorithm for finding nodes reachable from X given Z via active trails Procedure Reachable ( G, // Bayesian network graph X, // Source variable

3.3. Independencies in Graphs Algorithm 3.1 Algorithm for finding nodes reachable from X given Z via active trails Procedure Reachable ( G, // Bayesian network graph X, // Source variable

DocID: 1tiRB - View Document

Bayesian Network Automata for Modelling Unbounded Structures James Henderson Department of Computer Science University of Geneva Geneva, Switzerland

Bayesian Network Automata for Modelling Unbounded Structures James Henderson Department of Computer Science University of Geneva Geneva, Switzerland

DocID: 1t04K - View Document