Question: d. A self-organizing feature map has four cluster units arranged in a one- dimensional ring, as shown in the following diagram: 1 2 4 3

d. A self-organizing feature map has four cluster units arranged in a one- dimensional ring, as shown in the following diagram: 1 2 4 3 3 The weight vectors of the four units are given as follows: w1 = [-1.00-1.50, 0.50]T w2 = [2.00-2.00, 5.20]T W3 = [1.50, 6.00, 4.30]1 W4 = (-4.00, 7.00, 0.60]T An input vector X = (-1.40, 2.30, 0.2011 is presented to the network. Which unit is nearest to X in terms of Euclidean distance? Or who is the winner who will takes all? And what is the all
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
