How does one represent nodes in a 2-D neural network?
In self-organizing neural networks(Kohonen map) how is weight of node related to co-ordinate in 2D network. Does the map self-organize based on co-ordinate of location or weight at that location.
I am trying to implement the algorithm shown below using MPI
Distributed Localization Algorithm:
Input: N
, the number of nodes; G = (g_ij)
, knowledge of nearest neighbors Output: node positions p_i = (x_i,y_j), i,j = 1,......,N
// Initialization of the node locations
for all nodes i do
p_i = (x_i,y_j) = random();
end for
// Main Loop
for t = 1 to N_iter do
p = (x,y) = random()
for all network nodes i, update its location
for j=1 to N
x_i (t+1) = x_i (t) +α(t) δ_ij [x-x_i(t)]
y_i (t+1) = y_i (t) +α(t) δ_ij [y-y_i(t)]
for k=1 to N
for m=1 to N
tmp += g_km exp{ ||p-p_k||2 } exp{ ||p-p_m||2 }
end for
end for
δ_ij = g_ij exp{ ||p-p_i||2 } exp{ ||p-p_j||2 } / tmp
end for
end for
end for