<< Chapter < Page Chapter >> Page >
s q = b q + h ϵ A w h q

From conditional probability rule

p ( q | i ) = p ( q & i ) p ( i )

arises Bayes Rule, which can then be iterated.

p ( q | i ) = p ( q ) p ( q | i ) p ( i ) . p ( q | i & j & k & . . . ) = p ( q ) p ( q | i ) p ( i ) p ( q | j ) p ( j ) p ( q | k ) p ( k ) . . . = p ( q ) h ϵ A p ( h | q ) p ( h ) .

Taking the logrithm of this term gives us something in the form we wanted:

l o g p ( q | A ) = l o g p ( q ) + h ϵ A l o g p ( h | q ) p ( q ) .

Thus we have that:

w h q = l o g p ( h | q ) p ( q ) = l o g p ( h & q ) p ( q ) p ( h ) .

The method for computing the probabilities is now explicated. For single probabilities (such as p ( q ) ), we simply look at each pattern and compute the proportion in which cell q is are active. If either p ( q ) or p ( h ) be zero set w h q to zero. For joint probabilities (such as p ( h & q ) ), compute the proportion in which both are active. If both p ( q ) and p ( h ) are not zero but p ( h & q ) is zero, set w h q to l o g ( 1 / # p a t t e r n s ) .

There exists a more complicated version in which different events/patterns carry more significance than others and are then weighted accordingly by κ ( α ) , this capability is not implemented in our simulations but the code can handle this option. The code for building the weight matrix (where entry w i j is connection strength from i to j ) is carried out by the code make _ W.m.

The method that produces the weight matrix W will produce a symmetric matrix. This should not be that limiting on the network model, but is not exactly representative of physiology.

Hooking up the network

The output from the weight matrix will yield positive and negative entries. If the entry is positive we have an excitatory connection. If an entry is negative there is an inhibitory connection. If the absolute value is less than a chosen tolerance then there is no connection.

Now comes an important step that is not entirely biologically correct but serves to make the over network model simpler. The patterns that we used in constructing the weight matrix in fact will consist of all excitatory cells. For each of these excitatory cells we will now designate a inhibitory companion cell through that only synapses onto the excitatory cell. All inhibition of the excitatory cells is achieved by other excitatory cells that synapse onto the inhibitory companion. Thus, there are an equal number of E and I cells. (as mentioned earlier there will be 50 E and 50 I cells in the simulations produced ahead).

Here we see an 8 cells network that has a the same conventions. The excitatory cells have 4 compartments each. Excitatory cell connections synapse onto the end compartment of other E-Cells and the second compartment of I-Cells (Since I-Cells only have 2 compartments). Inhibitory cells synapse onto the Soma's of the excitatory cells.
This is a diagram for an excitatory-inhibitory pair. In some sense we can regard this as a full neuron unit. Here the compartments are not show as they are above.

Simulations

The bulk of the theory is completed. Now, the specifications for the simulations are presented. The parameters that are used in the biological model presented earlier are given values. Then there is a few examples of how to use the matlab code. The code used can be downloaded at (External Link) .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




Source:  OpenStax, The art of the pfug. OpenStax CNX. Jun 05, 2013 Download for free at http://cnx.org/content/col10523/1.34
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'The art of the pfug' conversation and receive update notifications?

Ask