|
Algorithm 1 Training process of self-organizing mapping neural network (SOM) |
-
Input:
The normalized traffic condition sample X.
-
Output:
The well-trained SOM network.
-
1:
Initializing and normalize weight W, ; initial neighborhood radius ; initial learning rate ; initial max iterations and iterations .
-
2:
while < do
-
3:
for i = 1 to do
-
4:
Choose the traffic condition sample .
-
5:
for j = 1 to do
-
6:
Calculate the Euclidean distance and select the nearest winning node.
-
7:
for K = 1 to do
-
8:
Update the weight of the winning node and the neighbor nodes.
-
9:
Update the number of iteration, learning rate, and neighborhood radius function.
-
10:
end for
-
11:
end for
-
12:
end for
-
13:
end while
|